./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.count4.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.count4.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 7520cfa04676a157cc3b0d71c42a9ed73acdf0d120a939e33f1a3e61a093ef11 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 17:14:08,164 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 17:14:08,265 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-18 17:14:08,274 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 17:14:08,275 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 17:14:08,319 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 17:14:08,323 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 17:14:08,325 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 17:14:08,326 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 17:14:08,326 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 17:14:08,326 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 17:14:08,326 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 17:14:08,327 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 17:14:08,327 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 17:14:08,327 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 17:14:08,327 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 17:14:08,328 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 17:14:08,328 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 17:14:08,328 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 17:14:08,328 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 17:14:08,328 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 17:14:08,342 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 17:14:08,342 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 17:14:08,343 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 17:14:08,348 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 17:14:08,348 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 17:14:08,349 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 17:14:08,349 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 17:14:08,349 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 17:14:08,349 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 17:14:08,349 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 17:14:08,349 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 17:14:08,350 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 17:14:08,350 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 17:14:08,350 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 17:14:08,350 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 17:14:08,350 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 17:14:08,350 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 17:14:08,350 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 17:14:08,351 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 -> 7520cfa04676a157cc3b0d71c42a9ed73acdf0d120a939e33f1a3e61a093ef11 [2024-11-18 17:14:08,733 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 17:14:08,752 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 17:14:08,755 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 17:14:08,756 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 17:14:08,756 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 17:14:08,757 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.count4.c [2024-11-18 17:14:10,163 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 17:14:10,309 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 17:14:10,310 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.count4.c [2024-11-18 17:14:10,315 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b764d0efc/829ed9ef92b3457eb87e6ad1a834b474/FLAGd0a8f3bf4 [2024-11-18 17:14:10,326 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b764d0efc/829ed9ef92b3457eb87e6ad1a834b474 [2024-11-18 17:14:10,328 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 17:14:10,330 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 17:14:10,333 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 17:14:10,333 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 17:14:10,339 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 17:14:10,340 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:14:10" (1/1) ... [2024-11-18 17:14:10,341 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@616c800b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:14:10, skipping insertion in model container [2024-11-18 17:14:10,343 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:14:10" (1/1) ... [2024-11-18 17:14:10,361 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 17:14:10,505 WARN L250 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.count4.c[1256,1269] [2024-11-18 17:14:10,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 17:14:10,558 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 17:14:10,568 WARN L250 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.count4.c[1256,1269] [2024-11-18 17:14:10,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 17:14:10,587 INFO L204 MainTranslator]: Completed translation [2024-11-18 17:14:10,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:14:10 WrapperNode [2024-11-18 17:14:10,587 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 17:14:10,588 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 17:14:10,588 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 17:14:10,588 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 17:14:10,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:14:10" (1/1) ... [2024-11-18 17:14:10,606 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:14:10" (1/1) ... [2024-11-18 17:14:10,638 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 58 [2024-11-18 17:14:10,638 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 17:14:10,639 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 17:14:10,639 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 17:14:10,639 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 17:14:10,652 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:14:10" (1/1) ... [2024-11-18 17:14:10,652 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:14:10" (1/1) ... [2024-11-18 17:14:10,654 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:14:10" (1/1) ... [2024-11-18 17:14:10,668 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-18 17:14:10,668 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:14:10" (1/1) ... [2024-11-18 17:14:10,669 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:14:10" (1/1) ... [2024-11-18 17:14:10,671 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:14:10" (1/1) ... [2024-11-18 17:14:10,677 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:14:10" (1/1) ... [2024-11-18 17:14:10,678 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:14:10" (1/1) ... [2024-11-18 17:14:10,682 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:14:10" (1/1) ... [2024-11-18 17:14:10,683 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 17:14:10,684 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 17:14:10,685 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 17:14:10,686 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 17:14:10,686 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:14:10" (1/1) ... [2024-11-18 17:14:10,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 17:14:10,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 17:14:10,721 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-11-18 17:14:10,727 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-11-18 17:14:10,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 17:14:10,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 17:14:10,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 17:14:10,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 17:14:10,809 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 17:14:10,811 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 17:14:10,961 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-18 17:14:10,961 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 17:14:10,969 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 17:14:10,969 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 17:14:10,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:14:10 BoogieIcfgContainer [2024-11-18 17:14:10,970 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 17:14:10,972 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 17:14:10,972 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 17:14:10,974 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 17:14:10,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 05:14:10" (1/3) ... [2024-11-18 17:14:10,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72cac052 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:14:10, skipping insertion in model container [2024-11-18 17:14:10,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:14:10" (2/3) ... [2024-11-18 17:14:10,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72cac052 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:14:10, skipping insertion in model container [2024-11-18 17:14:10,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:14:10" (3/3) ... [2024-11-18 17:14:10,976 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.count4.c [2024-11-18 17:14:10,988 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 17:14:10,988 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 17:14:11,026 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 17:14:11,031 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;@5412e5f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 17:14:11,031 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 17:14:11,034 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 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-11-18 17:14:11,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-18 17:14:11,038 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:14:11,039 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-18 17:14:11,039 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:14:11,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:14:11,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1805152072, now seen corresponding path program 1 times [2024-11-18 17:14:11,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 17:14:11,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99228860] [2024-11-18 17:14:11,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:14:11,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 17:14:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:14:11,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 17:14:11,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 17:14:11,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99228860] [2024-11-18 17:14:11,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99228860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 17:14:11,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 17:14:11,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 17:14:11,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994874759] [2024-11-18 17:14:11,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 17:14:11,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 17:14:11,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 17:14:11,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 17:14:11,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 17:14:11,556 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 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 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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-11-18 17:14:11,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:14:11,605 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2024-11-18 17:14:11,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 17:14:11,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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-11-18 17:14:11,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:14:11,613 INFO L225 Difference]: With dead ends: 30 [2024-11-18 17:14:11,613 INFO L226 Difference]: Without dead ends: 18 [2024-11-18 17:14:11,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-18 17:14:11,618 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 6 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 17:14:11,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 52 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 17:14:11,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-18 17:14:11,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2024-11-18 17:14:11,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 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-11-18 17:14:11,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2024-11-18 17:14:11,642 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 7 [2024-11-18 17:14:11,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:14:11,642 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-11-18 17:14:11,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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-11-18 17:14:11,642 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2024-11-18 17:14:11,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-18 17:14:11,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:14:11,643 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 17:14:11,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 17:14:11,644 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:14:11,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:14:11,644 INFO L85 PathProgramCache]: Analyzing trace with hash 185570019, now seen corresponding path program 1 times [2024-11-18 17:14:11,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 17:14:11,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766371489] [2024-11-18 17:14:11,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:14:11,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 17:14:11,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:14:11,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 17:14:11,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 17:14:11,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766371489] [2024-11-18 17:14:11,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766371489] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 17:14:11,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841070871] [2024-11-18 17:14:11,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:14:11,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 17:14:11,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 17:14:11,889 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 17:14:11,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 17:14:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:14:11,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-18 17:14:11,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 17:14:12,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 17:14:12,142 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 17:14:12,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 17:14:12,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841070871] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 17:14:12,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 17:14:12,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 7] total 13 [2024-11-18 17:14:12,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886207482] [2024-11-18 17:14:12,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 17:14:12,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-18 17:14:12,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 17:14:12,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-18 17:14:12,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-18 17:14:12,314 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 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-11-18 17:14:12,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:14:12,381 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2024-11-18 17:14:12,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 17:14:12,381 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 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 12 [2024-11-18 17:14:12,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:14:12,382 INFO L225 Difference]: With dead ends: 23 [2024-11-18 17:14:12,382 INFO L226 Difference]: Without dead ends: 21 [2024-11-18 17:14:12,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2024-11-18 17:14:12,383 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 38 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 17:14:12,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 98 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 17:14:12,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-18 17:14:12,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2024-11-18 17:14:12,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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-11-18 17:14:12,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2024-11-18 17:14:12,386 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 12 [2024-11-18 17:14:12,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:14:12,387 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-11-18 17:14:12,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 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-11-18 17:14:12,387 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2024-11-18 17:14:12,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-18 17:14:12,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:14:12,387 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 17:14:12,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-18 17:14:12,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 17:14:12,589 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:14:12,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:14:12,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1511026262, now seen corresponding path program 1 times [2024-11-18 17:14:12,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 17:14:12,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97047308] [2024-11-18 17:14:12,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:14:12,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 17:14:12,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:14:12,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 17:14:12,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 17:14:12,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97047308] [2024-11-18 17:14:12,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97047308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 17:14:12,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 17:14:12,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 17:14:12,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741980298] [2024-11-18 17:14:12,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 17:14:12,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 17:14:12,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 17:14:12,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 17:14:12,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 17:14:12,693 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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-11-18 17:14:12,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:14:12,733 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2024-11-18 17:14:12,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 17:14:12,734 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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 13 [2024-11-18 17:14:12,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:14:12,734 INFO L225 Difference]: With dead ends: 36 [2024-11-18 17:14:12,734 INFO L226 Difference]: Without dead ends: 24 [2024-11-18 17:14:12,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 17:14:12,735 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 5 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 17:14:12,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 20 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 17:14:12,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-18 17:14:12,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2024-11-18 17:14:12,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 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-11-18 17:14:12,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2024-11-18 17:14:12,739 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 13 [2024-11-18 17:14:12,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:14:12,739 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-11-18 17:14:12,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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-11-18 17:14:12,739 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2024-11-18 17:14:12,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-18 17:14:12,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:14:12,740 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 17:14:12,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 17:14:12,740 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:14:12,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:14:12,741 INFO L85 PathProgramCache]: Analyzing trace with hash -346732602, now seen corresponding path program 1 times [2024-11-18 17:14:12,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 17:14:12,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262984392] [2024-11-18 17:14:12,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:14:12,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 17:14:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:14:13,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 17:14:13,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 17:14:13,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262984392] [2024-11-18 17:14:13,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262984392] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 17:14:13,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641883492] [2024-11-18 17:14:13,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:14:13,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 17:14:13,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 17:14:13,349 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 17:14:13,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-18 17:14:13,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:14:13,405 WARN L253 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-18 17:14:13,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 17:14:13,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 17:14:13,770 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 17:14:14,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 17:14:14,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641883492] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 17:14:14,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 17:14:14,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 12] total 26 [2024-11-18 17:14:14,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519530025] [2024-11-18 17:14:14,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 17:14:14,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-18 17:14:14,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 17:14:14,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-18 17:14:14,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2024-11-18 17:14:14,428 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 26 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 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-11-18 17:14:14,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:14:14,601 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2024-11-18 17:14:14,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 17:14:14,601 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 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 14 [2024-11-18 17:14:14,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:14:14,602 INFO L225 Difference]: With dead ends: 40 [2024-11-18 17:14:14,602 INFO L226 Difference]: Without dead ends: 28 [2024-11-18 17:14:14,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2024-11-18 17:14:14,604 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 12 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 17:14:14,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 54 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 17:14:14,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-18 17:14:14,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2024-11-18 17:14:14,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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-11-18 17:14:14,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-11-18 17:14:14,607 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 14 [2024-11-18 17:14:14,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:14:14,608 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-11-18 17:14:14,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 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-11-18 17:14:14,608 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2024-11-18 17:14:14,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-18 17:14:14,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:14:14,609 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 17:14:14,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-18 17:14:14,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-18 17:14:14,813 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:14:14,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:14:14,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1746694228, now seen corresponding path program 1 times [2024-11-18 17:14:14,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 17:14:14,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516149226] [2024-11-18 17:14:14,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:14:14,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 17:14:14,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:14:15,025 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 17:14:15,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 17:14:15,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516149226] [2024-11-18 17:14:15,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516149226] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 17:14:15,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4131690] [2024-11-18 17:14:15,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:14:15,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 17:14:15,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 17:14:15,030 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 17:14:15,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-18 17:14:15,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:14:15,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-18 17:14:15,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 17:14:15,312 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 17:14:15,312 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 17:14:19,854 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 17:14:19,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4131690] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 17:14:19,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 17:14:19,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 10] total 23 [2024-11-18 17:14:19,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256422322] [2024-11-18 17:14:19,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 17:14:19,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-18 17:14:19,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 17:14:19,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-18 17:14:19,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2024-11-18 17:14:19,856 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 states have internal predecessors, (50), 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-11-18 17:14:20,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:14:20,075 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2024-11-18 17:14:20,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-18 17:14:20,076 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 states have internal predecessors, (50), 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 20 [2024-11-18 17:14:20,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:14:20,076 INFO L225 Difference]: With dead ends: 51 [2024-11-18 17:14:20,076 INFO L226 Difference]: Without dead ends: 39 [2024-11-18 17:14:20,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2024-11-18 17:14:20,078 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 11 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 17:14:20,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 50 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 17:14:20,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-18 17:14:20,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2024-11-18 17:14:20,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 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-11-18 17:14:20,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2024-11-18 17:14:20,084 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 20 [2024-11-18 17:14:20,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:14:20,085 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-11-18 17:14:20,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 states have internal predecessors, (50), 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-11-18 17:14:20,085 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2024-11-18 17:14:20,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-18 17:14:20,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:14:20,088 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-18 17:14:20,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-18 17:14:20,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 17:14:20,293 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:14:20,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:14:20,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1630960248, now seen corresponding path program 2 times [2024-11-18 17:14:20,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 17:14:20,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960240315] [2024-11-18 17:14:20,294 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 17:14:20,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 17:14:20,320 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 17:14:20,321 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 17:14:20,924 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 17:14:20,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 17:14:20,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960240315] [2024-11-18 17:14:20,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960240315] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 17:14:20,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501166709] [2024-11-18 17:14:20,925 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 17:14:20,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 17:14:20,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 17:14:20,928 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 17:14:20,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-18 17:14:20,992 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 17:14:20,993 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 17:14:20,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-18 17:14:21,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 17:14:21,714 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 17:14:21,714 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 17:14:24,857 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 17:14:24,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501166709] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 17:14:24,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 17:14:24,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 32 [2024-11-18 17:14:24,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799217187] [2024-11-18 17:14:24,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 17:14:24,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-18 17:14:24,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 17:14:24,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-18 17:14:24,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=870, Unknown=0, NotChecked=0, Total=992 [2024-11-18 17:14:24,863 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 32 states, 32 states have (on average 1.8125) internal successors, (58), 32 states have internal predecessors, (58), 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-11-18 17:14:25,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:14:25,770 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2024-11-18 17:14:25,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-18 17:14:25,770 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.8125) internal successors, (58), 32 states have internal predecessors, (58), 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 21 [2024-11-18 17:14:25,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:14:25,771 INFO L225 Difference]: With dead ends: 49 [2024-11-18 17:14:25,771 INFO L226 Difference]: Without dead ends: 37 [2024-11-18 17:14:25,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=331, Invalid=1831, Unknown=0, NotChecked=0, Total=2162 [2024-11-18 17:14:25,772 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 37 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 17:14:25,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 31 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 17:14:25,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-18 17:14:25,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-18 17:14:25,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 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-11-18 17:14:25,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2024-11-18 17:14:25,777 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 21 [2024-11-18 17:14:25,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:14:25,777 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2024-11-18 17:14:25,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.8125) internal successors, (58), 32 states have internal predecessors, (58), 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-11-18 17:14:25,778 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2024-11-18 17:14:25,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-18 17:14:25,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:14:25,778 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 17:14:25,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-18 17:14:25,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 17:14:25,979 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:14:25,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:14:25,980 INFO L85 PathProgramCache]: Analyzing trace with hash 860979732, now seen corresponding path program 2 times [2024-11-18 17:14:25,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 17:14:25,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207329916] [2024-11-18 17:14:25,981 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 17:14:25,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 17:14:26,013 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 17:14:26,013 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 17:14:26,747 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 11 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 17:14:26,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 17:14:26,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207329916] [2024-11-18 17:14:26,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207329916] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 17:14:26,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737846975] [2024-11-18 17:14:26,747 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 17:14:26,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 17:14:26,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 17:14:26,749 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 17:14:26,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-18 17:14:26,923 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 17:14:26,923 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 17:14:26,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-11-18 17:14:26,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 17:14:28,357 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 11 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 17:14:28,357 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 17:14:29,736 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 7 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 17:14:29,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737846975] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 17:14:29,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 17:14:29,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 19] total 45 [2024-11-18 17:14:29,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382636362] [2024-11-18 17:14:29,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 17:14:29,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-18 17:14:29,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 17:14:29,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-18 17:14:29,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=1691, Unknown=0, NotChecked=0, Total=1980 [2024-11-18 17:14:29,743 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 45 states, 45 states have (on average 2.022222222222222) internal successors, (91), 45 states have internal predecessors, (91), 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-11-18 17:14:30,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:14:30,834 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2024-11-18 17:14:30,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-18 17:14:30,835 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.022222222222222) internal successors, (91), 45 states have internal predecessors, (91), 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 34 [2024-11-18 17:14:30,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:14:30,835 INFO L225 Difference]: With dead ends: 77 [2024-11-18 17:14:30,835 INFO L226 Difference]: Without dead ends: 65 [2024-11-18 17:14:30,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1005 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=396, Invalid=2360, Unknown=0, NotChecked=0, Total=2756 [2024-11-18 17:14:30,837 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 11 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 17:14:30,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 66 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 17:14:30,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-18 17:14:30,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-18 17:14:30,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.0625) internal successors, (68), 64 states have internal predecessors, (68), 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-11-18 17:14:30,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2024-11-18 17:14:30,842 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 34 [2024-11-18 17:14:30,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:14:30,842 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2024-11-18 17:14:30,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.022222222222222) internal successors, (91), 45 states have internal predecessors, (91), 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-11-18 17:14:30,843 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2024-11-18 17:14:30,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-18 17:14:30,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:14:30,844 INFO L215 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 17:14:30,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-18 17:14:31,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 17:14:31,048 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:14:31,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:14:31,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1741589100, now seen corresponding path program 3 times [2024-11-18 17:14:31,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 17:14:31,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606891414] [2024-11-18 17:14:31,048 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-18 17:14:31,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 17:14:31,202 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2024-11-18 17:14:31,202 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 17:14:33,324 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 23 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 17:14:33,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 17:14:33,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606891414] [2024-11-18 17:14:33,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606891414] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 17:14:33,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556112469] [2024-11-18 17:14:33,325 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-18 17:14:33,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 17:14:33,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 17:14:33,328 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 17:14:33,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-18 17:14:33,563 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2024-11-18 17:14:33,563 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 17:14:33,567 WARN L253 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 167 conjuncts are in the unsatisfiable core [2024-11-18 17:14:33,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 17:14:51,688 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-18 17:14:51,689 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-18 17:14:51,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-11-18 17:14:51,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-18 17:14:51,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 17:14:51,895 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:86) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:947) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:553) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:195) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:290) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 46 more [2024-11-18 17:14:51,909 INFO L158 Benchmark]: Toolchain (without parser) took 41579.99ms. Allocated memory was 172.0MB in the beginning and 453.0MB in the end (delta: 281.0MB). Free memory was 105.4MB in the beginning and 178.5MB in the end (delta: -73.2MB). Peak memory consumption was 210.3MB. Max. memory is 16.1GB. [2024-11-18 17:14:51,910 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 117.4MB. Free memory is still 78.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 17:14:51,911 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.71ms. Allocated memory is still 172.0MB. Free memory was 105.2MB in the beginning and 143.7MB in the end (delta: -38.5MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2024-11-18 17:14:51,911 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.15ms. Allocated memory is still 172.0MB. Free memory was 143.7MB in the beginning and 141.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 17:14:51,911 INFO L158 Benchmark]: Boogie Preprocessor took 44.21ms. Allocated memory is still 172.0MB. Free memory was 141.7MB in the beginning and 139.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 17:14:51,911 INFO L158 Benchmark]: RCFGBuilder took 286.33ms. Allocated memory is still 172.0MB. Free memory was 139.6MB in the beginning and 126.3MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-18 17:14:51,911 INFO L158 Benchmark]: TraceAbstraction took 40937.54ms. Allocated memory was 172.0MB in the beginning and 453.0MB in the end (delta: 281.0MB). Free memory was 125.7MB in the beginning and 178.5MB in the end (delta: -52.8MB). Peak memory consumption was 228.6MB. Max. memory is 16.1GB. [2024-11-18 17:14:51,913 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 117.4MB. Free memory is still 78.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 254.71ms. Allocated memory is still 172.0MB. Free memory was 105.2MB in the beginning and 143.7MB in the end (delta: -38.5MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.15ms. Allocated memory is still 172.0MB. Free memory was 143.7MB in the beginning and 141.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.21ms. Allocated memory is still 172.0MB. Free memory was 141.7MB in the beginning and 139.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 286.33ms. Allocated memory is still 172.0MB. Free memory was 139.6MB in the beginning and 126.3MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 40937.54ms. Allocated memory was 172.0MB in the beginning and 453.0MB in the end (delta: 281.0MB). Free memory was 125.7MB in the beginning and 178.5MB in the end (delta: -52.8MB). Peak memory consumption was 228.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. 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/11.0.12-open/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 ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.count4.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 7520cfa04676a157cc3b0d71c42a9ed73acdf0d120a939e33f1a3e61a093ef11 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 17:14:53,852 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 17:14:53,926 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-18 17:14:53,930 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 17:14:53,931 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 17:14:53,963 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 17:14:53,963 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 17:14:53,964 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 17:14:53,964 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 17:14:53,965 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 17:14:53,965 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 17:14:53,965 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 17:14:53,966 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 17:14:53,966 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 17:14:53,968 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 17:14:53,968 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 17:14:53,968 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 17:14:53,969 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 17:14:53,969 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 17:14:53,969 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 17:14:53,969 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 17:14:53,970 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 17:14:53,970 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 17:14:53,971 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 17:14:53,971 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 17:14:53,971 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 17:14:53,971 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 17:14:53,972 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 17:14:53,972 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 17:14:53,972 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 17:14:53,973 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 17:14:53,973 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 17:14:53,973 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 17:14:53,973 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 17:14:53,974 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 17:14:53,974 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 17:14:53,974 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 17:14:53,974 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 17:14:53,975 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 17:14:53,975 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 17:14:53,975 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 17:14:53,975 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 -> 7520cfa04676a157cc3b0d71c42a9ed73acdf0d120a939e33f1a3e61a093ef11 [2024-11-18 17:14:54,234 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 17:14:54,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 17:14:54,277 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 17:14:54,278 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 17:14:54,278 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 17:14:54,280 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.count4.c [2024-11-18 17:14:55,700 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 17:14:55,849 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 17:14:55,850 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.count4.c [2024-11-18 17:14:55,857 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08f990efd/b587886d3e144171b1e7df99ceda8c59/FLAG4049d54a8 [2024-11-18 17:14:56,267 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08f990efd/b587886d3e144171b1e7df99ceda8c59 [2024-11-18 17:14:56,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 17:14:56,274 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 17:14:56,275 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 17:14:56,275 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 17:14:56,280 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 17:14:56,280 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:14:56" (1/1) ... [2024-11-18 17:14:56,283 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b42d1b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:14:56, skipping insertion in model container [2024-11-18 17:14:56,283 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:14:56" (1/1) ... [2024-11-18 17:14:56,301 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 17:14:56,446 WARN L250 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.count4.c[1256,1269] [2024-11-18 17:14:56,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 17:14:56,484 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 17:14:56,494 WARN L250 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.count4.c[1256,1269] [2024-11-18 17:14:56,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 17:14:56,518 INFO L204 MainTranslator]: Completed translation [2024-11-18 17:14:56,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:14:56 WrapperNode [2024-11-18 17:14:56,519 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 17:14:56,520 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 17:14:56,520 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 17:14:56,520 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 17:14:56,525 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:14:56" (1/1) ... [2024-11-18 17:14:56,531 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:14:56" (1/1) ... [2024-11-18 17:14:56,545 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 42 [2024-11-18 17:14:56,546 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 17:14:56,547 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 17:14:56,547 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 17:14:56,547 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 17:14:56,554 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:14:56" (1/1) ... [2024-11-18 17:14:56,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:14:56" (1/1) ... [2024-11-18 17:14:56,557 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:14:56" (1/1) ... [2024-11-18 17:14:56,568 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-18 17:14:56,569 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:14:56" (1/1) ... [2024-11-18 17:14:56,569 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:14:56" (1/1) ... [2024-11-18 17:14:56,572 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:14:56" (1/1) ... [2024-11-18 17:14:56,574 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:14:56" (1/1) ... [2024-11-18 17:14:56,576 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:14:56" (1/1) ... [2024-11-18 17:14:56,576 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:14:56" (1/1) ... [2024-11-18 17:14:56,579 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 17:14:56,580 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 17:14:56,581 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 17:14:56,581 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 17:14:56,582 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:14:56" (1/1) ... [2024-11-18 17:14:56,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 17:14:56,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 17:14:56,606 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-11-18 17:14:56,610 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-11-18 17:14:56,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 17:14:56,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 17:14:56,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 17:14:56,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 17:14:56,714 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 17:14:56,716 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 17:14:56,855 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-18 17:14:56,855 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 17:14:56,870 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 17:14:56,871 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 17:14:56,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:14:56 BoogieIcfgContainer [2024-11-18 17:14:56,871 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 17:14:56,873 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 17:14:56,874 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 17:14:56,877 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 17:14:56,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 05:14:56" (1/3) ... [2024-11-18 17:14:56,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b6cea11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:14:56, skipping insertion in model container [2024-11-18 17:14:56,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:14:56" (2/3) ... [2024-11-18 17:14:56,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b6cea11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:14:56, skipping insertion in model container [2024-11-18 17:14:56,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:14:56" (3/3) ... [2024-11-18 17:14:56,880 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.count4.c [2024-11-18 17:14:56,895 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 17:14:56,895 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 17:14:56,952 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 17:14:56,961 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;@4c13ed5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 17:14:56,961 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 17:14:56,965 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 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-11-18 17:14:56,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-18 17:14:56,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:14:56,972 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-18 17:14:56,974 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:14:56,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:14:56,980 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-18 17:14:56,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 17:14:56,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [395804265] [2024-11-18 17:14:56,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:14:56,992 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-11-18 17:14:56,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 17:14:56,995 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-11-18 17:14:56,996 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-11-18 17:14:57,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:14:57,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-18 17:14:57,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 17:14:57,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 17:14:57,194 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 17:14:57,195 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 17:14:57,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [395804265] [2024-11-18 17:14:57,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [395804265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 17:14:57,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 17:14:57,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 17:14:57,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377278203] [2024-11-18 17:14:57,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 17:14:57,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 17:14:57,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 17:14:57,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 17:14:57,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 17:14:57,223 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 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) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-11-18 17:14:57,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:14:57,257 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-18 17:14:57,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 17:14:57,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2024-11-18 17:14:57,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:14:57,269 INFO L225 Difference]: With dead ends: 18 [2024-11-18 17:14:57,269 INFO L226 Difference]: Without dead ends: 10 [2024-11-18 17:14:57,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 17:14:57,274 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 17:14:57,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 17:14:57,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-18 17:14:57,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-18 17:14:57,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-11-18 17:14:57,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-18 17:14:57,302 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-18 17:14:57,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:14:57,302 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-18 17:14:57,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-11-18 17:14:57,303 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-18 17:14:57,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-18 17:14:57,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:14:57,303 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-18 17:14:57,308 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-11-18 17:14:57,505 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-11-18 17:14:57,506 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:14:57,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:14:57,507 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-18 17:14:57,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 17:14:57,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1713714940] [2024-11-18 17:14:57,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:14:57,508 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-11-18 17:14:57,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 17:14:57,525 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-11-18 17:14:57,537 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-11-18 17:14:57,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:14:57,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-18 17:14:57,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 17:14:57,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 17:14:57,729 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 17:14:57,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 17:14:57,806 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 17:14:57,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1713714940] [2024-11-18 17:14:57,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1713714940] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 17:14:57,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 17:14:57,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-18 17:14:57,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864023574] [2024-11-18 17:14:57,807 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 17:14:57,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 17:14:57,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 17:14:57,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 17:14:57,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-18 17:14:57,808 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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-11-18 17:14:57,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:14:57,887 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2024-11-18 17:14:57,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-18 17:14:57,888 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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 8 [2024-11-18 17:14:57,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:14:57,888 INFO L225 Difference]: With dead ends: 18 [2024-11-18 17:14:57,892 INFO L226 Difference]: Without dead ends: 16 [2024-11-18 17:14:57,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-18 17:14:57,893 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 17:14:57,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 14 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 17:14:57,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-18 17:14:57,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2024-11-18 17:14:57,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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-11-18 17:14:57,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-11-18 17:14:57,902 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2024-11-18 17:14:57,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:14:57,902 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-18 17:14:57,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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-11-18 17:14:57,902 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-11-18 17:14:57,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-18 17:14:57,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:14:57,903 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2024-11-18 17:14:57,907 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 (3)] Ended with exit code 0 [2024-11-18 17:14:58,103 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-11-18 17:14:58,104 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:14:58,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:14:58,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1333570723, now seen corresponding path program 2 times [2024-11-18 17:14:58,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 17:14:58,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2085772361] [2024-11-18 17:14:58,109 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 17:14:58,109 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-11-18 17:14:58,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 17:14:58,112 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-11-18 17:14:58,113 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-11-18 17:14:58,153 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 17:14:58,153 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 17:14:58,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-18 17:14:58,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 17:14:58,318 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 17:14:58,318 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 17:14:58,419 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 17:14:58,419 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 17:14:58,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2085772361] [2024-11-18 17:14:58,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2085772361] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 17:14:58,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 17:14:58,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-18 17:14:58,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476780041] [2024-11-18 17:14:58,420 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 17:14:58,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-18 17:14:58,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 17:14:58,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-18 17:14:58,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-18 17:14:58,422 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 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-11-18 17:14:58,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:14:58,649 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2024-11-18 17:14:58,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-18 17:14:58,650 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 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 14 [2024-11-18 17:14:58,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:14:58,651 INFO L225 Difference]: With dead ends: 30 [2024-11-18 17:14:58,651 INFO L226 Difference]: Without dead ends: 28 [2024-11-18 17:14:58,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2024-11-18 17:14:58,652 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 10 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 17:14:58,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 26 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 17:14:58,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-18 17:14:58,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-11-18 17:14:58,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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-11-18 17:14:58,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2024-11-18 17:14:58,658 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 14 [2024-11-18 17:14:58,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:14:58,658 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2024-11-18 17:14:58,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 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-11-18 17:14:58,659 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2024-11-18 17:14:58,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-18 17:14:58,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:14:58,659 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1] [2024-11-18 17:14:58,663 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 (4)] Forceful destruction successful, exit code 0 [2024-11-18 17:14:58,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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-11-18 17:14:58,861 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:14:58,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:14:58,861 INFO L85 PathProgramCache]: Analyzing trace with hash 96933411, now seen corresponding path program 3 times [2024-11-18 17:14:58,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 17:14:58,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1202419287] [2024-11-18 17:14:58,862 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-18 17:14:58,862 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-11-18 17:14:58,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 17:14:58,865 INFO L229 MonitoredProcess]: Starting monitored process 5 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-11-18 17:14:58,866 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 (5)] Waiting until timeout for monitored process [2024-11-18 17:14:58,956 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-11-18 17:14:58,956 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 17:14:58,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-18 17:14:58,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 17:14:59,288 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 17:14:59,288 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 17:14:59,641 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 17:14:59,644 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 17:14:59,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1202419287] [2024-11-18 17:14:59,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1202419287] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 17:14:59,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 17:14:59,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2024-11-18 17:14:59,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606188220] [2024-11-18 17:14:59,645 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 17:14:59,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-18 17:14:59,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 17:14:59,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-18 17:14:59,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2024-11-18 17:14:59,646 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 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-11-18 17:15:00,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:15:00,634 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2024-11-18 17:15:00,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-18 17:15:00,635 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 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 26 [2024-11-18 17:15:00,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:15:00,636 INFO L225 Difference]: With dead ends: 54 [2024-11-18 17:15:00,636 INFO L226 Difference]: Without dead ends: 52 [2024-11-18 17:15:00,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=515, Invalid=1207, Unknown=0, NotChecked=0, Total=1722 [2024-11-18 17:15:00,637 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 16 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 17:15:00,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 41 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 17:15:00,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-18 17:15:00,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2024-11-18 17:15:00,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 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-11-18 17:15:00,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2024-11-18 17:15:00,649 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 26 [2024-11-18 17:15:00,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:15:00,650 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2024-11-18 17:15:00,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 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-11-18 17:15:00,650 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2024-11-18 17:15:00,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-18 17:15:00,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:15:00,651 INFO L215 NwaCegarLoop]: trace histogram [16, 15, 15, 1, 1, 1, 1] [2024-11-18 17:15:00,665 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 (5)] Ended with exit code 0 [2024-11-18 17:15:00,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-11-18 17:15:00,852 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:15:00,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:15:00,852 INFO L85 PathProgramCache]: Analyzing trace with hash 2084907299, now seen corresponding path program 4 times [2024-11-18 17:15:00,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 17:15:00,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [398647771] [2024-11-18 17:15:00,853 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-18 17:15:00,853 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-11-18 17:15:00,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 17:15:00,856 INFO L229 MonitoredProcess]: Starting monitored process 6 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-11-18 17:15:00,857 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 (6)] Waiting until timeout for monitored process [2024-11-18 17:15:00,945 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-18 17:15:00,946 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-18 17:15:00,946 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 17:15:00,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 17:15:01,044 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-18 17:15:01,044 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 17:15:01,045 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 17:15:01,052 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 (6)] Ended with exit code 0 [2024-11-18 17:15:01,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-11-18 17:15:01,250 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1] [2024-11-18 17:15:01,295 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 17:15:01,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 05:15:01 BoogieIcfgContainer [2024-11-18 17:15:01,301 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 17:15:01,301 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 17:15:01,301 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 17:15:01,301 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 17:15:01,302 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:14:56" (3/4) ... [2024-11-18 17:15:01,303 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-18 17:15:01,365 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-18 17:15:01,365 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 17:15:01,366 INFO L158 Benchmark]: Toolchain (without parser) took 5091.90ms. Allocated memory was 75.5MB in the beginning and 182.5MB in the end (delta: 107.0MB). Free memory was 37.2MB in the beginning and 156.2MB in the end (delta: -119.0MB). Peak memory consumption was 45.9MB. Max. memory is 16.1GB. [2024-11-18 17:15:01,366 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 75.5MB. Free memory is still 47.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 17:15:01,366 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.46ms. Allocated memory is still 75.5MB. Free memory was 37.0MB in the beginning and 45.4MB in the end (delta: -8.4MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2024-11-18 17:15:01,366 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.96ms. Allocated memory is still 75.5MB. Free memory was 45.2MB in the beginning and 43.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 17:15:01,367 INFO L158 Benchmark]: Boogie Preprocessor took 32.51ms. Allocated memory is still 75.5MB. Free memory was 43.9MB in the beginning and 42.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 17:15:01,367 INFO L158 Benchmark]: RCFGBuilder took 291.43ms. Allocated memory was 75.5MB in the beginning and 151.0MB in the end (delta: 75.5MB). Free memory was 42.0MB in the beginning and 128.3MB in the end (delta: -86.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-18 17:15:01,367 INFO L158 Benchmark]: TraceAbstraction took 4427.76ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 127.6MB in the beginning and 103.4MB in the end (delta: 24.2MB). Peak memory consumption was 54.2MB. Max. memory is 16.1GB. [2024-11-18 17:15:01,367 INFO L158 Benchmark]: Witness Printer took 64.18ms. Allocated memory is still 182.5MB. Free memory was 103.4MB in the beginning and 156.2MB in the end (delta: -52.8MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. [2024-11-18 17:15:01,388 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 75.5MB. Free memory is still 47.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 244.46ms. Allocated memory is still 75.5MB. Free memory was 37.0MB in the beginning and 45.4MB in the end (delta: -8.4MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.96ms. Allocated memory is still 75.5MB. Free memory was 45.2MB in the beginning and 43.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.51ms. Allocated memory is still 75.5MB. Free memory was 43.9MB in the beginning and 42.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 291.43ms. Allocated memory was 75.5MB in the beginning and 151.0MB in the end (delta: 75.5MB). Free memory was 42.0MB in the beginning and 128.3MB in the end (delta: -86.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4427.76ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 127.6MB in the beginning and 103.4MB in the end (delta: 24.2MB). Peak memory consumption was 54.2MB. Max. memory is 16.1GB. * Witness Printer took 64.18ms. Allocated memory is still 182.5MB. Free memory was 103.4MB in the beginning and 156.2MB in the end (delta: -52.8MB). Peak memory consumption was 5.9MB. 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 - CounterExampleResult [Line: 22]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L27] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 4); [L28] const SORT_1 msb_SORT_1 = (SORT_1)1 << (4 - 1); [L30] const SORT_9 mask_SORT_9 = (SORT_9)-1 >> (sizeof(SORT_9) * 8 - 1); [L31] const SORT_9 msb_SORT_9 = (SORT_9)1 << (1 - 1); [L33] const SORT_1 var_2 = 0; [L34] const SORT_1 var_5 = 1; [L35] const SORT_1 var_8 = mask_SORT_1; [L38] SORT_1 state_3 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L40] SORT_1 init_4_arg_1 = var_2; [L41] state_3 = init_4_arg_1 VAL [mask_SORT_1=15, state_3=0, var_5=1, var_8=15] [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND TRUE !(cond) [L22] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 34 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34 mSDsluCounter, 92 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 76 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 373 IncrementalHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 16 mSDtfsCounter, 373 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=4, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 103 NumberOfCodeBlocks, 103 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 94 ConstructedInterpolants, 0 QuantifiedInterpolants, 1761 SizeOfPredicates, 15 NumberOfNonLiveVariables, 204 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 0/188 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 proved your program to be incorrect! [2024-11-18 17:15:01,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE