./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.fischer.1.prop1-func-interl.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.fischer.1.prop1-func-interl.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 82abe2bc16b32af306db7c09a41c9db0587ba64425916c43bed05447e1d05407 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 06:07:41,241 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 06:07:41,322 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 06:07:41,326 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 06:07:41,327 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 06:07:41,363 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 06:07:41,364 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 06:07:41,365 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 06:07:41,366 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 06:07:41,366 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 06:07:41,367 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 06:07:41,367 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 06:07:41,368 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 06:07:41,368 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 06:07:41,370 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 06:07:41,370 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 06:07:41,371 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 06:07:41,371 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 06:07:41,371 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 06:07:41,372 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 06:07:41,372 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 06:07:41,376 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 06:07:41,377 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 06:07:41,377 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 06:07:41,377 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 06:07:41,378 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 06:07:41,378 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 06:07:41,378 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 06:07:41,378 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 06:07:41,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:07:41,379 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 06:07:41,379 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 06:07:41,379 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 06:07:41,380 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 06:07:41,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 06:07:41,380 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 06:07:41,380 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 06:07:41,381 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 06:07:41,381 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 06:07:41,381 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 82abe2bc16b32af306db7c09a41c9db0587ba64425916c43bed05447e1d05407 [2024-10-11 06:07:41,687 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 06:07:41,732 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 06:07:41,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 06:07:41,736 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 06:07:41,737 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 06:07:41,738 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.fischer.1.prop1-func-interl.c [2024-10-11 06:07:43,416 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 06:07:43,718 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 06:07:43,719 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.fischer.1.prop1-func-interl.c [2024-10-11 06:07:43,744 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ac182cc38/50f11eca281a4edab464505a754315cb/FLAG875db4c39 [2024-10-11 06:07:43,771 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ac182cc38/50f11eca281a4edab464505a754315cb [2024-10-11 06:07:43,775 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 06:07:43,777 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 06:07:43,781 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 06:07:43,782 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 06:07:43,788 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 06:07:43,789 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:07:43" (1/1) ... [2024-10-11 06:07:43,790 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53ea6ed9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:43, skipping insertion in model container [2024-10-11 06:07:43,790 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:07:43" (1/1) ... [2024-10-11 06:07:43,886 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 06:07:44,110 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.fischer.1.prop1-func-interl.c[1174,1187] [2024-10-11 06:07:44,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:07:44,354 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 06:07:44,366 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.fischer.1.prop1-func-interl.c[1174,1187] [2024-10-11 06:07:44,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:07:44,522 INFO L204 MainTranslator]: Completed translation [2024-10-11 06:07:44,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:44 WrapperNode [2024-10-11 06:07:44,523 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 06:07:44,524 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 06:07:44,525 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 06:07:44,525 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 06:07:44,533 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:44" (1/1) ... [2024-10-11 06:07:44,594 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:44" (1/1) ... [2024-10-11 06:07:45,413 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3785 [2024-10-11 06:07:45,418 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 06:07:45,419 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 06:07:45,419 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 06:07:45,419 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 06:07:45,493 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:44" (1/1) ... [2024-10-11 06:07:45,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:44" (1/1) ... [2024-10-11 06:07:45,728 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:44" (1/1) ... [2024-10-11 06:07:45,842 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 06:07:45,842 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:44" (1/1) ... [2024-10-11 06:07:45,842 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:44" (1/1) ... [2024-10-11 06:07:45,980 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:44" (1/1) ... [2024-10-11 06:07:46,060 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:44" (1/1) ... [2024-10-11 06:07:46,086 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:44" (1/1) ... [2024-10-11 06:07:46,119 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:44" (1/1) ... [2024-10-11 06:07:46,234 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 06:07:46,236 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 06:07:46,236 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 06:07:46,236 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 06:07:46,237 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:44" (1/1) ... [2024-10-11 06:07:46,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:07:46,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:07:46,283 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 06:07:46,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 06:07:46,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 06:07:46,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 06:07:46,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 06:07:46,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 06:07:46,632 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 06:07:46,635 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 06:07:50,831 INFO L? ?]: Removed 2119 outVars from TransFormulas that were not future-live. [2024-10-11 06:07:50,832 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 06:07:50,924 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 06:07:50,925 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 06:07:50,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:07:50 BoogieIcfgContainer [2024-10-11 06:07:50,926 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 06:07:50,928 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 06:07:50,928 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 06:07:50,932 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 06:07:50,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:07:43" (1/3) ... [2024-10-11 06:07:50,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62886712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:07:50, skipping insertion in model container [2024-10-11 06:07:50,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:44" (2/3) ... [2024-10-11 06:07:50,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62886712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:07:50, skipping insertion in model container [2024-10-11 06:07:50,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:07:50" (3/3) ... [2024-10-11 06:07:50,935 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.fischer.1.prop1-func-interl.c [2024-10-11 06:07:50,953 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 06:07:50,953 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 06:07:51,047 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 06:07:51,055 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@aa77975, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 06:07:51,056 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 06:07:51,069 INFO L276 IsEmpty]: Start isEmpty. Operand has 1325 states, 1323 states have (on average 1.5026455026455026) internal successors, (1988), 1324 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:07:51,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 06:07:51,083 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:07:51,084 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:07:51,085 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:07:51,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:07:51,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1003221877, now seen corresponding path program 1 times [2024-10-11 06:07:51,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:07:51,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468840445] [2024-10-11 06:07:51,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:07:51,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:07:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:07:51,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:07:51,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:07:51,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468840445] [2024-10-11 06:07:51,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468840445] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:07:51,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:07:51,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:07:51,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214884947] [2024-10-11 06:07:51,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:07:51,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:07:51,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:07:51,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:07:51,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:07:51,972 INFO L87 Difference]: Start difference. First operand has 1325 states, 1323 states have (on average 1.5026455026455026) internal successors, (1988), 1324 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:07:52,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:07:52,110 INFO L93 Difference]: Finished difference Result 2578 states and 3870 transitions. [2024-10-11 06:07:52,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:07:52,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-10-11 06:07:52,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:07:52,148 INFO L225 Difference]: With dead ends: 2578 [2024-10-11 06:07:52,148 INFO L226 Difference]: Without dead ends: 1326 [2024-10-11 06:07:52,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:07:52,166 INFO L432 NwaCegarLoop]: 1983 mSDtfsCounter, 0 mSDsluCounter, 3961 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5944 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:07:52,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5944 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:07:52,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2024-10-11 06:07:52,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1326. [2024-10-11 06:07:52,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1326 states, 1325 states have (on average 1.500377358490566) internal successors, (1988), 1325 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:07:52,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 1988 transitions. [2024-10-11 06:07:52,295 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 1988 transitions. Word has length 76 [2024-10-11 06:07:52,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:07:52,296 INFO L471 AbstractCegarLoop]: Abstraction has 1326 states and 1988 transitions. [2024-10-11 06:07:52,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:07:52,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 1988 transitions. [2024-10-11 06:07:52,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 06:07:52,301 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:07:52,301 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:07:52,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 06:07:52,302 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:07:52,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:07:52,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1036802736, now seen corresponding path program 1 times [2024-10-11 06:07:52,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:07:52,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028689854] [2024-10-11 06:07:52,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:07:52,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:07:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:07:52,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:07:52,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:07:52,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028689854] [2024-10-11 06:07:52,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028689854] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:07:52,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:07:52,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:07:52,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712815483] [2024-10-11 06:07:52,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:07:52,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:07:52,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:07:52,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:07:52,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:07:52,641 INFO L87 Difference]: Start difference. First operand 1326 states and 1988 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:07:52,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:07:52,730 INFO L93 Difference]: Finished difference Result 2581 states and 3870 transitions. [2024-10-11 06:07:52,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:07:52,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-11 06:07:52,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:07:52,739 INFO L225 Difference]: With dead ends: 2581 [2024-10-11 06:07:52,740 INFO L226 Difference]: Without dead ends: 1328 [2024-10-11 06:07:52,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:07:52,746 INFO L432 NwaCegarLoop]: 1983 mSDtfsCounter, 0 mSDsluCounter, 3958 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5941 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:07:52,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5941 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:07:52,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2024-10-11 06:07:52,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1328. [2024-10-11 06:07:52,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1327 states have (on average 1.4996232102486813) internal successors, (1990), 1327 states have internal predecessors, (1990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:07:52,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 1990 transitions. [2024-10-11 06:07:52,781 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 1990 transitions. Word has length 77 [2024-10-11 06:07:52,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:07:52,783 INFO L471 AbstractCegarLoop]: Abstraction has 1328 states and 1990 transitions. [2024-10-11 06:07:52,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:07:52,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 1990 transitions. [2024-10-11 06:07:52,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 06:07:52,789 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:07:52,789 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:07:52,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 06:07:52,790 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:07:52,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:07:52,790 INFO L85 PathProgramCache]: Analyzing trace with hash 978148270, now seen corresponding path program 1 times [2024-10-11 06:07:52,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:07:52,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131396277] [2024-10-11 06:07:52,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:07:52,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:07:52,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:07:53,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:07:53,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:07:53,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131396277] [2024-10-11 06:07:53,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131396277] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:07:53,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:07:53,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:07:53,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314934457] [2024-10-11 06:07:53,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:07:53,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:07:53,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:07:53,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:07:53,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:07:53,142 INFO L87 Difference]: Start difference. First operand 1328 states and 1990 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:07:53,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:07:53,215 INFO L93 Difference]: Finished difference Result 2589 states and 3880 transitions. [2024-10-11 06:07:53,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:07:53,216 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-10-11 06:07:53,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:07:53,221 INFO L225 Difference]: With dead ends: 2589 [2024-10-11 06:07:53,222 INFO L226 Difference]: Without dead ends: 1334 [2024-10-11 06:07:53,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:07:53,225 INFO L432 NwaCegarLoop]: 1983 mSDtfsCounter, 4 mSDsluCounter, 3952 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5935 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:07:53,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5935 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:07:53,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2024-10-11 06:07:53,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1334. [2024-10-11 06:07:53,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1334 states, 1333 states have (on average 1.4988747186796698) internal successors, (1998), 1333 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:07:53,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1334 states and 1998 transitions. [2024-10-11 06:07:53,253 INFO L78 Accepts]: Start accepts. Automaton has 1334 states and 1998 transitions. Word has length 78 [2024-10-11 06:07:53,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:07:53,253 INFO L471 AbstractCegarLoop]: Abstraction has 1334 states and 1998 transitions. [2024-10-11 06:07:53,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:07:53,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1998 transitions. [2024-10-11 06:07:53,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 06:07:53,255 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:07:53,255 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:07:53,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 06:07:53,256 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:07:53,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:07:53,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1311882686, now seen corresponding path program 1 times [2024-10-11 06:07:53,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:07:53,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157577280] [2024-10-11 06:07:53,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:07:53,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:07:53,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:07:53,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:07:53,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:07:53,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157577280] [2024-10-11 06:07:53,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157577280] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:07:53,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:07:53,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 06:07:53,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970839791] [2024-10-11 06:07:53,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:07:53,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 06:07:53,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:07:53,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 06:07:53,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:07:53,505 INFO L87 Difference]: Start difference. First operand 1334 states and 1998 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:07:53,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:07:53,687 INFO L93 Difference]: Finished difference Result 2599 states and 3892 transitions. [2024-10-11 06:07:53,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:07:53,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-10-11 06:07:53,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:07:53,698 INFO L225 Difference]: With dead ends: 2599 [2024-10-11 06:07:53,702 INFO L226 Difference]: Without dead ends: 1338 [2024-10-11 06:07:53,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:07:53,711 INFO L432 NwaCegarLoop]: 1983 mSDtfsCounter, 0 mSDsluCounter, 5918 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7901 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:07:53,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7901 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:07:53,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2024-10-11 06:07:53,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1334. [2024-10-11 06:07:53,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1334 states, 1333 states have (on average 1.4988747186796698) internal successors, (1998), 1333 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:07:53,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1334 states and 1998 transitions. [2024-10-11 06:07:53,790 INFO L78 Accepts]: Start accepts. Automaton has 1334 states and 1998 transitions. Word has length 79 [2024-10-11 06:07:53,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:07:53,791 INFO L471 AbstractCegarLoop]: Abstraction has 1334 states and 1998 transitions. [2024-10-11 06:07:53,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:07:53,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1998 transitions. [2024-10-11 06:07:53,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 06:07:53,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:07:53,793 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:07:53,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 06:07:53,797 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:07:53,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:07:53,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1372422425, now seen corresponding path program 1 times [2024-10-11 06:07:53,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:07:53,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557641694] [2024-10-11 06:07:53,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:07:53,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:07:53,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:07:54,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:07:54,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:07:54,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557641694] [2024-10-11 06:07:54,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557641694] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:07:54,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:07:54,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:07:54,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764953960] [2024-10-11 06:07:54,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:07:54,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 06:07:54,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:07:54,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 06:07:54,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:07:54,395 INFO L87 Difference]: Start difference. First operand 1334 states and 1998 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:07:56,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:07:56,979 INFO L93 Difference]: Finished difference Result 3840 states and 5752 transitions. [2024-10-11 06:07:56,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:07:56,979 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-10-11 06:07:56,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:07:56,988 INFO L225 Difference]: With dead ends: 3840 [2024-10-11 06:07:56,989 INFO L226 Difference]: Without dead ends: 2579 [2024-10-11 06:07:56,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:07:56,992 INFO L432 NwaCegarLoop]: 1494 mSDtfsCounter, 1901 mSDsluCounter, 4401 mSDsCounter, 0 mSdLazyCounter, 1940 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1901 SdHoareTripleChecker+Valid, 5895 SdHoareTripleChecker+Invalid, 1941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 06:07:56,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1901 Valid, 5895 Invalid, 1941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1940 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 06:07:56,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2579 states. [2024-10-11 06:07:57,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2579 to 1393. [2024-10-11 06:07:57,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1393 states, 1392 states have (on average 1.4978448275862069) internal successors, (2085), 1392 states have internal predecessors, (2085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:07:57,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1393 states and 2085 transitions. [2024-10-11 06:07:57,031 INFO L78 Accepts]: Start accepts. Automaton has 1393 states and 2085 transitions. Word has length 80 [2024-10-11 06:07:57,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:07:57,032 INFO L471 AbstractCegarLoop]: Abstraction has 1393 states and 2085 transitions. [2024-10-11 06:07:57,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:07:57,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 2085 transitions. [2024-10-11 06:07:57,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 06:07:57,033 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:07:57,033 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:07:57,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 06:07:57,034 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:07:57,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:07:57,034 INFO L85 PathProgramCache]: Analyzing trace with hash 638562426, now seen corresponding path program 1 times [2024-10-11 06:07:57,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:07:57,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517255649] [2024-10-11 06:07:57,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:07:57,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:07:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:07:57,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:07:57,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:07:57,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517255649] [2024-10-11 06:07:57,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517255649] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:07:57,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:07:57,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:07:57,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870617580] [2024-10-11 06:07:57,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:07:57,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 06:07:57,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:07:57,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 06:07:57,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:07:57,284 INFO L87 Difference]: Start difference. First operand 1393 states and 2085 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:07:58,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:07:58,389 INFO L93 Difference]: Finished difference Result 2654 states and 3974 transitions. [2024-10-11 06:07:58,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:07:58,389 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-10-11 06:07:58,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:07:58,395 INFO L225 Difference]: With dead ends: 2654 [2024-10-11 06:07:58,395 INFO L226 Difference]: Without dead ends: 1393 [2024-10-11 06:07:58,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:07:58,398 INFO L432 NwaCegarLoop]: 1484 mSDtfsCounter, 1914 mSDsluCounter, 2959 mSDsCounter, 0 mSdLazyCounter, 1500 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1914 SdHoareTripleChecker+Valid, 4443 SdHoareTripleChecker+Invalid, 1501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:07:58,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1914 Valid, 4443 Invalid, 1501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1500 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 06:07:58,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2024-10-11 06:07:58,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1393. [2024-10-11 06:07:58,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1393 states, 1392 states have (on average 1.4949712643678161) internal successors, (2081), 1392 states have internal predecessors, (2081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:07:58,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1393 states and 2081 transitions. [2024-10-11 06:07:58,429 INFO L78 Accepts]: Start accepts. Automaton has 1393 states and 2081 transitions. Word has length 81 [2024-10-11 06:07:58,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:07:58,429 INFO L471 AbstractCegarLoop]: Abstraction has 1393 states and 2081 transitions. [2024-10-11 06:07:58,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:07:58,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 2081 transitions. [2024-10-11 06:07:58,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 06:07:58,430 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:07:58,431 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:07:58,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 06:07:58,431 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:07:58,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:07:58,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1360054520, now seen corresponding path program 1 times [2024-10-11 06:07:58,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:07:58,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915608914] [2024-10-11 06:07:58,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:07:58,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:07:58,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 06:07:58,485 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 06:07:58,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 06:07:58,613 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 06:07:58,614 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 06:07:58,615 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 06:07:58,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 06:07:58,619 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:07:58,719 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 06:07:58,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:07:58 BoogieIcfgContainer [2024-10-11 06:07:58,721 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 06:07:58,722 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 06:07:58,722 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 06:07:58,722 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 06:07:58,723 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:07:50" (3/4) ... [2024-10-11 06:07:58,725 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 06:07:58,726 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 06:07:58,727 INFO L158 Benchmark]: Toolchain (without parser) took 14949.59ms. Allocated memory was 153.1MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 84.6MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 351.1MB. Max. memory is 16.1GB. [2024-10-11 06:07:58,727 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 102.8MB. Free memory is still 64.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 06:07:58,727 INFO L158 Benchmark]: CACSL2BoogieTranslator took 742.88ms. Allocated memory is still 153.1MB. Free memory was 84.4MB in the beginning and 73.8MB in the end (delta: 10.6MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2024-10-11 06:07:58,728 INFO L158 Benchmark]: Boogie Procedure Inliner took 893.55ms. Allocated memory was 153.1MB in the beginning and 323.0MB in the end (delta: 169.9MB). Free memory was 73.8MB in the beginning and 228.7MB in the end (delta: -154.9MB). Peak memory consumption was 96.7MB. Max. memory is 16.1GB. [2024-10-11 06:07:58,728 INFO L158 Benchmark]: Boogie Preprocessor took 815.50ms. Allocated memory is still 323.0MB. Free memory was 228.7MB in the beginning and 204.6MB in the end (delta: 24.1MB). Peak memory consumption was 36.5MB. Max. memory is 16.1GB. [2024-10-11 06:07:58,728 INFO L158 Benchmark]: RCFGBuilder took 4689.96ms. Allocated memory was 323.0MB in the beginning and 899.7MB in the end (delta: 576.7MB). Free memory was 204.6MB in the beginning and 748.4MB in the end (delta: -543.8MB). Peak memory consumption was 186.7MB. Max. memory is 16.1GB. [2024-10-11 06:07:58,729 INFO L158 Benchmark]: TraceAbstraction took 7793.42ms. Allocated memory was 899.7MB in the beginning and 1.8GB in the end (delta: 859.8MB). Free memory was 747.4MB in the beginning and 1.3GB in the end (delta: -594.3MB). Peak memory consumption was 265.6MB. Max. memory is 16.1GB. [2024-10-11 06:07:58,729 INFO L158 Benchmark]: Witness Printer took 3.57ms. Allocated memory is still 1.8GB. Free memory is still 1.3GB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 06:07:58,731 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 102.8MB. Free memory is still 64.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 742.88ms. Allocated memory is still 153.1MB. Free memory was 84.4MB in the beginning and 73.8MB in the end (delta: 10.6MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 893.55ms. Allocated memory was 153.1MB in the beginning and 323.0MB in the end (delta: 169.9MB). Free memory was 73.8MB in the beginning and 228.7MB in the end (delta: -154.9MB). Peak memory consumption was 96.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 815.50ms. Allocated memory is still 323.0MB. Free memory was 228.7MB in the beginning and 204.6MB in the end (delta: 24.1MB). Peak memory consumption was 36.5MB. Max. memory is 16.1GB. * RCFGBuilder took 4689.96ms. Allocated memory was 323.0MB in the beginning and 899.7MB in the end (delta: 576.7MB). Free memory was 204.6MB in the beginning and 748.4MB in the end (delta: -543.8MB). Peak memory consumption was 186.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7793.42ms. Allocated memory was 899.7MB in the beginning and 1.8GB in the end (delta: 859.8MB). Free memory was 747.4MB in the beginning and 1.3GB in the end (delta: -594.3MB). Peak memory consumption was 265.6MB. Max. memory is 16.1GB. * Witness Printer took 3.57ms. Allocated memory is still 1.8GB. Free memory is still 1.3GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 186. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_2 mask_SORT_2 = (SORT_2)-1 >> (sizeof(SORT_2) * 8 - 8); [L30] const SORT_2 msb_SORT_2 = (SORT_2)1 << (8 - 1); [L32] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 24); [L33] const SORT_3 msb_SORT_3 = (SORT_3)1 << (24 - 1); [L35] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 32); [L36] const SORT_4 msb_SORT_4 = (SORT_4)1 << (32 - 1); [L38] const SORT_2 var_5 = 0; [L39] const SORT_1 var_14 = 0; [L40] const SORT_4 var_43 = 1; [L41] const SORT_4 var_44 = 0; [L42] const SORT_2 var_54 = 0; [L43] const SORT_2 var_56 = 3; [L44] const SORT_2 var_59 = 2; [L45] const SORT_2 var_62 = 1; [L46] const SORT_2 var_70 = 255; [L47] const SORT_3 var_74 = 0; [L48] const SORT_4 var_78 = 255; [L50] SORT_1 input_53; [L51] SORT_1 input_55; [L52] SORT_1 input_57; [L53] SORT_1 input_58; [L54] SORT_1 input_60; [L55] SORT_1 input_61; [L56] SORT_1 input_71; [L57] SORT_1 input_72; [L58] SORT_1 input_73; [L59] SORT_1 input_90; [L60] SORT_1 input_91; [L61] SORT_1 input_106; [L62] SORT_1 input_107; [L63] SORT_1 input_124; [L64] SORT_1 input_132; [L65] SORT_1 input_140; [L66] SORT_1 input_148; [L67] SORT_1 input_156; [L68] SORT_1 input_164; [L70] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L70] SORT_2 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L71] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L71] SORT_2 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L72] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L72] SORT_2 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L73] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L73] SORT_2 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L74] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L74] SORT_1 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L75] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L75] SORT_1 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L76] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L76] SORT_1 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L77] SORT_1 state_21 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L78] SORT_1 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L79] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L80] SORT_1 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L81] SORT_1 state_29 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L82] SORT_1 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L83] SORT_1 state_33 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L84] SORT_1 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L85] SORT_1 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L86] SORT_1 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L87] SORT_1 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L89] SORT_2 init_7_arg_1 = var_5; [L90] state_6 = init_7_arg_1 [L91] SORT_2 init_9_arg_1 = var_5; [L92] state_8 = init_9_arg_1 [L93] SORT_2 init_11_arg_1 = var_5; [L94] state_10 = init_11_arg_1 [L95] SORT_2 init_13_arg_1 = var_5; [L96] state_12 = init_13_arg_1 [L97] SORT_1 init_16_arg_1 = var_14; [L98] state_15 = init_16_arg_1 [L99] SORT_1 init_18_arg_1 = var_14; [L100] state_17 = init_18_arg_1 [L101] SORT_1 init_20_arg_1 = var_14; [L102] state_19 = init_20_arg_1 [L103] SORT_1 init_22_arg_1 = var_14; [L104] state_21 = init_22_arg_1 [L105] SORT_1 init_24_arg_1 = var_14; [L106] state_23 = init_24_arg_1 [L107] SORT_1 init_26_arg_1 = var_14; [L108] state_25 = init_26_arg_1 [L109] SORT_1 init_28_arg_1 = var_14; [L110] state_27 = init_28_arg_1 [L111] SORT_1 init_30_arg_1 = var_14; [L112] state_29 = init_30_arg_1 [L113] SORT_1 init_32_arg_1 = var_14; [L114] state_31 = init_32_arg_1 [L115] SORT_1 init_34_arg_1 = var_14; [L116] state_33 = init_34_arg_1 [L117] SORT_1 init_36_arg_1 = var_14; [L118] state_35 = init_36_arg_1 [L119] SORT_1 init_38_arg_1 = var_14; [L120] state_37 = init_38_arg_1 [L121] SORT_1 init_40_arg_1 = var_14; [L122] state_39 = init_40_arg_1 [L123] SORT_1 init_42_arg_1 = var_14; [L124] state_41 = init_42_arg_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L127] input_53 = __VERIFIER_nondet_uchar() [L128] EXPR input_53 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L128] input_53 = input_53 & mask_SORT_1 [L129] input_55 = __VERIFIER_nondet_uchar() [L130] EXPR input_55 & mask_SORT_1 VAL [input_53=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L130] input_55 = input_55 & mask_SORT_1 [L131] input_57 = __VERIFIER_nondet_uchar() [L132] EXPR input_57 & mask_SORT_1 VAL [input_53=0, input_55=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L132] input_57 = input_57 & mask_SORT_1 [L133] input_58 = __VERIFIER_nondet_uchar() [L134] EXPR input_58 & mask_SORT_1 VAL [input_53=0, input_55=0, input_57=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L134] input_58 = input_58 & mask_SORT_1 [L135] input_60 = __VERIFIER_nondet_uchar() [L136] EXPR input_60 & mask_SORT_1 VAL [input_53=0, input_55=0, input_57=0, input_58=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L136] input_60 = input_60 & mask_SORT_1 [L137] input_61 = __VERIFIER_nondet_uchar() [L138] EXPR input_61 & mask_SORT_1 VAL [input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L138] input_61 = input_61 & mask_SORT_1 [L139] input_71 = __VERIFIER_nondet_uchar() [L140] EXPR input_71 & mask_SORT_1 VAL [input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L140] input_71 = input_71 & mask_SORT_1 [L141] input_72 = __VERIFIER_nondet_uchar() [L142] EXPR input_72 & mask_SORT_1 VAL [input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L142] input_72 = input_72 & mask_SORT_1 [L143] input_73 = __VERIFIER_nondet_uchar() [L144] EXPR input_73 & mask_SORT_1 VAL [input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L144] input_73 = input_73 & mask_SORT_1 [L145] input_90 = __VERIFIER_nondet_uchar() [L146] EXPR input_90 & mask_SORT_1 VAL [input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, input_73=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L146] input_90 = input_90 & mask_SORT_1 [L147] input_91 = __VERIFIER_nondet_uchar() [L148] EXPR input_91 & mask_SORT_1 VAL [input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, input_73=0, input_90=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L148] input_91 = input_91 & mask_SORT_1 [L149] input_106 = __VERIFIER_nondet_uchar() [L150] EXPR input_106 & mask_SORT_1 VAL [input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, input_73=0, input_90=0, input_91=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L150] input_106 = input_106 & mask_SORT_1 [L151] input_107 = __VERIFIER_nondet_uchar() [L152] EXPR input_107 & mask_SORT_1 VAL [input_106=0, input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, input_73=0, input_90=0, input_91=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L152] input_107 = input_107 & mask_SORT_1 [L153] input_124 = __VERIFIER_nondet_uchar() [L154] input_132 = __VERIFIER_nondet_uchar() [L155] input_140 = __VERIFIER_nondet_uchar() [L156] input_148 = __VERIFIER_nondet_uchar() [L157] input_156 = __VERIFIER_nondet_uchar() [L158] input_164 = __VERIFIER_nondet_uchar() [L161] SORT_1 var_45_arg_0 = state_23; [L162] SORT_4 var_45_arg_1 = var_43; [L163] SORT_4 var_45_arg_2 = var_44; [L164] SORT_4 var_45 = var_45_arg_0 ? var_45_arg_1 : var_45_arg_2; [L165] SORT_1 var_46_arg_0 = state_31; [L166] SORT_4 var_46_arg_1 = var_43; [L167] SORT_4 var_46_arg_2 = var_44; [L168] SORT_4 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; [L169] SORT_4 var_47_arg_0 = var_45; [L170] SORT_4 var_47_arg_1 = var_46; [L171] SORT_4 var_47 = var_47_arg_0 + var_47_arg_1; [L172] SORT_1 var_48_arg_0 = state_39; [L173] SORT_4 var_48_arg_1 = var_43; [L174] SORT_4 var_48_arg_2 = var_44; [L175] SORT_4 var_48 = var_48_arg_0 ? var_48_arg_1 : var_48_arg_2; [L176] SORT_4 var_49_arg_0 = var_47; [L177] SORT_4 var_49_arg_1 = var_48; [L178] SORT_4 var_49 = var_49_arg_0 + var_49_arg_1; VAL [input_106=0, input_107=0, input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, input_73=0, input_90=0, input_91=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_49=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L179] EXPR var_49 & mask_SORT_4 VAL [input_106=0, input_107=0, input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, input_73=0, input_90=0, input_91=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L179] var_49 = var_49 & mask_SORT_4 [L180] SORT_4 var_50_arg_0 = var_49; [L181] SORT_4 var_50_arg_1 = var_43; [L182] SORT_1 var_50 = var_50_arg_0 <= var_50_arg_1; [L183] SORT_1 var_51_arg_0 = ~state_41; VAL [input_106=0, input_107=0, input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, input_73=0, input_90=0, input_91=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_50=1, var_51_arg_0=-1, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L184] EXPR var_51_arg_0 & mask_SORT_1 VAL [input_106=0, input_107=0, input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, input_73=0, input_90=0, input_91=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_50=1, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L184] var_51_arg_0 = var_51_arg_0 & mask_SORT_1 [L185] SORT_1 var_51_arg_1 = ~var_50; VAL [input_106=0, input_107=0, input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, input_73=0, input_90=0, input_91=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_51_arg_0=1, var_51_arg_1=-2, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L186] EXPR var_51_arg_1 & mask_SORT_1 VAL [input_106=0, input_107=0, input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, input_73=0, input_90=0, input_91=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_51_arg_0=1, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L186] var_51_arg_1 = var_51_arg_1 & mask_SORT_1 [L187] EXPR var_51_arg_0 & var_51_arg_1 VAL [input_106=0, input_107=0, input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, input_73=0, input_90=0, input_91=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L187] SORT_1 var_51 = var_51_arg_0 & var_51_arg_1; [L188] EXPR var_51 & mask_SORT_1 VAL [input_106=0, input_107=0, input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, input_73=0, input_90=0, input_91=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L188] var_51 = var_51 & mask_SORT_1 [L189] SORT_1 bad_52_arg_0 = var_51; [L190] CALL __VERIFIER_assert(!(bad_52_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1325 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.6s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3819 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3819 mSDsluCounter, 36059 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25149 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3533 IncrementalHoareTripleChecker+Invalid, 3536 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 10910 mSDtfsCounter, 3533 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1393occurred in iteration=5, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 1190 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 553 NumberOfCodeBlocks, 553 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 465 ConstructedInterpolants, 0 QuantifiedInterpolants, 1102 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 06:07:58,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.fischer.1.prop1-func-interl.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 82abe2bc16b32af306db7c09a41c9db0587ba64425916c43bed05447e1d05407 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 06:08:02,099 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 06:08:02,262 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-11 06:08:02,275 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 06:08:02,275 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 06:08:02,314 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 06:08:02,315 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 06:08:02,315 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 06:08:02,316 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 06:08:02,318 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 06:08:02,319 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 06:08:02,319 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 06:08:02,320 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 06:08:02,320 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 06:08:02,320 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 06:08:02,321 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 06:08:02,321 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 06:08:02,321 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 06:08:02,321 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 06:08:02,322 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 06:08:02,322 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 06:08:02,324 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 06:08:02,325 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 06:08:02,325 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 06:08:02,325 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 06:08:02,326 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 06:08:02,326 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 06:08:02,326 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 06:08:02,326 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 06:08:02,327 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 06:08:02,330 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 06:08:02,331 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:08:02,331 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 06:08:02,331 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 06:08:02,331 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 06:08:02,331 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 06:08:02,332 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 06:08:02,332 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 06:08:02,332 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 06:08:02,332 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 06:08:02,332 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 06:08:02,336 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 06:08:02,336 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 82abe2bc16b32af306db7c09a41c9db0587ba64425916c43bed05447e1d05407 [2024-10-11 06:08:02,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 06:08:02,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 06:08:02,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 06:08:02,779 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 06:08:02,779 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 06:08:02,781 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.fischer.1.prop1-func-interl.c [2024-10-11 06:08:04,592 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 06:08:04,958 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 06:08:04,959 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.fischer.1.prop1-func-interl.c [2024-10-11 06:08:04,988 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/360435570/eb9772539ae9456680a9b60f5325f418/FLAG9d8c55c72 [2024-10-11 06:08:05,198 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/360435570/eb9772539ae9456680a9b60f5325f418 [2024-10-11 06:08:05,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 06:08:05,204 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 06:08:05,206 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 06:08:05,207 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 06:08:05,212 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 06:08:05,213 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:08:05" (1/1) ... [2024-10-11 06:08:05,214 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34bb22bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:08:05, skipping insertion in model container [2024-10-11 06:08:05,214 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:08:05" (1/1) ... [2024-10-11 06:08:05,270 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 06:08:05,515 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.fischer.1.prop1-func-interl.c[1174,1187] [2024-10-11 06:08:05,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:08:05,867 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 06:08:05,883 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.fischer.1.prop1-func-interl.c[1174,1187] [2024-10-11 06:08:05,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:08:06,005 INFO L204 MainTranslator]: Completed translation [2024-10-11 06:08:06,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:08:06 WrapperNode [2024-10-11 06:08:06,006 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 06:08:06,007 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 06:08:06,007 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 06:08:06,007 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 06:08:06,014 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:08:06" (1/1) ... [2024-10-11 06:08:06,047 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:08:06" (1/1) ... [2024-10-11 06:08:06,169 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1149 [2024-10-11 06:08:06,170 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 06:08:06,170 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 06:08:06,171 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 06:08:06,171 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 06:08:06,183 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:08:06" (1/1) ... [2024-10-11 06:08:06,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:08:06" (1/1) ... [2024-10-11 06:08:06,196 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:08:06" (1/1) ... [2024-10-11 06:08:06,228 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 06:08:06,229 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:08:06" (1/1) ... [2024-10-11 06:08:06,229 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:08:06" (1/1) ... [2024-10-11 06:08:06,257 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:08:06" (1/1) ... [2024-10-11 06:08:06,262 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:08:06" (1/1) ... [2024-10-11 06:08:06,268 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:08:06" (1/1) ... [2024-10-11 06:08:06,276 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:08:06" (1/1) ... [2024-10-11 06:08:06,288 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 06:08:06,289 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 06:08:06,289 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 06:08:06,289 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 06:08:06,290 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:08:06" (1/1) ... [2024-10-11 06:08:06,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:08:06,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:08:06,352 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 06:08:06,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 06:08:06,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 06:08:06,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 06:08:06,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 06:08:06,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 06:08:06,702 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 06:08:06,704 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 06:08:07,816 INFO L? ?]: Removed 74 outVars from TransFormulas that were not future-live. [2024-10-11 06:08:07,817 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 06:08:07,891 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 06:08:07,892 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 06:08:07,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:08:07 BoogieIcfgContainer [2024-10-11 06:08:07,892 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 06:08:07,894 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 06:08:07,895 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 06:08:07,900 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 06:08:07,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:08:05" (1/3) ... [2024-10-11 06:08:07,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ef9f3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:08:07, skipping insertion in model container [2024-10-11 06:08:07,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:08:06" (2/3) ... [2024-10-11 06:08:07,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ef9f3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:08:07, skipping insertion in model container [2024-10-11 06:08:07,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:08:07" (3/3) ... [2024-10-11 06:08:07,904 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.fischer.1.prop1-func-interl.c [2024-10-11 06:08:07,923 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 06:08:07,923 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 06:08:07,981 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 06:08:07,988 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3cd488b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 06:08:07,988 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 06:08:07,992 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:08:07,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 06:08:08,000 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:08:08,003 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 06:08:08,004 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:08:08,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:08:08,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-11 06:08:08,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 06:08:08,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2089274447] [2024-10-11 06:08:08,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:08:08,028 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 06:08:08,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 06:08:08,037 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 06:08:08,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 06:08:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:08:08,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-11 06:08:08,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 06:08:08,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:08:08,771 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 06:08:08,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 06:08:08,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2089274447] [2024-10-11 06:08:08,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2089274447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:08:08,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:08:08,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 06:08:08,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183904479] [2024-10-11 06:08:08,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:08:08,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:08:08,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 06:08:08,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:08:08,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:08:08,826 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:08:08,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:08:08,994 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-11 06:08:08,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:08:08,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 06:08:08,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:08:09,004 INFO L225 Difference]: With dead ends: 15 [2024-10-11 06:08:09,005 INFO L226 Difference]: Without dead ends: 9 [2024-10-11 06:08:09,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:08:09,012 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:08:09,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:08:09,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-11 06:08:09,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-11 06:08:09,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:08:09,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-11 06:08:09,069 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-11 06:08:09,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:08:09,069 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-11 06:08:09,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:08:09,070 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-11 06:08:09,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 06:08:09,071 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:08:09,071 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-11 06:08:09,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 06:08:09,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 06:08:09,276 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:08:09,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:08:09,277 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-11 06:08:09,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 06:08:09,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [317095960] [2024-10-11 06:08:09,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:08:09,279 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 06:08:09,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 06:08:09,292 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 06:08:09,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 06:08:09,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:08:09,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-11 06:08:09,754 INFO L278 TraceCheckSpWp]: Computing forward predicates...