./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Rrobin.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Rrobin.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 53e6dbff486f18c9e67859c6aafc8c76e31b5ebe4bc4a2fff6ca8706de37c876 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 05:15:25,388 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 05:15:25,438 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-22 05:15:25,443 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 05:15:25,444 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 05:15:25,459 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 05:15:25,460 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 05:15:25,460 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 05:15:25,461 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 05:15:25,461 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 05:15:25,461 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 05:15:25,462 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 05:15:25,462 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 05:15:25,462 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 05:15:25,462 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 05:15:25,463 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 05:15:25,463 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 05:15:25,463 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 05:15:25,464 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 05:15:25,464 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 05:15:25,467 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 05:15:25,468 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 05:15:25,468 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 05:15:25,468 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 05:15:25,468 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 05:15:25,469 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 05:15:25,469 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 05:15:25,469 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 05:15:25,469 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 05:15:25,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 05:15:25,470 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 05:15:25,470 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 05:15:25,470 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 05:15:25,470 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 05:15:25,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 05:15:25,470 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 05:15:25,470 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 05:15:25,471 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 05:15:25,471 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 05:15:25,471 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 -> 53e6dbff486f18c9e67859c6aafc8c76e31b5ebe4bc4a2fff6ca8706de37c876 [2024-11-22 05:15:25,670 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 05:15:25,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 05:15:25,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 05:15:25,694 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 05:15:25,695 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 05:15:25,696 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Rrobin.c [2024-11-22 05:15:26,899 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 05:15:27,045 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 05:15:27,046 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Rrobin.c [2024-11-22 05:15:27,059 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d0472e36/08f90dd39b3c4063830b26c97934fe18/FLAG8297d639d [2024-11-22 05:15:27,456 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d0472e36/08f90dd39b3c4063830b26c97934fe18 [2024-11-22 05:15:27,458 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 05:15:27,459 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 05:15:27,459 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 05:15:27,460 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 05:15:27,464 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 05:15:27,464 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 05:15:27" (1/1) ... [2024-11-22 05:15:27,465 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1751d4b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:15:27, skipping insertion in model container [2024-11-22 05:15:27,465 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 05:15:27" (1/1) ... [2024-11-22 05:15:27,485 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 05:15:27,612 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.h_Rrobin.c[1248,1261] [2024-11-22 05:15:27,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 05:15:27,677 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 05:15:27,686 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.h_Rrobin.c[1248,1261] [2024-11-22 05:15:27,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 05:15:27,743 INFO L204 MainTranslator]: Completed translation [2024-11-22 05:15:27,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:15:27 WrapperNode [2024-11-22 05:15:27,744 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 05:15:27,745 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 05:15:27,745 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 05:15:27,745 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 05:15:27,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:15:27" (1/1) ... [2024-11-22 05:15:27,759 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:15:27" (1/1) ... [2024-11-22 05:15:27,827 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 394 [2024-11-22 05:15:27,827 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 05:15:27,828 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 05:15:27,832 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 05:15:27,832 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 05:15:27,852 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:15:27" (1/1) ... [2024-11-22 05:15:27,852 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:15:27" (1/1) ... [2024-11-22 05:15:27,875 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:15:27" (1/1) ... [2024-11-22 05:15:27,903 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-22 05:15:27,907 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:15:27" (1/1) ... [2024-11-22 05:15:27,907 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:15:27" (1/1) ... [2024-11-22 05:15:27,925 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:15:27" (1/1) ... [2024-11-22 05:15:27,931 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:15:27" (1/1) ... [2024-11-22 05:15:27,943 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:15:27" (1/1) ... [2024-11-22 05:15:27,946 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:15:27" (1/1) ... [2024-11-22 05:15:27,955 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 05:15:27,956 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 05:15:27,957 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 05:15:27,957 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 05:15:27,957 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:15:27" (1/1) ... [2024-11-22 05:15:27,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 05:15:27,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 05:15:27,988 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-22 05:15:27,990 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-22 05:15:28,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 05:15:28,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 05:15:28,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 05:15:28,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 05:15:28,108 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 05:15:28,110 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 05:15:28,530 INFO L? ?]: Removed 208 outVars from TransFormulas that were not future-live. [2024-11-22 05:15:28,530 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 05:15:28,541 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 05:15:28,541 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 05:15:28,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:15:28 BoogieIcfgContainer [2024-11-22 05:15:28,542 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 05:15:28,543 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 05:15:28,545 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 05:15:28,547 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 05:15:28,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 05:15:27" (1/3) ... [2024-11-22 05:15:28,548 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dcb0b42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 05:15:28, skipping insertion in model container [2024-11-22 05:15:28,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:15:27" (2/3) ... [2024-11-22 05:15:28,548 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dcb0b42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 05:15:28, skipping insertion in model container [2024-11-22 05:15:28,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:15:28" (3/3) ... [2024-11-22 05:15:28,549 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_Rrobin.c [2024-11-22 05:15:28,562 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 05:15:28,562 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 05:15:28,605 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 05:15:28,611 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;@1e1fafd2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 05:15:28,611 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 05:15:28,614 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 96 states have (on average 1.4895833333333333) internal successors, (143), 97 states have internal predecessors, (143), 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-22 05:15:28,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-22 05:15:28,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:15:28,620 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 05:15:28,620 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:15:28,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:15:28,624 INFO L85 PathProgramCache]: Analyzing trace with hash -11435034, now seen corresponding path program 1 times [2024-11-22 05:15:28,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 05:15:28,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756808292] [2024-11-22 05:15:28,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:15:28,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 05:15:28,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:15:29,067 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-22 05:15:29,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 05:15:29,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756808292] [2024-11-22 05:15:29,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756808292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 05:15:29,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 05:15:29,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 05:15:29,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945222400] [2024-11-22 05:15:29,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 05:15:29,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 05:15:29,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 05:15:29,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 05:15:29,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 05:15:29,095 INFO L87 Difference]: Start difference. First operand has 98 states, 96 states have (on average 1.4895833333333333) internal successors, (143), 97 states have internal predecessors, (143), 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 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-22 05:15:29,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:15:29,139 INFO L93 Difference]: Finished difference Result 173 states and 255 transitions. [2024-11-22 05:15:29,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 05:15:29,141 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 25 [2024-11-22 05:15:29,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:15:29,149 INFO L225 Difference]: With dead ends: 173 [2024-11-22 05:15:29,149 INFO L226 Difference]: Without dead ends: 97 [2024-11-22 05:15:29,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 05:15:29,154 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 05:15:29,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 405 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 05:15:29,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-22 05:15:29,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-22 05:15:29,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.46875) internal successors, (141), 96 states have internal predecessors, (141), 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-22 05:15:29,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 141 transitions. [2024-11-22 05:15:29,186 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 141 transitions. Word has length 25 [2024-11-22 05:15:29,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:15:29,187 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 141 transitions. [2024-11-22 05:15:29,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-22 05:15:29,187 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 141 transitions. [2024-11-22 05:15:29,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-22 05:15:29,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:15:29,188 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 05:15:29,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 05:15:29,188 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:15:29,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:15:29,189 INFO L85 PathProgramCache]: Analyzing trace with hash -352790771, now seen corresponding path program 1 times [2024-11-22 05:15:29,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 05:15:29,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719852182] [2024-11-22 05:15:29,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:15:29,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 05:15:29,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:15:29,291 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-22 05:15:29,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 05:15:29,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719852182] [2024-11-22 05:15:29,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719852182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 05:15:29,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 05:15:29,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 05:15:29,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760701352] [2024-11-22 05:15:29,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 05:15:29,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 05:15:29,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 05:15:29,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 05:15:29,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 05:15:29,296 INFO L87 Difference]: Start difference. First operand 97 states and 141 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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-22 05:15:29,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:15:29,322 INFO L93 Difference]: Finished difference Result 174 states and 253 transitions. [2024-11-22 05:15:29,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 05:15:29,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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 26 [2024-11-22 05:15:29,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:15:29,323 INFO L225 Difference]: With dead ends: 174 [2024-11-22 05:15:29,324 INFO L226 Difference]: Without dead ends: 99 [2024-11-22 05:15:29,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 05:15:29,325 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 05:15:29,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 401 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 05:15:29,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-22 05:15:29,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-22 05:15:29,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.4591836734693877) internal successors, (143), 98 states have internal predecessors, (143), 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-22 05:15:29,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 143 transitions. [2024-11-22 05:15:29,333 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 143 transitions. Word has length 26 [2024-11-22 05:15:29,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:15:29,333 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 143 transitions. [2024-11-22 05:15:29,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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-22 05:15:29,334 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 143 transitions. [2024-11-22 05:15:29,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-22 05:15:29,334 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:15:29,334 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 05:15:29,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 05:15:29,335 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:15:29,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:15:29,335 INFO L85 PathProgramCache]: Analyzing trace with hash 850422175, now seen corresponding path program 1 times [2024-11-22 05:15:29,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 05:15:29,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553440614] [2024-11-22 05:15:29,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:15:29,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 05:15:29,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:15:29,589 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-22 05:15:29,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 05:15:29,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553440614] [2024-11-22 05:15:29,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553440614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 05:15:29,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 05:15:29,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 05:15:29,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247196524] [2024-11-22 05:15:29,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 05:15:29,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 05:15:29,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 05:15:29,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 05:15:29,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 05:15:29,592 INFO L87 Difference]: Start difference. First operand 99 states and 143 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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-22 05:15:29,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:15:29,671 INFO L93 Difference]: Finished difference Result 180 states and 260 transitions. [2024-11-22 05:15:29,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 05:15:29,672 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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) Word has length 27 [2024-11-22 05:15:29,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:15:29,673 INFO L225 Difference]: With dead ends: 180 [2024-11-22 05:15:29,673 INFO L226 Difference]: Without dead ends: 103 [2024-11-22 05:15:29,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-22 05:15:29,674 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 128 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 05:15:29,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 503 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 05:15:29,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-22 05:15:29,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2024-11-22 05:15:29,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 1.4455445544554455) internal successors, (146), 101 states have internal predecessors, (146), 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-22 05:15:29,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 146 transitions. [2024-11-22 05:15:29,680 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 146 transitions. Word has length 27 [2024-11-22 05:15:29,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:15:29,680 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 146 transitions. [2024-11-22 05:15:29,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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-22 05:15:29,680 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 146 transitions. [2024-11-22 05:15:29,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-22 05:15:29,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:15:29,681 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 05:15:29,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 05:15:29,681 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:15:29,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:15:29,682 INFO L85 PathProgramCache]: Analyzing trace with hash -2137138416, now seen corresponding path program 1 times [2024-11-22 05:15:29,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 05:15:29,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637070752] [2024-11-22 05:15:29,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:15:29,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 05:15:29,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 05:15:29,716 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 05:15:29,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 05:15:29,767 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 05:15:29,767 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 05:15:29,769 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 05:15:29,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 05:15:29,772 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-22 05:15:29,799 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 05:15:29,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 05:15:29 BoogieIcfgContainer [2024-11-22 05:15:29,803 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 05:15:29,804 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 05:15:29,804 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 05:15:29,804 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 05:15:29,805 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:15:28" (3/4) ... [2024-11-22 05:15:29,808 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 05:15:29,809 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 05:15:29,809 INFO L158 Benchmark]: Toolchain (without parser) took 2350.71ms. Allocated memory is still 163.6MB. Free memory was 95.7MB in the beginning and 57.2MB in the end (delta: 38.6MB). Peak memory consumption was 39.3MB. Max. memory is 16.1GB. [2024-11-22 05:15:29,810 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 113.2MB. Free memory was 75.7MB in the beginning and 75.6MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 05:15:29,811 INFO L158 Benchmark]: CACSL2BoogieTranslator took 284.60ms. Allocated memory is still 163.6MB. Free memory was 95.5MB in the beginning and 78.0MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-22 05:15:29,813 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.73ms. Allocated memory is still 163.6MB. Free memory was 78.0MB in the beginning and 133.6MB in the end (delta: -55.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-22 05:15:29,813 INFO L158 Benchmark]: Boogie Preprocessor took 127.10ms. Allocated memory is still 163.6MB. Free memory was 133.6MB in the beginning and 127.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-22 05:15:29,813 INFO L158 Benchmark]: RCFGBuilder took 585.52ms. Allocated memory is still 163.6MB. Free memory was 127.3MB in the beginning and 77.0MB in the end (delta: 50.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-11-22 05:15:29,813 INFO L158 Benchmark]: TraceAbstraction took 1260.04ms. Allocated memory is still 163.6MB. Free memory was 76.4MB in the beginning and 58.2MB in the end (delta: 18.2MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. [2024-11-22 05:15:29,813 INFO L158 Benchmark]: Witness Printer took 5.10ms. Allocated memory is still 163.6MB. Free memory is still 57.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 05:15:29,814 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.15ms. Allocated memory is still 113.2MB. Free memory was 75.7MB in the beginning and 75.6MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 284.60ms. Allocated memory is still 163.6MB. Free memory was 95.5MB in the beginning and 78.0MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.73ms. Allocated memory is still 163.6MB. Free memory was 78.0MB in the beginning and 133.6MB in the end (delta: -55.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 127.10ms. Allocated memory is still 163.6MB. Free memory was 133.6MB in the beginning and 127.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 585.52ms. Allocated memory is still 163.6MB. Free memory was 127.3MB in the beginning and 77.0MB in the end (delta: 50.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 1260.04ms. Allocated memory is still 163.6MB. Free memory was 76.4MB in the beginning and 58.2MB in the end (delta: 18.2MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. * Witness Printer took 5.10ms. Allocated memory is still 163.6MB. Free memory is still 57.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 90. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_8 mask_SORT_8 = (SORT_8)-1 >> (sizeof(SORT_8) * 8 - 32); [L30] const SORT_8 msb_SORT_8 = (SORT_8)1 << (32 - 1); [L32] const SORT_1 var_5 = 0; [L33] const SORT_8 var_10 = 0; [L34] const SORT_1 var_19 = 1; [L36] SORT_1 input_2; [L37] SORT_1 input_3; [L38] SORT_1 input_4; [L39] SORT_1 input_34; [L40] SORT_1 input_37; [L41] SORT_1 input_41; [L42] SORT_1 input_50; [L43] SORT_1 input_53; [L44] SORT_1 input_57; [L46] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_10=0, var_19=1, var_5=0] [L46] SORT_1 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L47] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_10=0, var_19=1, var_5=0] [L47] SORT_1 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L48] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_10=0, var_19=1, var_5=0] [L48] SORT_1 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L49] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, state_24=0, var_10=0, var_19=1, var_5=0] [L49] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L50] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, state_24=0, state_25=0, var_10=0, var_19=1, var_5=0] [L50] SORT_1 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L52] SORT_1 init_7_arg_1 = var_5; [L53] state_6 = init_7_arg_1 [L54] SORT_1 init_13_arg_1 = var_5; [L55] state_12 = init_13_arg_1 [L56] SORT_1 init_27_arg_1 = var_5; [L57] state_26 = init_27_arg_1 VAL [mask_SORT_1=1, state_12=0, state_24=0, state_25=0, state_26=0, state_6=0, var_10=0, var_19=1, var_5=0] [L60] input_2 = __VERIFIER_nondet_uchar() [L61] input_3 = __VERIFIER_nondet_uchar() [L62] input_4 = __VERIFIER_nondet_uchar() [L63] input_34 = __VERIFIER_nondet_uchar() [L64] input_37 = __VERIFIER_nondet_uchar() [L65] input_41 = __VERIFIER_nondet_uchar() [L66] input_50 = __VERIFIER_nondet_uchar() [L67] input_53 = __VERIFIER_nondet_uchar() [L68] input_57 = __VERIFIER_nondet_uchar() [L71] SORT_1 var_9_arg_0 = state_6; VAL [mask_SORT_1=1, state_12=0, state_24=0, state_25=0, state_26=0, state_6=0, var_10=0, var_19=1, var_5=0, var_9_arg_0=0] [L72] EXPR var_9_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, state_12=0, state_24=0, state_25=0, state_26=0, state_6=0, var_10=0, var_19=1, var_5=0] [L72] var_9_arg_0 = var_9_arg_0 & mask_SORT_1 [L73] SORT_8 var_9 = var_9_arg_0; [L74] SORT_8 var_11_arg_0 = var_9; [L75] SORT_8 var_11_arg_1 = var_10; [L76] SORT_1 var_11 = var_11_arg_0 == var_11_arg_1; [L77] SORT_1 var_14_arg_0 = state_12; VAL [mask_SORT_1=1, state_12=0, state_24=0, state_25=0, state_26=0, state_6=0, var_10=0, var_11=1, var_14_arg_0=0, var_19=1, var_5=0] [L78] EXPR var_14_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, state_12=0, state_24=0, state_25=0, state_26=0, state_6=0, var_10=0, var_11=1, var_19=1, var_5=0] [L78] var_14_arg_0 = var_14_arg_0 & mask_SORT_1 [L79] SORT_8 var_14 = var_14_arg_0; [L80] SORT_8 var_15_arg_0 = var_14; [L81] SORT_8 var_15_arg_1 = var_10; [L82] SORT_1 var_15 = var_15_arg_0 == var_15_arg_1; [L83] SORT_1 var_16_arg_0 = var_11; [L84] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, state_12=0, state_24=0, state_25=0, state_26=0, state_6=0, var_10=0, var_16_arg_0=1, var_16_arg_1=1, var_19=1, var_5=0] [L85] EXPR var_16_arg_0 | var_16_arg_1 VAL [mask_SORT_1=1, state_12=0, state_24=0, state_25=0, state_26=0, state_6=0, var_10=0, var_19=1, var_5=0] [L85] SORT_1 var_16 = var_16_arg_0 | var_16_arg_1; [L86] SORT_1 var_20_arg_0 = var_16; [L87] SORT_1 var_20 = ~var_20_arg_0; [L88] SORT_1 var_21_arg_0 = var_19; [L89] SORT_1 var_21_arg_1 = var_20; VAL [mask_SORT_1=1, state_12=0, state_24=0, state_25=0, state_26=0, state_6=0, var_10=0, var_19=1, var_21_arg_0=1, var_21_arg_1=-2, var_5=0] [L90] EXPR var_21_arg_0 & var_21_arg_1 VAL [mask_SORT_1=1, state_12=0, state_24=0, state_25=0, state_26=0, state_6=0, var_10=0, var_19=1, var_5=0] [L90] SORT_1 var_21 = var_21_arg_0 & var_21_arg_1; [L91] EXPR var_21 & mask_SORT_1 VAL [mask_SORT_1=1, state_12=0, state_24=0, state_25=0, state_26=0, state_6=0, var_10=0, var_19=1, var_5=0] [L91] var_21 = var_21 & mask_SORT_1 [L92] SORT_1 bad_22_arg_0 = var_21; [L93] CALL __VERIFIER_assert(!(bad_22_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 98 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 128 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 128 mSDsluCounter, 1309 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 907 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 74 IncrementalHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 402 mSDtfsCounter, 74 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=3, InterpolantAutomatonStates: 14, 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, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 106 NumberOfCodeBlocks, 106 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 151 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-22 05:15:29,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Rrobin.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 53e6dbff486f18c9e67859c6aafc8c76e31b5ebe4bc4a2fff6ca8706de37c876 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 05:15:31,577 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 05:15:31,644 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-22 05:15:31,650 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 05:15:31,650 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 05:15:31,673 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 05:15:31,676 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 05:15:31,676 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 05:15:31,677 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 05:15:31,678 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 05:15:31,679 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 05:15:31,679 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 05:15:31,679 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 05:15:31,680 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 05:15:31,680 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 05:15:31,683 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 05:15:31,683 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 05:15:31,683 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 05:15:31,683 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 05:15:31,683 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 05:15:31,684 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 05:15:31,684 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 05:15:31,684 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 05:15:31,684 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 05:15:31,685 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 05:15:31,685 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 05:15:31,685 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 05:15:31,686 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 05:15:31,686 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 05:15:31,686 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 05:15:31,687 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 05:15:31,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 05:15:31,687 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 05:15:31,688 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 05:15:31,688 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 05:15:31,688 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 05:15:31,689 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 05:15:31,689 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 05:15:31,689 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 05:15:31,689 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 05:15:31,690 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 05:15:31,690 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 -> 53e6dbff486f18c9e67859c6aafc8c76e31b5ebe4bc4a2fff6ca8706de37c876 [2024-11-22 05:15:31,948 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 05:15:31,966 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 05:15:31,969 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 05:15:31,970 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 05:15:31,970 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 05:15:31,971 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Rrobin.c [2024-11-22 05:15:33,224 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 05:15:33,406 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 05:15:33,407 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Rrobin.c [2024-11-22 05:15:33,417 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f554d6cbf/874eb21587af48de8ac72216f49d4f83/FLAG9bb2910f3 [2024-11-22 05:15:33,431 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f554d6cbf/874eb21587af48de8ac72216f49d4f83 [2024-11-22 05:15:33,434 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 05:15:33,435 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 05:15:33,437 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 05:15:33,437 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 05:15:33,441 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 05:15:33,442 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 05:15:33" (1/1) ... [2024-11-22 05:15:33,443 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17119a9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:15:33, skipping insertion in model container [2024-11-22 05:15:33,443 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 05:15:33" (1/1) ... [2024-11-22 05:15:33,468 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 05:15:33,608 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.h_Rrobin.c[1248,1261] [2024-11-22 05:15:33,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 05:15:33,683 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 05:15:33,693 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.h_Rrobin.c[1248,1261] [2024-11-22 05:15:33,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 05:15:33,730 INFO L204 MainTranslator]: Completed translation [2024-11-22 05:15:33,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:15:33 WrapperNode [2024-11-22 05:15:33,730 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 05:15:33,731 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 05:15:33,731 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 05:15:33,731 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 05:15:33,736 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:15:33" (1/1) ... [2024-11-22 05:15:33,744 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:15:33" (1/1) ... [2024-11-22 05:15:33,766 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 218 [2024-11-22 05:15:33,766 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 05:15:33,767 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 05:15:33,767 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 05:15:33,767 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 05:15:33,774 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:15:33" (1/1) ... [2024-11-22 05:15:33,774 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:15:33" (1/1) ... [2024-11-22 05:15:33,778 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:15:33" (1/1) ... [2024-11-22 05:15:33,795 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-22 05:15:33,795 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:15:33" (1/1) ... [2024-11-22 05:15:33,795 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:15:33" (1/1) ... [2024-11-22 05:15:33,808 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:15:33" (1/1) ... [2024-11-22 05:15:33,810 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:15:33" (1/1) ... [2024-11-22 05:15:33,814 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:15:33" (1/1) ... [2024-11-22 05:15:33,815 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:15:33" (1/1) ... [2024-11-22 05:15:33,817 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 05:15:33,821 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 05:15:33,822 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 05:15:33,822 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 05:15:33,822 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:15:33" (1/1) ... [2024-11-22 05:15:33,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 05:15:33,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 05:15:33,856 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-22 05:15:33,858 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-22 05:15:33,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 05:15:33,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 05:15:33,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 05:15:33,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 05:15:33,972 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 05:15:33,973 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 05:15:34,198 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2024-11-22 05:15:34,198 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 05:15:34,210 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 05:15:34,210 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 05:15:34,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:15:34 BoogieIcfgContainer [2024-11-22 05:15:34,211 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 05:15:34,214 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 05:15:34,214 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 05:15:34,216 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 05:15:34,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 05:15:33" (1/3) ... [2024-11-22 05:15:34,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b5d5a33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 05:15:34, skipping insertion in model container [2024-11-22 05:15:34,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:15:33" (2/3) ... [2024-11-22 05:15:34,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b5d5a33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 05:15:34, skipping insertion in model container [2024-11-22 05:15:34,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:15:34" (3/3) ... [2024-11-22 05:15:34,219 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_Rrobin.c [2024-11-22 05:15:34,232 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 05:15:34,232 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 05:15:34,277 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 05:15:34,281 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;@69902139, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 05:15:34,281 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 05:15:34,284 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-22 05:15:34,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-22 05:15:34,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:15:34,288 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-22 05:15:34,288 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:15:34,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:15:34,294 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-22 05:15:34,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 05:15:34,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2071850136] [2024-11-22 05:15:34,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:15:34,303 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-22 05:15:34,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 05:15:34,306 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-22 05:15:34,307 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-22 05:15:34,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:15:34,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-22 05:15:34,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 05:15:34,577 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-22 05:15:34,577 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 05:15:34,577 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 05:15:34,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2071850136] [2024-11-22 05:15:34,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2071850136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 05:15:34,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 05:15:34,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 05:15:34,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953951604] [2024-11-22 05:15:34,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 05:15:34,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 05:15:34,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 05:15:34,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 05:15:34,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 05:15:34,600 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-22 05:15:34,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:15:34,637 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-22 05:15:34,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 05:15:34,639 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-22 05:15:34,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:15:34,644 INFO L225 Difference]: With dead ends: 18 [2024-11-22 05:15:34,645 INFO L226 Difference]: Without dead ends: 10 [2024-11-22 05:15:34,647 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-22 05:15:34,651 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-22 05:15:34,652 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-22 05:15:34,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-22 05:15:34,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-22 05:15:34,672 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-22 05:15:34,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-22 05:15:34,674 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-22 05:15:34,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:15:34,674 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-22 05:15:34,674 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-22 05:15:34,675 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-22 05:15:34,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-22 05:15:34,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:15:34,675 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-22 05:15:34,679 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-22 05:15:34,876 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-22 05:15:34,877 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:15:34,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:15:34,877 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-22 05:15:34,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 05:15:34,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2003205391] [2024-11-22 05:15:34,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:15:34,878 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-22 05:15:34,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 05:15:34,880 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-22 05:15:34,881 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-22 05:15:34,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:15:34,965 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-22 05:15:34,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 05:15:35,558 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-22 05:15:35,559 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 05:15:37,999 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-22 05:15:38,000 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 05:15:38,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2003205391] [2024-11-22 05:15:38,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2003205391] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 05:15:38,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 05:15:38,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-22 05:15:38,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580113445] [2024-11-22 05:15:38,001 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 05:15:38,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 05:15:38,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 05:15:38,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 05:15:38,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-22 05:15:38,003 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-22 05:15:39,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:15:39,224 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2024-11-22 05:15:39,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 05:15:39,225 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-22 05:15:39,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:15:39,225 INFO L225 Difference]: With dead ends: 21 [2024-11-22 05:15:39,225 INFO L226 Difference]: Without dead ends: 19 [2024-11-22 05:15:39,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2024-11-22 05:15:39,226 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 8 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 05:15:39,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 14 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 05:15:39,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-22 05:15:39,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2024-11-22 05:15:39,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 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-22 05:15:39,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2024-11-22 05:15:39,231 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 8 [2024-11-22 05:15:39,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:15:39,231 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2024-11-22 05:15:39,231 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-22 05:15:39,231 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2024-11-22 05:15:39,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-22 05:15:39,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:15:39,232 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1] [2024-11-22 05:15:39,235 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-22 05:15:39,434 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-22 05:15:39,435 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:15:39,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:15:39,435 INFO L85 PathProgramCache]: Analyzing trace with hash -37306491, now seen corresponding path program 2 times [2024-11-22 05:15:39,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 05:15:39,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1948924421] [2024-11-22 05:15:39,436 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 05:15:39,436 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-22 05:15:39,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 05:15:39,439 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-22 05:15:39,440 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-22 05:15:39,581 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 05:15:39,581 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 05:15:39,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-22 05:15:39,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 05:15:40,124 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-22 05:15:40,124 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 05:15:43,836 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-22 05:15:43,836 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 05:15:43,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1948924421] [2024-11-22 05:15:43,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1948924421] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 05:15:43,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 05:15:43,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-22 05:15:43,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118503048] [2024-11-22 05:15:43,837 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 05:15:43,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 05:15:43,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 05:15:43,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 05:15:43,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-22 05:15:43,839 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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-22 05:15:43,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:15:43,913 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2024-11-22 05:15:43,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 05:15:43,914 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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 17 [2024-11-22 05:15:43,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:15:43,914 INFO L225 Difference]: With dead ends: 18 [2024-11-22 05:15:43,914 INFO L226 Difference]: Without dead ends: 0 [2024-11-22 05:15:43,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-22 05:15:43,915 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 05:15:43,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 9 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 05:15:43,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-22 05:15:43,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-22 05:15:43,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-22 05:15:43,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-22 05:15:43,917 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2024-11-22 05:15:43,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:15:43,917 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-22 05:15:43,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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-22 05:15:43,917 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-22 05:15:43,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-22 05:15:43,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 05:15:43,924 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 (4)] Ended with exit code 0 [2024-11-22 05:15:44,120 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-22 05:15:44,123 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1] [2024-11-22 05:15:44,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-22 05:15:44,769 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 05:15:44,777 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-22 05:15:44,778 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-22 05:15:44,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 05:15:44 BoogieIcfgContainer [2024-11-22 05:15:44,781 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 05:15:44,781 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 05:15:44,781 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 05:15:44,782 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 05:15:44,782 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:15:34" (3/4) ... [2024-11-22 05:15:44,784 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-22 05:15:44,790 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-22 05:15:44,790 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-22 05:15:44,791 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-22 05:15:44,791 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-22 05:15:44,874 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-22 05:15:44,874 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-22 05:15:44,874 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 05:15:44,875 INFO L158 Benchmark]: Toolchain (without parser) took 11439.33ms. Allocated memory was 67.1MB in the beginning and 408.9MB in the end (delta: 341.8MB). Free memory was 40.2MB in the beginning and 258.5MB in the end (delta: -218.3MB). Peak memory consumption was 122.8MB. Max. memory is 16.1GB. [2024-11-22 05:15:44,875 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 48.2MB. Free memory was 29.0MB in the beginning and 28.9MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 05:15:44,875 INFO L158 Benchmark]: CACSL2BoogieTranslator took 293.88ms. Allocated memory is still 67.1MB. Free memory was 39.9MB in the beginning and 42.5MB in the end (delta: -2.6MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2024-11-22 05:15:44,875 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.87ms. Allocated memory is still 67.1MB. Free memory was 42.5MB in the beginning and 39.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 05:15:44,875 INFO L158 Benchmark]: Boogie Preprocessor took 50.27ms. Allocated memory is still 67.1MB. Free memory was 39.9MB in the beginning and 36.9MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 05:15:44,875 INFO L158 Benchmark]: RCFGBuilder took 389.25ms. Allocated memory is still 67.1MB. Free memory was 36.8MB in the beginning and 32.6MB in the end (delta: 4.2MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2024-11-22 05:15:44,876 INFO L158 Benchmark]: TraceAbstraction took 10567.03ms. Allocated memory was 67.1MB in the beginning and 408.9MB in the end (delta: 341.8MB). Free memory was 31.8MB in the beginning and 264.8MB in the end (delta: -232.9MB). Peak memory consumption was 108.5MB. Max. memory is 16.1GB. [2024-11-22 05:15:44,876 INFO L158 Benchmark]: Witness Printer took 92.76ms. Allocated memory is still 408.9MB. Free memory was 264.8MB in the beginning and 258.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-22 05:15:44,878 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.09ms. Allocated memory is still 48.2MB. Free memory was 29.0MB in the beginning and 28.9MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 293.88ms. Allocated memory is still 67.1MB. Free memory was 39.9MB in the beginning and 42.5MB in the end (delta: -2.6MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.87ms. Allocated memory is still 67.1MB. Free memory was 42.5MB in the beginning and 39.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.27ms. Allocated memory is still 67.1MB. Free memory was 39.9MB in the beginning and 36.9MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 389.25ms. Allocated memory is still 67.1MB. Free memory was 36.8MB in the beginning and 32.6MB in the end (delta: 4.2MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10567.03ms. Allocated memory was 67.1MB in the beginning and 408.9MB in the end (delta: 341.8MB). Free memory was 31.8MB in the beginning and 264.8MB in the end (delta: -232.9MB). Peak memory consumption was 108.5MB. Max. memory is 16.1GB. * Witness Printer took 92.76ms. Allocated memory is still 408.9MB. Free memory was 264.8MB in the beginning and 258.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression * 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 - PositiveResult [Line: 21]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.9s, OverallIterations: 3, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12 mSDsluCounter, 34 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 34 IncrementalHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 10 mSDtfsCounter, 34 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=2, InterpolantAutomatonStates: 18, 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, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 30 NumberOfCodeBlocks, 30 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 50 ConstructedInterpolants, 19 QuantifiedInterpolants, 21093 SizeOfPredicates, 25 NumberOfNonLiveVariables, 285 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 36/56 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 58]: Loop Invariant Derived loop invariant: (((1 == mask_SORT_1) && (0 == var_5)) && (0 == var_10)) RESULT: Ultimate proved your program to be correct! [2024-11-22 05:15:44,899 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 Result: TRUE