./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.cal2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 e845250638bf2269b9610642a85a2d027126b83f570f70da1feb220fdec8c1ec --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 05:50:00,502 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 05:50:00,576 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-14 05:50:00,583 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 05:50:00,584 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 05:50:00,606 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 05:50:00,608 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 05:50:00,609 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 05:50:00,609 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 05:50:00,610 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 05:50:00,610 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 05:50:00,611 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 05:50:00,611 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 05:50:00,612 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 05:50:00,613 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 05:50:00,613 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 05:50:00,614 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 05:50:00,614 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 05:50:00,614 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 05:50:00,614 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 05:50:00,614 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 05:50:00,616 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 05:50:00,616 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 05:50:00,616 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 05:50:00,617 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 05:50:00,617 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 05:50:00,617 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 05:50:00,617 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 05:50:00,618 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 05:50:00,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:50:00,618 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 05:50:00,618 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 05:50:00,619 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 05:50:00,619 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 05:50:00,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 05:50:00,619 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 05:50:00,620 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 05:50:00,620 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 05:50:00,620 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 05:50:00,620 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/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/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 -> e845250638bf2269b9610642a85a2d027126b83f570f70da1feb220fdec8c1ec [2024-10-14 05:50:00,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 05:50:00,835 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 05:50:00,837 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 05:50:00,838 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 05:50:00,838 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 05:50:00,839 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal2.c [2024-10-14 05:50:02,136 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 05:50:02,351 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 05:50:02,352 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal2.c [2024-10-14 05:50:02,366 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d42b46819/2c625e8b9dec4187a95834a5746a0f7a/FLAG5b14cb5e1 [2024-10-14 05:50:02,378 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d42b46819/2c625e8b9dec4187a95834a5746a0f7a [2024-10-14 05:50:02,380 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 05:50:02,381 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 05:50:02,382 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 05:50:02,382 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 05:50:02,388 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 05:50:02,389 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:50:02" (1/1) ... [2024-10-14 05:50:02,390 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e0c442 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:50:02, skipping insertion in model container [2024-10-14 05:50:02,390 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:50:02" (1/1) ... [2024-10-14 05:50:02,433 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 05:50:02,593 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.cal2.c[1244,1257] [2024-10-14 05:50:02,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:50:02,850 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 05:50:02,860 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.cal2.c[1244,1257] [2024-10-14 05:50:02,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:50:02,962 INFO L204 MainTranslator]: Completed translation [2024-10-14 05:50:02,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:50:02 WrapperNode [2024-10-14 05:50:02,963 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 05:50:02,964 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 05:50:02,964 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 05:50:02,964 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 05:50:02,971 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:50:02" (1/1) ... [2024-10-14 05:50:03,009 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:50:02" (1/1) ... [2024-10-14 05:50:03,171 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2328 [2024-10-14 05:50:03,172 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 05:50:03,172 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 05:50:03,173 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 05:50:03,173 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 05:50:03,185 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:50:02" (1/1) ... [2024-10-14 05:50:03,185 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:50:02" (1/1) ... [2024-10-14 05:50:03,221 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:50:02" (1/1) ... [2024-10-14 05:50:03,336 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2024-10-14 05:50:03,337 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:50:02" (1/1) ... [2024-10-14 05:50:03,337 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:50:02" (1/1) ... [2024-10-14 05:50:03,374 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:50:02" (1/1) ... [2024-10-14 05:50:03,394 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:50:02" (1/1) ... [2024-10-14 05:50:03,415 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:50:02" (1/1) ... [2024-10-14 05:50:03,431 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:50:02" (1/1) ... [2024-10-14 05:50:03,528 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 05:50:03,529 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 05:50:03,529 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 05:50:03,529 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 05:50:03,530 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:50:02" (1/1) ... [2024-10-14 05:50:03,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:50:03,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:50:03,560 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 05:50:03,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 05:50:03,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 05:50:03,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 05:50:03,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 05:50:03,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 05:50:03,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 05:50:03,857 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 05:50:03,859 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 05:50:05,482 INFO L? ?]: Removed 1306 outVars from TransFormulas that were not future-live. [2024-10-14 05:50:05,483 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 05:50:05,544 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 05:50:05,545 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 05:50:05,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:50:05 BoogieIcfgContainer [2024-10-14 05:50:05,545 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 05:50:05,550 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 05:50:05,551 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 05:50:05,554 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 05:50:05,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:50:02" (1/3) ... [2024-10-14 05:50:05,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48527526 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:50:05, skipping insertion in model container [2024-10-14 05:50:05,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:50:02" (2/3) ... [2024-10-14 05:50:05,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48527526 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:50:05, skipping insertion in model container [2024-10-14 05:50:05,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:50:05" (3/3) ... [2024-10-14 05:50:05,557 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal2.c [2024-10-14 05:50:05,574 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 05:50:05,574 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 05:50:05,657 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 05:50:05,663 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;@11e0ed4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 05:50:05,663 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 05:50:05,668 INFO L276 IsEmpty]: Start isEmpty. Operand has 507 states, 505 states have (on average 1.5128712871287129) internal successors, (764), 506 states have internal predecessors, (764), 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-14 05:50:05,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-14 05:50:05,680 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:50:05,680 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-14 05:50:05,681 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:50:05,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:50:05,686 INFO L85 PathProgramCache]: Analyzing trace with hash -583303165, now seen corresponding path program 1 times [2024-10-14 05:50:05,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:50:05,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586387469] [2024-10-14 05:50:05,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:50:05,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:50:05,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:50:06,355 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-14 05:50:06,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:50:06,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586387469] [2024-10-14 05:50:06,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586387469] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:50:06,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:50:06,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:50:06,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692436987] [2024-10-14 05:50:06,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:50:06,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:50:06,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:50:06,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:50:06,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:50:06,392 INFO L87 Difference]: Start difference. First operand has 507 states, 505 states have (on average 1.5128712871287129) internal successors, (764), 506 states have internal predecessors, (764), 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.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-14 05:50:06,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:50:06,478 INFO L93 Difference]: Finished difference Result 894 states and 1350 transitions. [2024-10-14 05:50:06,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 05:50:06,481 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-14 05:50:06,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:50:06,496 INFO L225 Difference]: With dead ends: 894 [2024-10-14 05:50:06,496 INFO L226 Difference]: Without dead ends: 508 [2024-10-14 05:50:06,502 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-14 05:50:06,507 INFO L432 NwaCegarLoop]: 759 mSDtfsCounter, 0 mSDsluCounter, 1513 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2272 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-14 05:50:06,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2272 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:50:06,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2024-10-14 05:50:06,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2024-10-14 05:50:06,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 507 states have (on average 1.5069033530571991) internal successors, (764), 507 states have internal predecessors, (764), 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-14 05:50:06,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 764 transitions. [2024-10-14 05:50:06,574 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 764 transitions. Word has length 78 [2024-10-14 05:50:06,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:50:06,576 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 764 transitions. [2024-10-14 05:50:06,576 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-14 05:50:06,576 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 764 transitions. [2024-10-14 05:50:06,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 05:50:06,579 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:50:06,579 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-14 05:50:06,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 05:50:06,580 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:50:06,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:50:06,580 INFO L85 PathProgramCache]: Analyzing trace with hash -900833297, now seen corresponding path program 1 times [2024-10-14 05:50:06,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:50:06,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952622283] [2024-10-14 05:50:06,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:50:06,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:50:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:50:06,815 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-14 05:50:06,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:50:06,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952622283] [2024-10-14 05:50:06,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952622283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:50:06,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:50:06,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:50:06,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856440189] [2024-10-14 05:50:06,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:50:06,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:50:06,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:50:06,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:50:06,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:50:06,821 INFO L87 Difference]: Start difference. First operand 508 states and 764 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 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-14 05:50:06,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:50:06,879 INFO L93 Difference]: Finished difference Result 897 states and 1350 transitions. [2024-10-14 05:50:06,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 05:50:06,880 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 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-14 05:50:06,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:50:06,883 INFO L225 Difference]: With dead ends: 897 [2024-10-14 05:50:06,884 INFO L226 Difference]: Without dead ends: 510 [2024-10-14 05:50:06,885 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-14 05:50:06,886 INFO L432 NwaCegarLoop]: 759 mSDtfsCounter, 0 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2269 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-14 05:50:06,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2269 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:50:06,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2024-10-14 05:50:06,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2024-10-14 05:50:06,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 509 states have (on average 1.5049115913555993) internal successors, (766), 509 states have internal predecessors, (766), 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-14 05:50:06,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 766 transitions. [2024-10-14 05:50:06,903 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 766 transitions. Word has length 79 [2024-10-14 05:50:06,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:50:06,904 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 766 transitions. [2024-10-14 05:50:06,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 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-14 05:50:06,904 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 766 transitions. [2024-10-14 05:50:06,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 05:50:06,906 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:50:06,906 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-14 05:50:06,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 05:50:06,907 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:50:06,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:50:06,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1040973404, now seen corresponding path program 1 times [2024-10-14 05:50:06,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:50:06,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906130448] [2024-10-14 05:50:06,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:50:06,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:50:06,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:50:07,392 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-14 05:50:07,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:50:07,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906130448] [2024-10-14 05:50:07,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906130448] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:50:07,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:50:07,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 05:50:07,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053318015] [2024-10-14 05:50:07,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:50:07,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:50:07,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:50:07,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:50:07,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:50:07,397 INFO L87 Difference]: Start difference. First operand 510 states and 766 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 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-14 05:50:07,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:50:07,528 INFO L93 Difference]: Finished difference Result 936 states and 1402 transitions. [2024-10-14 05:50:07,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 05:50:07,529 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 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-14 05:50:07,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:50:07,530 INFO L225 Difference]: With dead ends: 936 [2024-10-14 05:50:07,531 INFO L226 Difference]: Without dead ends: 547 [2024-10-14 05:50:07,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:50:07,533 INFO L432 NwaCegarLoop]: 747 mSDtfsCounter, 799 mSDsluCounter, 2245 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 2992 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:50:07,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 2992 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:50:07,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2024-10-14 05:50:07,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 528. [2024-10-14 05:50:07,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 1.5028462998102468) internal successors, (792), 527 states have internal predecessors, (792), 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-14 05:50:07,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 792 transitions. [2024-10-14 05:50:07,552 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 792 transitions. Word has length 80 [2024-10-14 05:50:07,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:50:07,552 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 792 transitions. [2024-10-14 05:50:07,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 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-14 05:50:07,552 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 792 transitions. [2024-10-14 05:50:07,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-14 05:50:07,554 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:50:07,554 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-14 05:50:07,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 05:50:07,555 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:50:07,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:50:07,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1180675562, now seen corresponding path program 1 times [2024-10-14 05:50:07,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:50:07,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707451704] [2024-10-14 05:50:07,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:50:07,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:50:07,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:50:07,932 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-14 05:50:07,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:50:07,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707451704] [2024-10-14 05:50:07,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707451704] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:50:07,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:50:07,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:50:07,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6728679] [2024-10-14 05:50:07,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:50:07,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 05:50:07,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:50:07,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 05:50:07,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:50:07,934 INFO L87 Difference]: Start difference. First operand 528 states and 792 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 7 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-14 05:50:08,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:50:08,080 INFO L93 Difference]: Finished difference Result 938 states and 1404 transitions. [2024-10-14 05:50:08,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 05:50:08,081 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 7 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-14 05:50:08,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:50:08,083 INFO L225 Difference]: With dead ends: 938 [2024-10-14 05:50:08,083 INFO L226 Difference]: Without dead ends: 549 [2024-10-14 05:50:08,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-10-14 05:50:08,084 INFO L432 NwaCegarLoop]: 746 mSDtfsCounter, 802 mSDsluCounter, 3730 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 4476 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:50:08,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 4476 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:50:08,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2024-10-14 05:50:08,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 531. [2024-10-14 05:50:08,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 530 states have (on average 1.5018867924528303) internal successors, (796), 530 states have internal predecessors, (796), 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-14 05:50:08,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 796 transitions. [2024-10-14 05:50:08,092 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 796 transitions. Word has length 81 [2024-10-14 05:50:08,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:50:08,093 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 796 transitions. [2024-10-14 05:50:08,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 7 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-14 05:50:08,093 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 796 transitions. [2024-10-14 05:50:08,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-14 05:50:08,094 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:50:08,094 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-14 05:50:08,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 05:50:08,095 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:50:08,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:50:08,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1921857287, now seen corresponding path program 1 times [2024-10-14 05:50:08,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:50:08,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549919486] [2024-10-14 05:50:08,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:50:08,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:50:08,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:50:08,752 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-14 05:50:08,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:50:08,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549919486] [2024-10-14 05:50:08,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549919486] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:50:08,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:50:08,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 05:50:08,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574664994] [2024-10-14 05:50:08,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:50:08,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 05:50:08,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:50:08,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 05:50:08,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-14 05:50:08,755 INFO L87 Difference]: Start difference. First operand 531 states and 796 transitions. Second operand has 10 states, 10 states have (on average 8.2) internal successors, (82), 9 states have internal predecessors, (82), 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-14 05:50:09,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:50:09,030 INFO L93 Difference]: Finished difference Result 938 states and 1403 transitions. [2024-10-14 05:50:09,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 05:50:09,031 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 9 states have internal predecessors, (82), 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 82 [2024-10-14 05:50:09,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:50:09,032 INFO L225 Difference]: With dead ends: 938 [2024-10-14 05:50:09,032 INFO L226 Difference]: Without dead ends: 549 [2024-10-14 05:50:09,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:50:09,033 INFO L432 NwaCegarLoop]: 742 mSDtfsCounter, 797 mSDsluCounter, 4457 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 5199 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:50:09,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 5199 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:50:09,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2024-10-14 05:50:09,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 535. [2024-10-14 05:50:09,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 534 states have (on average 1.5) internal successors, (801), 534 states have internal predecessors, (801), 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-14 05:50:09,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 801 transitions. [2024-10-14 05:50:09,044 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 801 transitions. Word has length 82 [2024-10-14 05:50:09,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:50:09,045 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 801 transitions. [2024-10-14 05:50:09,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 9 states have internal predecessors, (82), 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-14 05:50:09,045 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 801 transitions. [2024-10-14 05:50:09,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-14 05:50:09,047 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:50:09,047 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, 1] [2024-10-14 05:50:09,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 05:50:09,048 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:50:09,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:50:09,050 INFO L85 PathProgramCache]: Analyzing trace with hash 2116511829, now seen corresponding path program 1 times [2024-10-14 05:50:09,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:50:09,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026963289] [2024-10-14 05:50:09,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:50:09,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:50:09,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 05:50:09,097 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 05:50:09,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 05:50:09,192 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 05:50:09,192 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 05:50:09,193 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 05:50:09,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 05:50:09,198 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-14 05:50:09,283 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 05:50:09,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 05:50:09 BoogieIcfgContainer [2024-10-14 05:50:09,288 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 05:50:09,289 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 05:50:09,289 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 05:50:09,289 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 05:50:09,289 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:50:05" (3/4) ... [2024-10-14 05:50:09,291 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 05:50:09,292 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 05:50:09,293 INFO L158 Benchmark]: Toolchain (without parser) took 6911.36ms. Allocated memory was 138.4MB in the beginning and 411.0MB in the end (delta: 272.6MB). Free memory was 64.7MB in the beginning and 268.2MB in the end (delta: -203.5MB). Peak memory consumption was 71.1MB. Max. memory is 16.1GB. [2024-10-14 05:50:09,293 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 138.4MB. Free memory is still 99.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 05:50:09,293 INFO L158 Benchmark]: CACSL2BoogieTranslator took 580.87ms. Allocated memory was 138.4MB in the beginning and 190.8MB in the end (delta: 52.4MB). Free memory was 64.4MB in the beginning and 130.6MB in the end (delta: -66.2MB). Peak memory consumption was 33.7MB. Max. memory is 16.1GB. [2024-10-14 05:50:09,295 INFO L158 Benchmark]: Boogie Procedure Inliner took 208.17ms. Allocated memory is still 190.8MB. Free memory was 130.6MB in the beginning and 88.7MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-10-14 05:50:09,295 INFO L158 Benchmark]: Boogie Preprocessor took 355.71ms. Allocated memory is still 190.8MB. Free memory was 88.7MB in the beginning and 122.7MB in the end (delta: -34.0MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. [2024-10-14 05:50:09,296 INFO L158 Benchmark]: RCFGBuilder took 2016.11ms. Allocated memory was 190.8MB in the beginning and 337.6MB in the end (delta: 146.8MB). Free memory was 122.7MB in the beginning and 146.6MB in the end (delta: -24.0MB). Peak memory consumption was 127.4MB. Max. memory is 16.1GB. [2024-10-14 05:50:09,296 INFO L158 Benchmark]: TraceAbstraction took 3737.83ms. Allocated memory was 337.6MB in the beginning and 411.0MB in the end (delta: 73.4MB). Free memory was 145.6MB in the beginning and 269.3MB in the end (delta: -123.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 05:50:09,296 INFO L158 Benchmark]: Witness Printer took 3.71ms. Allocated memory is still 411.0MB. Free memory was 269.3MB in the beginning and 268.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 05:50:09,297 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.16ms. Allocated memory is still 138.4MB. Free memory is still 99.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 580.87ms. Allocated memory was 138.4MB in the beginning and 190.8MB in the end (delta: 52.4MB). Free memory was 64.4MB in the beginning and 130.6MB in the end (delta: -66.2MB). Peak memory consumption was 33.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 208.17ms. Allocated memory is still 190.8MB. Free memory was 130.6MB in the beginning and 88.7MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 355.71ms. Allocated memory is still 190.8MB. Free memory was 88.7MB in the beginning and 122.7MB in the end (delta: -34.0MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. * RCFGBuilder took 2016.11ms. Allocated memory was 190.8MB in the beginning and 337.6MB in the end (delta: 146.8MB). Free memory was 122.7MB in the beginning and 146.6MB in the end (delta: -24.0MB). Peak memory consumption was 127.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3737.83ms. Allocated memory was 337.6MB in the beginning and 411.0MB in the end (delta: 73.4MB). Free memory was 145.6MB in the beginning and 269.3MB in the end (delta: -123.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.71ms. Allocated memory is still 411.0MB. Free memory was 269.3MB in the beginning and 268.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 bitwiseOr at line 270, overapproximation of bitwiseAnd at line 275. 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_6 mask_SORT_6 = (SORT_6)-1 >> (sizeof(SORT_6) * 8 - 32); [L30] const SORT_6 msb_SORT_6 = (SORT_6)1 << (32 - 1); [L32] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 4); [L33] const SORT_10 msb_SORT_10 = (SORT_10)1 << (4 - 1); [L35] const SORT_14 mask_SORT_14 = (SORT_14)-1 >> (sizeof(SORT_14) * 8 - 64); [L36] const SORT_14 msb_SORT_14 = (SORT_14)1 << (64 - 1); [L38] const SORT_121 mask_SORT_121 = (SORT_121)-1 >> (sizeof(SORT_121) * 8 - 2); [L39] const SORT_121 msb_SORT_121 = (SORT_121)1 << (2 - 1); [L41] const SORT_1 var_56 = 0; [L42] const SORT_6 var_60 = 0; [L43] const SORT_1 var_73 = 1; [L44] const SORT_14 var_77 = 0; [L45] const SORT_10 var_107 = 0; [L46] const SORT_10 var_116 = 2; [L47] const SORT_10 var_119 = 4; [L48] const SORT_10 var_126 = 1; [L49] const SORT_121 var_133 = 1; [L50] const SORT_121 var_136 = 3; [L51] const SORT_121 var_139 = 2; [L53] SORT_1 input_2; [L54] SORT_1 input_3; [L55] SORT_1 input_4; [L56] SORT_1 input_5; [L57] SORT_6 input_7; [L58] SORT_6 input_8; [L59] SORT_1 input_9; [L60] SORT_10 input_11; [L61] SORT_1 input_12; [L62] SORT_1 input_13; [L63] SORT_14 input_15; [L64] SORT_10 input_16; [L65] SORT_1 input_17; [L66] SORT_6 input_18; [L67] SORT_1 input_19; [L68] SORT_10 input_20; [L69] SORT_10 input_21; [L70] SORT_6 input_22; [L71] SORT_6 input_23; [L72] SORT_1 input_24; [L73] SORT_14 input_25; [L74] SORT_10 input_26; [L75] SORT_1 input_27; [L76] SORT_6 input_28; [L77] SORT_6 input_29; [L78] SORT_6 input_30; [L79] SORT_6 input_31; [L80] SORT_10 input_32; [L81] SORT_10 input_33; [L82] SORT_10 input_34; [L83] SORT_10 input_35; [L84] SORT_10 input_36; [L85] SORT_10 input_37; [L86] SORT_10 input_38; [L87] SORT_10 input_39; [L88] SORT_1 input_40; [L89] SORT_1 input_41; [L90] SORT_1 input_42; [L91] SORT_1 input_43; [L92] SORT_1 input_44; [L93] SORT_1 input_45; [L94] SORT_14 input_46; [L95] SORT_14 input_47; [L96] SORT_14 input_48; [L97] SORT_14 input_49; [L98] SORT_6 input_50; [L99] SORT_6 input_51; [L100] SORT_1 input_52; [L101] SORT_1 input_53; [L102] SORT_1 input_54; [L103] SORT_1 input_55; [L105] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L105] SORT_1 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L106] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L106] SORT_6 state_61 = __VERIFIER_nondet_uint() & mask_SORT_6; [L107] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L107] SORT_1 state_63 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L108] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L108] SORT_6 state_66 = __VERIFIER_nondet_uint() & mask_SORT_6; [L109] EXPR __VERIFIER_nondet_ulong() & mask_SORT_14 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L109] SORT_14 state_78 = __VERIFIER_nondet_ulong() & mask_SORT_14; [L110] EXPR __VERIFIER_nondet_ulong() & mask_SORT_14 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L110] SORT_14 state_81 = __VERIFIER_nondet_ulong() & mask_SORT_14; [L111] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L111] SORT_1 state_84 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L112] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L112] SORT_6 state_90 = __VERIFIER_nondet_uint() & mask_SORT_6; [L113] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L113] SORT_6 state_96 = __VERIFIER_nondet_uint() & mask_SORT_6; [L114] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L114] SORT_10 state_108 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L115] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L115] SORT_10 state_111 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L116] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L116] SORT_1 state_145 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L117] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L117] SORT_1 state_148 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L118] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L118] SORT_10 state_153 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L119] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L119] SORT_10 state_156 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L120] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L120] SORT_1 state_171 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L121] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L121] SORT_1 state_174 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L122] EXPR __VERIFIER_nondet_ulong() & mask_SORT_14 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L122] SORT_14 state_213 = __VERIFIER_nondet_ulong() & mask_SORT_14; [L123] EXPR __VERIFIER_nondet_ulong() & mask_SORT_14 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L123] SORT_14 state_216 = __VERIFIER_nondet_ulong() & mask_SORT_14; [L124] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L124] SORT_1 state_219 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L125] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L125] SORT_10 state_222 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L126] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L126] SORT_1 state_227 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L127] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L127] SORT_6 state_234 = __VERIFIER_nondet_uint() & mask_SORT_6; [L128] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L128] SORT_1 state_237 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L129] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L129] SORT_10 state_242 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L130] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L130] SORT_6 state_263 = __VERIFIER_nondet_uint() & mask_SORT_6; [L131] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L131] SORT_10 state_274 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L132] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L132] SORT_1 state_302 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L133] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L133] SORT_10 state_307 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L134] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L134] SORT_1 state_323 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L136] SORT_1 init_58_arg_1 = var_56; [L137] state_57 = init_58_arg_1 [L138] SORT_6 init_62_arg_1 = var_60; [L139] state_61 = init_62_arg_1 [L140] SORT_1 init_64_arg_1 = var_56; [L141] state_63 = init_64_arg_1 [L142] SORT_6 init_67_arg_1 = var_60; [L143] state_66 = init_67_arg_1 [L144] SORT_14 init_79_arg_1 = var_77; [L145] state_78 = init_79_arg_1 [L146] SORT_14 init_82_arg_1 = var_77; [L147] state_81 = init_82_arg_1 [L148] SORT_1 init_85_arg_1 = var_56; [L149] state_84 = init_85_arg_1 [L150] SORT_6 init_91_arg_1 = var_60; [L151] state_90 = init_91_arg_1 [L152] SORT_6 init_97_arg_1 = var_60; [L153] state_96 = init_97_arg_1 [L154] SORT_10 init_109_arg_1 = var_107; [L155] state_108 = init_109_arg_1 [L156] SORT_10 init_112_arg_1 = var_107; [L157] state_111 = init_112_arg_1 [L158] SORT_1 init_146_arg_1 = var_56; [L159] state_145 = init_146_arg_1 [L160] SORT_1 init_149_arg_1 = var_56; [L161] state_148 = init_149_arg_1 [L162] SORT_10 init_154_arg_1 = var_107; [L163] state_153 = init_154_arg_1 [L164] SORT_10 init_157_arg_1 = var_107; [L165] state_156 = init_157_arg_1 [L166] SORT_1 init_172_arg_1 = var_56; [L167] state_171 = init_172_arg_1 [L168] SORT_1 init_175_arg_1 = var_56; [L169] state_174 = init_175_arg_1 [L170] SORT_14 init_214_arg_1 = var_77; [L171] state_213 = init_214_arg_1 [L172] SORT_14 init_217_arg_1 = var_77; [L173] state_216 = init_217_arg_1 [L174] SORT_1 init_220_arg_1 = var_56; [L175] state_219 = init_220_arg_1 [L176] SORT_10 init_223_arg_1 = var_107; [L177] state_222 = init_223_arg_1 [L178] SORT_1 init_228_arg_1 = var_56; [L179] state_227 = init_228_arg_1 [L180] SORT_6 init_235_arg_1 = var_60; [L181] state_234 = init_235_arg_1 [L182] SORT_1 init_238_arg_1 = var_56; [L183] state_237 = init_238_arg_1 [L184] SORT_10 init_243_arg_1 = var_107; [L185] state_242 = init_243_arg_1 [L186] SORT_6 init_264_arg_1 = var_60; [L187] state_263 = init_264_arg_1 [L188] SORT_10 init_275_arg_1 = var_107; [L189] state_274 = init_275_arg_1 [L190] SORT_1 init_303_arg_1 = var_56; [L191] state_302 = init_303_arg_1 [L192] SORT_10 init_308_arg_1 = var_107; [L193] state_307 = init_308_arg_1 [L194] SORT_1 init_324_arg_1 = var_56; [L195] state_323 = init_324_arg_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, state_108=0, state_111=0, state_145=0, state_148=0, state_153=0, state_156=0, state_171=0, state_174=0, state_213=0, state_216=0, state_219=0, state_222=0, state_227=0, state_234=0, state_237=0, state_242=0, state_263=0, state_274=0, state_302=0, state_307=0, state_323=0, state_57=0, state_61=0, state_63=0, state_66=0, state_78=0, state_81=0, state_84=0, state_90=0, state_96=0, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L198] input_2 = __VERIFIER_nondet_uchar() [L199] EXPR input_2 & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, state_108=0, state_111=0, state_145=0, state_148=0, state_153=0, state_156=0, state_171=0, state_174=0, state_213=0, state_216=0, state_219=0, state_222=0, state_227=0, state_234=0, state_237=0, state_242=0, state_263=0, state_274=0, state_302=0, state_307=0, state_323=0, state_57=0, state_61=0, state_63=0, state_66=0, state_78=0, state_81=0, state_84=0, state_90=0, state_96=0, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L199] input_2 = input_2 & mask_SORT_1 [L200] input_3 = __VERIFIER_nondet_uchar() [L201] input_4 = __VERIFIER_nondet_uchar() [L202] input_5 = __VERIFIER_nondet_uchar() [L203] input_7 = __VERIFIER_nondet_uint() [L204] input_8 = __VERIFIER_nondet_uint() [L205] input_9 = __VERIFIER_nondet_uchar() [L206] EXPR input_9 & mask_SORT_1 VAL [input_2=0, mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, state_108=0, state_111=0, state_145=0, state_148=0, state_153=0, state_156=0, state_171=0, state_174=0, state_213=0, state_216=0, state_219=0, state_222=0, state_227=0, state_234=0, state_237=0, state_242=0, state_263=0, state_274=0, state_302=0, state_307=0, state_323=0, state_57=0, state_61=0, state_63=0, state_66=0, state_78=0, state_81=0, state_84=0, state_90=0, state_96=0, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_73=1, var_77=0] [L206] input_9 = input_9 & mask_SORT_1 [L207] input_11 = __VERIFIER_nondet_uchar() [L208] input_12 = __VERIFIER_nondet_uchar() [L209] input_13 = __VERIFIER_nondet_uchar() [L210] input_15 = __VERIFIER_nondet_ulong() [L211] input_16 = __VERIFIER_nondet_uchar() [L212] input_17 = __VERIFIER_nondet_uchar() [L213] input_18 = __VERIFIER_nondet_uint() [L214] input_19 = __VERIFIER_nondet_uchar() [L215] input_20 = __VERIFIER_nondet_uchar() [L216] input_21 = __VERIFIER_nondet_uchar() [L217] input_22 = __VERIFIER_nondet_uint() [L218] input_23 = __VERIFIER_nondet_uint() [L219] input_24 = __VERIFIER_nondet_uchar() [L220] input_25 = __VERIFIER_nondet_ulong() [L221] input_26 = __VERIFIER_nondet_uchar() [L222] input_27 = __VERIFIER_nondet_uchar() [L223] input_28 = __VERIFIER_nondet_uint() [L224] input_29 = __VERIFIER_nondet_uint() [L225] input_30 = __VERIFIER_nondet_uint() [L226] input_31 = __VERIFIER_nondet_uint() [L227] input_32 = __VERIFIER_nondet_uchar() [L228] input_33 = __VERIFIER_nondet_uchar() [L229] input_34 = __VERIFIER_nondet_uchar() [L230] input_35 = __VERIFIER_nondet_uchar() [L231] input_36 = __VERIFIER_nondet_uchar() [L232] input_37 = __VERIFIER_nondet_uchar() [L233] input_38 = __VERIFIER_nondet_uchar() [L234] input_39 = __VERIFIER_nondet_uchar() [L235] input_40 = __VERIFIER_nondet_uchar() [L236] input_41 = __VERIFIER_nondet_uchar() [L237] input_42 = __VERIFIER_nondet_uchar() [L238] input_43 = __VERIFIER_nondet_uchar() [L239] input_44 = __VERIFIER_nondet_uchar() [L240] input_45 = __VERIFIER_nondet_uchar() [L241] input_46 = __VERIFIER_nondet_ulong() [L242] input_47 = __VERIFIER_nondet_ulong() [L243] input_48 = __VERIFIER_nondet_ulong() [L244] input_49 = __VERIFIER_nondet_ulong() [L245] input_50 = __VERIFIER_nondet_uint() [L246] input_51 = __VERIFIER_nondet_uint() [L247] input_52 = __VERIFIER_nondet_uchar() [L248] input_53 = __VERIFIER_nondet_uchar() [L249] input_54 = __VERIFIER_nondet_uchar() [L250] input_55 = __VERIFIER_nondet_uchar() [L253] SORT_1 var_59_arg_0 = state_57; [L254] SORT_1 var_59 = ~var_59_arg_0; [L255] SORT_1 var_65_arg_0 = state_63; [L256] SORT_6 var_65_arg_1 = state_61; [L257] SORT_6 var_65_arg_2 = input_18; [L258] SORT_6 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; VAL [input_18=0, input_2=0, input_9=0, mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, state_108=0, state_111=0, state_145=0, state_148=0, state_153=0, state_156=0, state_171=0, state_174=0, state_213=0, state_216=0, state_219=0, state_222=0, state_227=0, state_234=0, state_237=0, state_242=0, state_263=0, state_274=0, state_302=0, state_307=0, state_323=0, state_57=0, state_63=0, state_66=0, state_78=0, state_81=0, state_84=0, state_90=0, state_96=0, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_59=-1, var_60=0, var_65=0, var_73=1, var_77=0] [L259] EXPR var_65 & mask_SORT_6 VAL [input_18=0, input_2=0, input_9=0, mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, state_108=0, state_111=0, state_145=0, state_148=0, state_153=0, state_156=0, state_171=0, state_174=0, state_213=0, state_216=0, state_219=0, state_222=0, state_227=0, state_234=0, state_237=0, state_242=0, state_263=0, state_274=0, state_302=0, state_307=0, state_323=0, state_57=0, state_63=0, state_66=0, state_78=0, state_81=0, state_84=0, state_90=0, state_96=0, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_59=-1, var_60=0, var_73=1, var_77=0] [L259] var_65 = var_65 & mask_SORT_6 [L260] SORT_1 var_68_arg_0 = state_63; [L261] SORT_6 var_68_arg_1 = state_66; [L262] SORT_6 var_68_arg_2 = input_18; [L263] SORT_6 var_68 = var_68_arg_0 ? var_68_arg_1 : var_68_arg_2; VAL [input_2=0, input_9=0, mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, state_108=0, state_111=0, state_145=0, state_148=0, state_153=0, state_156=0, state_171=0, state_174=0, state_213=0, state_216=0, state_219=0, state_222=0, state_227=0, state_234=0, state_237=0, state_242=0, state_263=0, state_274=0, state_302=0, state_307=0, state_323=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_96=0, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_59=-1, var_60=0, var_65=0, var_68=0, var_73=1, var_77=0] [L264] EXPR var_68 & mask_SORT_6 VAL [input_2=0, input_9=0, mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, state_108=0, state_111=0, state_145=0, state_148=0, state_153=0, state_156=0, state_171=0, state_174=0, state_213=0, state_216=0, state_219=0, state_222=0, state_227=0, state_234=0, state_237=0, state_242=0, state_263=0, state_274=0, state_302=0, state_307=0, state_323=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_96=0, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_59=-1, var_60=0, var_65=0, var_73=1, var_77=0] [L264] var_68 = var_68 & mask_SORT_6 [L265] SORT_6 var_69_arg_0 = var_65; [L266] SORT_6 var_69_arg_1 = var_68; [L267] SORT_1 var_69 = var_69_arg_0 == var_69_arg_1; [L268] SORT_1 var_70_arg_0 = var_59; [L269] SORT_1 var_70_arg_1 = var_69; VAL [input_2=0, input_9=0, mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, state_108=0, state_111=0, state_145=0, state_148=0, state_153=0, state_156=0, state_171=0, state_174=0, state_213=0, state_216=0, state_219=0, state_222=0, state_227=0, state_234=0, state_237=0, state_242=0, state_263=0, state_274=0, state_302=0, state_307=0, state_323=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_96=0, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_65=0, var_70_arg_0=-1, var_70_arg_1=1, var_73=1, var_77=0] [L270] EXPR var_70_arg_0 | var_70_arg_1 VAL [input_2=0, input_9=0, mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, state_108=0, state_111=0, state_145=0, state_148=0, state_153=0, state_156=0, state_171=0, state_174=0, state_213=0, state_216=0, state_219=0, state_222=0, state_227=0, state_234=0, state_237=0, state_242=0, state_263=0, state_274=0, state_302=0, state_307=0, state_323=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_96=0, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_65=0, var_73=1, var_77=0] [L270] SORT_1 var_70 = var_70_arg_0 | var_70_arg_1; [L271] SORT_1 var_74_arg_0 = var_70; [L272] SORT_1 var_74 = ~var_74_arg_0; [L273] SORT_1 var_75_arg_0 = var_73; [L274] SORT_1 var_75_arg_1 = var_74; VAL [input_2=0, input_9=0, mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, state_108=0, state_111=0, state_145=0, state_148=0, state_153=0, state_156=0, state_171=0, state_174=0, state_213=0, state_216=0, state_219=0, state_222=0, state_227=0, state_234=0, state_237=0, state_242=0, state_263=0, state_274=0, state_302=0, state_307=0, state_323=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_96=0, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_65=0, var_73=1, var_75_arg_0=1, var_75_arg_1=-1, var_77=0] [L275] EXPR var_75_arg_0 & var_75_arg_1 VAL [input_2=0, input_9=0, mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, state_108=0, state_111=0, state_145=0, state_148=0, state_153=0, state_156=0, state_171=0, state_174=0, state_213=0, state_216=0, state_219=0, state_222=0, state_227=0, state_234=0, state_237=0, state_242=0, state_263=0, state_274=0, state_302=0, state_307=0, state_323=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_96=0, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_65=0, var_73=1, var_77=0] [L275] SORT_1 var_75 = var_75_arg_0 & var_75_arg_1; [L276] EXPR var_75 & mask_SORT_1 VAL [input_2=0, input_9=0, mask_SORT_10=15, mask_SORT_121=3, mask_SORT_1=1, mask_SORT_6=-1, state_108=0, state_111=0, state_145=0, state_148=0, state_153=0, state_156=0, state_171=0, state_174=0, state_213=0, state_216=0, state_219=0, state_222=0, state_227=0, state_234=0, state_237=0, state_242=0, state_263=0, state_274=0, state_302=0, state_307=0, state_323=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_96=0, var_107=0, var_116=2, var_119=4, var_126=1, var_133=1, var_136=3, var_139=2, var_56=0, var_60=0, var_65=0, var_73=1, var_77=0] [L276] var_75 = var_75 & mask_SORT_1 [L277] SORT_1 bad_76_arg_0 = var_75; [L278] CALL __VERIFIER_assert(!(bad_76_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 507 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2398 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2398 mSDsluCounter, 17208 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13455 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 313 IncrementalHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 3753 mSDtfsCounter, 313 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=535occurred in iteration=5, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 51 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 483 NumberOfCodeBlocks, 483 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 395 ConstructedInterpolants, 0 QuantifiedInterpolants, 1376 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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-14 05:50:09,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 e845250638bf2269b9610642a85a2d027126b83f570f70da1feb220fdec8c1ec --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 05:50:11,378 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 05:50:11,442 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-14 05:50:11,447 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 05:50:11,447 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 05:50:11,475 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 05:50:11,477 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 05:50:11,478 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 05:50:11,478 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 05:50:11,480 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 05:50:11,480 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 05:50:11,481 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 05:50:11,481 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 05:50:11,483 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 05:50:11,484 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 05:50:11,484 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 05:50:11,484 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 05:50:11,484 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 05:50:11,485 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 05:50:11,485 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 05:50:11,485 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 05:50:11,485 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 05:50:11,485 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 05:50:11,486 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 05:50:11,486 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 05:50:11,486 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 05:50:11,486 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 05:50:11,486 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 05:50:11,487 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 05:50:11,487 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 05:50:11,487 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 05:50:11,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:50:11,487 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 05:50:11,487 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 05:50:11,488 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 05:50:11,488 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 05:50:11,488 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 05:50:11,488 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 05:50:11,488 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 05:50:11,488 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 05:50:11,488 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 05:50:11,490 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 05:50:11,490 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/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/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 -> e845250638bf2269b9610642a85a2d027126b83f570f70da1feb220fdec8c1ec [2024-10-14 05:50:11,754 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 05:50:11,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 05:50:11,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 05:50:11,782 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 05:50:11,783 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 05:50:11,784 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal2.c [2024-10-14 05:50:13,187 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 05:50:13,421 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 05:50:13,424 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal2.c [2024-10-14 05:50:13,445 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/345af1978/7dcebd65637040768aff927c7affb395/FLAG6103e3a50 [2024-10-14 05:50:13,767 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/345af1978/7dcebd65637040768aff927c7affb395 [2024-10-14 05:50:13,770 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 05:50:13,772 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 05:50:13,774 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 05:50:13,775 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 05:50:13,779 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 05:50:13,780 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:50:13" (1/1) ... [2024-10-14 05:50:13,780 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77df82b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:50:13, skipping insertion in model container [2024-10-14 05:50:13,781 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:50:13" (1/1) ... [2024-10-14 05:50:13,828 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 05:50:13,976 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.cal2.c[1244,1257] [2024-10-14 05:50:14,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:50:14,164 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 05:50:14,177 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.cal2.c[1244,1257] [2024-10-14 05:50:14,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:50:14,301 INFO L204 MainTranslator]: Completed translation [2024-10-14 05:50:14,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:50:14 WrapperNode [2024-10-14 05:50:14,302 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 05:50:14,303 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 05:50:14,304 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 05:50:14,304 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 05:50:14,310 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:50:14" (1/1) ... [2024-10-14 05:50:14,343 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:50:14" (1/1) ... [2024-10-14 05:50:14,397 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1328 [2024-10-14 05:50:14,397 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 05:50:14,398 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 05:50:14,398 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 05:50:14,398 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 05:50:14,407 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:50:14" (1/1) ... [2024-10-14 05:50:14,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:50:14" (1/1) ... [2024-10-14 05:50:14,416 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:50:14" (1/1) ... [2024-10-14 05:50:14,454 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2024-10-14 05:50:14,455 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:50:14" (1/1) ... [2024-10-14 05:50:14,455 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:50:14" (1/1) ... [2024-10-14 05:50:14,481 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:50:14" (1/1) ... [2024-10-14 05:50:14,484 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:50:14" (1/1) ... [2024-10-14 05:50:14,488 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:50:14" (1/1) ... [2024-10-14 05:50:14,493 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:50:14" (1/1) ... [2024-10-14 05:50:14,502 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 05:50:14,503 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 05:50:14,503 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 05:50:14,503 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 05:50:14,504 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:50:14" (1/1) ... [2024-10-14 05:50:14,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:50:14,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:50:14,546 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 05:50:14,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 05:50:14,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 05:50:14,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 05:50:14,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 05:50:14,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 05:50:14,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 05:50:14,834 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 05:50:14,836 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 05:50:15,618 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live. [2024-10-14 05:50:15,619 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 05:50:15,676 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 05:50:15,677 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 05:50:15,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:50:15 BoogieIcfgContainer [2024-10-14 05:50:15,678 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 05:50:15,680 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 05:50:15,680 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 05:50:15,683 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 05:50:15,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:50:13" (1/3) ... [2024-10-14 05:50:15,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@587cefa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:50:15, skipping insertion in model container [2024-10-14 05:50:15,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:50:14" (2/3) ... [2024-10-14 05:50:15,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@587cefa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:50:15, skipping insertion in model container [2024-10-14 05:50:15,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:50:15" (3/3) ... [2024-10-14 05:50:15,685 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal2.c [2024-10-14 05:50:15,700 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 05:50:15,700 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 05:50:15,751 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 05:50:15,757 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;@2dfa5d80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 05:50:15,758 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 05:50:15,761 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-14 05:50:15,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-14 05:50:15,766 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:50:15,766 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-14 05:50:15,767 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:50:15,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:50:15,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-14 05:50:15,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 05:50:15,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1873776247] [2024-10-14 05:50:15,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:50:15,786 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-14 05:50:15,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 05:50:15,789 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-14 05:50:15,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-14 05:50:16,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:50:16,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 05:50:16,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:50:16,160 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-14 05:50:16,160 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:50:16,161 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 05:50:16,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1873776247] [2024-10-14 05:50:16,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1873776247] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:50:16,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:50:16,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 05:50:16,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805174839] [2024-10-14 05:50:16,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:50:16,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:50:16,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 05:50:16,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:50:16,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:50:16,188 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-14 05:50:16,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:50:16,349 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-14 05:50:16,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 05:50:16,351 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-14 05:50:16,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:50:16,356 INFO L225 Difference]: With dead ends: 15 [2024-10-14 05:50:16,356 INFO L226 Difference]: Without dead ends: 9 [2024-10-14 05:50:16,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-14 05:50:16,362 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-14 05:50:16,363 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-14 05:50:16,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-14 05:50:16,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-14 05:50:16,386 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-14 05:50:16,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-14 05:50:16,388 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-14 05:50:16,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:50:16,388 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-14 05:50:16,388 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-14 05:50:16,389 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-14 05:50:16,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 05:50:16,389 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:50:16,389 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-14 05:50:16,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-14 05:50:16,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-14 05:50:16,590 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:50:16,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:50:16,591 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-14 05:50:16,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 05:50:16,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1717465095] [2024-10-14 05:50:16,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:50:16,592 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-14 05:50:16,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 05:50:16,595 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-14 05:50:16,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-14 05:50:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:50:17,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-14 05:50:17,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:50:17,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:50:17,171 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 05:50:17,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:50:17,905 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 05:50:17,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1717465095] [2024-10-14 05:50:17,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1717465095] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 05:50:17,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 05:50:17,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-14 05:50:17,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208083228] [2024-10-14 05:50:17,905 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 05:50:17,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 05:50:17,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 05:50:17,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 05:50:17,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:50:17,907 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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-14 05:50:18,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:50:18,252 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-10-14 05:50:18,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 05:50:18,253 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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 7 [2024-10-14 05:50:18,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:50:18,254 INFO L225 Difference]: With dead ends: 14 [2024-10-14 05:50:18,254 INFO L226 Difference]: Without dead ends: 12 [2024-10-14 05:50:18,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:50:18,255 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 8 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 05:50:18,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 11 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 05:50:18,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-10-14 05:50:18,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2024-10-14 05:50:18,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-14 05:50:18,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2024-10-14 05:50:18,259 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2024-10-14 05:50:18,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:50:18,260 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2024-10-14 05:50:18,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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-14 05:50:18,260 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2024-10-14 05:50:18,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 05:50:18,260 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:50:18,260 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2024-10-14 05:50:18,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Forceful destruction successful, exit code 0 [2024-10-14 05:50:18,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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-14 05:50:18,466 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:50:18,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:50:18,466 INFO L85 PathProgramCache]: Analyzing trace with hash 148265266, now seen corresponding path program 2 times [2024-10-14 05:50:18,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 05:50:18,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1447944081] [2024-10-14 05:50:18,469 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 05:50:18,470 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-14 05:50:18,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 05:50:18,476 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-14 05:50:18,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (4)] Waiting until timeout for monitored process [2024-10-14 05:50:19,089 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 05:50:19,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 05:50:19,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-14 05:50:19,127 INFO L278 TraceCheckSpWp]: Computing forward predicates...