./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 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.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-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 00:05:27,984 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 00:05:28,074 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-12 00:05:28,080 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 00:05:28,080 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 00:05:28,113 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 00:05:28,114 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 00:05:28,115 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 00:05:28,115 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 00:05:28,116 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 00:05:28,116 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 00:05:28,117 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 00:05:28,117 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 00:05:28,118 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 00:05:28,120 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 00:05:28,120 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 00:05:28,121 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 00:05:28,121 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 00:05:28,121 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 00:05:28,122 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 00:05:28,122 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 00:05:28,124 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 00:05:28,125 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 00:05:28,125 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 00:05:28,125 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 00:05:28,125 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 00:05:28,126 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 00:05:28,126 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 00:05:28,126 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 00:05:28,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 00:05:28,127 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 00:05:28,127 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 00:05:28,127 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 00:05:28,128 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 00:05:28,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 00:05:28,131 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 00:05:28,131 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 00:05:28,131 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 00:05:28,131 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 00:05:28,132 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-12 00:05:28,398 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 00:05:28,425 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 00:05:28,428 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 00:05:28,430 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 00:05:28,430 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 00:05:28,431 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-12 00:05:29,962 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 00:05:30,177 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 00:05:30,178 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Rrobin.c [2024-11-12 00:05:30,187 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2664db783/5cfbb6917cb7442db8c352f151e614aa/FLAGd51610d2e [2024-11-12 00:05:30,205 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2664db783/5cfbb6917cb7442db8c352f151e614aa [2024-11-12 00:05:30,208 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 00:05:30,210 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 00:05:30,211 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 00:05:30,211 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 00:05:30,221 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 00:05:30,222 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:05:30" (1/1) ... [2024-11-12 00:05:30,225 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60fb1711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:05:30, skipping insertion in model container [2024-11-12 00:05:30,225 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:05:30" (1/1) ... [2024-11-12 00:05:30,260 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 00:05:30,487 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-12 00:05:30,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 00:05:30,566 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 00:05:30,581 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-12 00:05:30,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 00:05:30,651 INFO L204 MainTranslator]: Completed translation [2024-11-12 00:05:30,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:05:30 WrapperNode [2024-11-12 00:05:30,652 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 00:05:30,653 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 00:05:30,653 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 00:05:30,653 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 00:05:30,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:05:30" (1/1) ... [2024-11-12 00:05:30,676 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:05:30" (1/1) ... [2024-11-12 00:05:30,732 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 394 [2024-11-12 00:05:30,733 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 00:05:30,733 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 00:05:30,733 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 00:05:30,734 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 00:05:30,745 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:05:30" (1/1) ... [2024-11-12 00:05:30,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:05:30" (1/1) ... [2024-11-12 00:05:30,756 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:05:30" (1/1) ... [2024-11-12 00:05:30,787 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-12 00:05:30,787 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:05:30" (1/1) ... [2024-11-12 00:05:30,788 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:05:30" (1/1) ... [2024-11-12 00:05:30,807 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:05:30" (1/1) ... [2024-11-12 00:05:30,815 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:05:30" (1/1) ... [2024-11-12 00:05:30,824 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:05:30" (1/1) ... [2024-11-12 00:05:30,837 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:05:30" (1/1) ... [2024-11-12 00:05:30,851 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 00:05:30,853 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 00:05:30,853 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 00:05:30,853 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 00:05:30,854 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:05:30" (1/1) ... [2024-11-12 00:05:30,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 00:05:30,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 00:05:30,894 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-12 00:05:30,898 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-12 00:05:30,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 00:05:30,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 00:05:30,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 00:05:30,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 00:05:31,056 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 00:05:31,058 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 00:05:31,731 INFO L? ?]: Removed 208 outVars from TransFormulas that were not future-live. [2024-11-12 00:05:31,732 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 00:05:31,749 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 00:05:31,750 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 00:05:31,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:05:31 BoogieIcfgContainer [2024-11-12 00:05:31,752 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 00:05:31,754 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 00:05:31,755 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 00:05:31,759 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 00:05:31,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:05:30" (1/3) ... [2024-11-12 00:05:31,759 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cf9afba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:05:31, skipping insertion in model container [2024-11-12 00:05:31,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:05:30" (2/3) ... [2024-11-12 00:05:31,760 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cf9afba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:05:31, skipping insertion in model container [2024-11-12 00:05:31,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:05:31" (3/3) ... [2024-11-12 00:05:31,762 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_Rrobin.c [2024-11-12 00:05:31,779 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 00:05:31,780 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 00:05:31,837 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 00:05:31,844 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;@45d74e94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 00:05:31,845 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 00:05:31,851 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-12 00:05:31,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-12 00:05:31,858 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:05:31,858 INFO L218 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-12 00:05:31,859 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:05:31,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:05:31,865 INFO L85 PathProgramCache]: Analyzing trace with hash -11435034, now seen corresponding path program 1 times [2024-11-12 00:05:31,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:05:31,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865500896] [2024-11-12 00:05:31,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:05:31,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:05:32,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:05:32,603 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-12 00:05:32,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:05:32,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865500896] [2024-11-12 00:05:32,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865500896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:05:32,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:05:32,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 00:05:32,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960417056] [2024-11-12 00:05:32,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:05:32,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 00:05:32,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:05:32,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 00:05:32,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:05:32,640 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-12 00:05:32,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:05:32,694 INFO L93 Difference]: Finished difference Result 173 states and 255 transitions. [2024-11-12 00:05:32,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:05:32,698 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-12 00:05:32,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:05:32,708 INFO L225 Difference]: With dead ends: 173 [2024-11-12 00:05:32,709 INFO L226 Difference]: Without dead ends: 97 [2024-11-12 00:05:32,712 INFO L434 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-12 00:05:32,716 INFO L435 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-12 00:05:32,717 INFO L436 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-12 00:05:32,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-12 00:05:32,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-12 00:05:32,750 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-12 00:05:32,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 141 transitions. [2024-11-12 00:05:32,756 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 141 transitions. Word has length 25 [2024-11-12 00:05:32,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:05:32,757 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 141 transitions. [2024-11-12 00:05:32,757 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-12 00:05:32,757 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 141 transitions. [2024-11-12 00:05:32,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-12 00:05:32,758 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:05:32,758 INFO L218 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-12 00:05:32,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 00:05:32,759 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:05:32,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:05:32,761 INFO L85 PathProgramCache]: Analyzing trace with hash -352790771, now seen corresponding path program 1 times [2024-11-12 00:05:32,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:05:32,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158964802] [2024-11-12 00:05:32,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:05:32,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:05:32,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:05:32,913 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-12 00:05:32,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:05:32,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158964802] [2024-11-12 00:05:32,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158964802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:05:32,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:05:32,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 00:05:32,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573281642] [2024-11-12 00:05:32,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:05:32,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 00:05:32,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:05:32,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 00:05:32,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:05:32,921 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-12 00:05:32,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:05:32,966 INFO L93 Difference]: Finished difference Result 174 states and 253 transitions. [2024-11-12 00:05:32,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:05:32,966 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-12 00:05:32,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:05:32,968 INFO L225 Difference]: With dead ends: 174 [2024-11-12 00:05:32,968 INFO L226 Difference]: Without dead ends: 99 [2024-11-12 00:05:32,969 INFO L434 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-12 00:05:32,970 INFO L435 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-12 00:05:32,972 INFO L436 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-12 00:05:32,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-12 00:05:32,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-12 00:05:32,983 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-12 00:05:32,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 143 transitions. [2024-11-12 00:05:32,987 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 143 transitions. Word has length 26 [2024-11-12 00:05:32,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:05:32,987 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 143 transitions. [2024-11-12 00:05:32,987 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-12 00:05:32,988 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 143 transitions. [2024-11-12 00:05:32,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-12 00:05:32,989 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:05:32,989 INFO L218 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-12 00:05:32,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 00:05:32,989 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:05:32,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:05:32,990 INFO L85 PathProgramCache]: Analyzing trace with hash 850422175, now seen corresponding path program 1 times [2024-11-12 00:05:32,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:05:32,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856231068] [2024-11-12 00:05:32,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:05:32,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:05:33,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:05:33,345 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-12 00:05:33,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:05:33,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856231068] [2024-11-12 00:05:33,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856231068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:05:33,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:05:33,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 00:05:33,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017964716] [2024-11-12 00:05:33,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:05:33,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 00:05:33,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:05:33,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 00:05:33,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 00:05:33,353 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-12 00:05:33,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:05:33,447 INFO L93 Difference]: Finished difference Result 180 states and 260 transitions. [2024-11-12 00:05:33,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 00:05:33,448 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-12 00:05:33,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:05:33,449 INFO L225 Difference]: With dead ends: 180 [2024-11-12 00:05:33,449 INFO L226 Difference]: Without dead ends: 103 [2024-11-12 00:05:33,450 INFO L434 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-12 00:05:33,451 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 128 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-12 00:05:33,454 INFO L436 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-12 00:05:33,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-12 00:05:33,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2024-11-12 00:05:33,465 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-12 00:05:33,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 146 transitions. [2024-11-12 00:05:33,468 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 146 transitions. Word has length 27 [2024-11-12 00:05:33,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:05:33,468 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 146 transitions. [2024-11-12 00:05:33,468 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-12 00:05:33,471 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 146 transitions. [2024-11-12 00:05:33,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-12 00:05:33,472 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:05:33,472 INFO L218 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-12 00:05:33,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 00:05:33,472 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:05:33,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:05:33,473 INFO L85 PathProgramCache]: Analyzing trace with hash -2137138416, now seen corresponding path program 1 times [2024-11-12 00:05:33,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:05:33,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430358250] [2024-11-12 00:05:33,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:05:33,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:05:33,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 00:05:33,521 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 00:05:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 00:05:33,593 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 00:05:33,594 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 00:05:33,595 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 00:05:33,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 00:05:33,601 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-12 00:05:33,636 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 00:05:33,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 12:05:33 BoogieIcfgContainer [2024-11-12 00:05:33,645 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 00:05:33,645 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 00:05:33,646 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 00:05:33,646 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 00:05:33,646 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:05:31" (3/4) ... [2024-11-12 00:05:33,651 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 00:05:33,652 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 00:05:33,653 INFO L158 Benchmark]: Toolchain (without parser) took 3443.22ms. Allocated memory was 130.0MB in the beginning and 201.3MB in the end (delta: 71.3MB). Free memory was 60.0MB in the beginning and 138.8MB in the end (delta: -78.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 00:05:33,653 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 130.0MB. Free memory was 89.6MB in the beginning and 89.5MB in the end (delta: 156.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 00:05:33,654 INFO L158 Benchmark]: CACSL2BoogieTranslator took 440.97ms. Allocated memory was 130.0MB in the beginning and 201.3MB in the end (delta: 71.3MB). Free memory was 59.8MB in the beginning and 163.3MB in the end (delta: -103.6MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2024-11-12 00:05:33,654 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.96ms. Allocated memory is still 201.3MB. Free memory was 163.3MB in the beginning and 153.9MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-12 00:05:33,654 INFO L158 Benchmark]: Boogie Preprocessor took 118.26ms. Allocated memory is still 201.3MB. Free memory was 153.9MB in the beginning and 148.7MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 00:05:33,655 INFO L158 Benchmark]: RCFGBuilder took 899.16ms. Allocated memory is still 201.3MB. Free memory was 148.7MB in the beginning and 96.2MB in the end (delta: 52.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-11-12 00:05:33,655 INFO L158 Benchmark]: TraceAbstraction took 1890.99ms. Allocated memory is still 201.3MB. Free memory was 95.2MB in the beginning and 138.8MB in the end (delta: -43.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 00:05:33,655 INFO L158 Benchmark]: Witness Printer took 6.98ms. Allocated memory is still 201.3MB. Free memory is still 138.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 00:05:33,658 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.21ms. Allocated memory is still 130.0MB. Free memory was 89.6MB in the beginning and 89.5MB in the end (delta: 156.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 440.97ms. Allocated memory was 130.0MB in the beginning and 201.3MB in the end (delta: 71.3MB). Free memory was 59.8MB in the beginning and 163.3MB in the end (delta: -103.6MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.96ms. Allocated memory is still 201.3MB. Free memory was 163.3MB in the beginning and 153.9MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 118.26ms. Allocated memory is still 201.3MB. Free memory was 153.9MB in the beginning and 148.7MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 899.16ms. Allocated memory is still 201.3MB. Free memory was 148.7MB in the beginning and 96.2MB in the end (delta: 52.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 1890.99ms. Allocated memory is still 201.3MB. Free memory was 95.2MB in the beginning and 138.8MB in the end (delta: -43.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 6.98ms. Allocated memory is still 201.3MB. Free memory is still 138.8MB. 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.8s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, 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, 1.0s 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-12 00:05:33,690 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.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-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 00:05:36,023 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 00:05:36,137 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-12 00:05:36,145 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 00:05:36,146 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 00:05:36,179 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 00:05:36,180 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 00:05:36,180 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 00:05:36,181 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 00:05:36,183 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 00:05:36,183 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 00:05:36,184 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 00:05:36,184 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 00:05:36,185 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 00:05:36,185 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 00:05:36,186 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 00:05:36,186 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 00:05:36,186 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 00:05:36,186 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 00:05:36,187 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 00:05:36,187 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 00:05:36,189 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 00:05:36,189 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 00:05:36,189 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 00:05:36,190 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 00:05:36,190 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 00:05:36,190 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 00:05:36,191 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 00:05:36,191 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 00:05:36,191 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 00:05:36,192 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 00:05:36,193 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 00:05:36,193 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 00:05:36,193 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 00:05:36,193 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 00:05:36,194 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 00:05:36,194 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 00:05:36,194 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 00:05:36,194 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 00:05:36,194 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 00:05:36,195 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 00:05:36,195 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-12 00:05:36,536 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 00:05:36,556 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 00:05:36,559 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 00:05:36,560 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 00:05:36,562 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 00:05:36,564 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-12 00:05:38,206 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 00:05:38,455 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 00:05:38,456 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Rrobin.c [2024-11-12 00:05:38,470 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35eb672f1/50865875db2a4d5f894b326c27935762/FLAGbaa3661ce [2024-11-12 00:05:38,792 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35eb672f1/50865875db2a4d5f894b326c27935762 [2024-11-12 00:05:38,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 00:05:38,796 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 00:05:38,797 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 00:05:38,797 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 00:05:38,804 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 00:05:38,805 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:05:38" (1/1) ... [2024-11-12 00:05:38,806 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68b95370 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:05:38, skipping insertion in model container [2024-11-12 00:05:38,806 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:05:38" (1/1) ... [2024-11-12 00:05:38,835 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 00:05:39,016 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-12 00:05:39,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 00:05:39,086 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 00:05:39,096 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-12 00:05:39,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 00:05:39,150 INFO L204 MainTranslator]: Completed translation [2024-11-12 00:05:39,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:05:39 WrapperNode [2024-11-12 00:05:39,151 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 00:05:39,152 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 00:05:39,152 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 00:05:39,152 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 00:05:39,160 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:05:39" (1/1) ... [2024-11-12 00:05:39,175 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:05:39" (1/1) ... [2024-11-12 00:05:39,209 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 218 [2024-11-12 00:05:39,210 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 00:05:39,211 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 00:05:39,211 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 00:05:39,211 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 00:05:39,226 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:05:39" (1/1) ... [2024-11-12 00:05:39,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:05:39" (1/1) ... [2024-11-12 00:05:39,231 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:05:39" (1/1) ... [2024-11-12 00:05:39,246 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-12 00:05:39,246 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:05:39" (1/1) ... [2024-11-12 00:05:39,247 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:05:39" (1/1) ... [2024-11-12 00:05:39,257 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:05:39" (1/1) ... [2024-11-12 00:05:39,261 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:05:39" (1/1) ... [2024-11-12 00:05:39,263 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:05:39" (1/1) ... [2024-11-12 00:05:39,264 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:05:39" (1/1) ... [2024-11-12 00:05:39,267 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 00:05:39,269 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 00:05:39,269 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 00:05:39,269 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 00:05:39,270 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:05:39" (1/1) ... [2024-11-12 00:05:39,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 00:05:39,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 00:05:39,298 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-12 00:05:39,300 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-12 00:05:39,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 00:05:39,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 00:05:39,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 00:05:39,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 00:05:39,448 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 00:05:39,451 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 00:05:39,795 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2024-11-12 00:05:39,795 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 00:05:39,813 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 00:05:39,815 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 00:05:39,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:05:39 BoogieIcfgContainer [2024-11-12 00:05:39,816 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 00:05:39,819 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 00:05:39,819 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 00:05:39,823 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 00:05:39,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:05:38" (1/3) ... [2024-11-12 00:05:39,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3051e2b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:05:39, skipping insertion in model container [2024-11-12 00:05:39,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:05:39" (2/3) ... [2024-11-12 00:05:39,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3051e2b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:05:39, skipping insertion in model container [2024-11-12 00:05:39,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:05:39" (3/3) ... [2024-11-12 00:05:39,826 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_Rrobin.c [2024-11-12 00:05:39,843 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 00:05:39,844 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 00:05:39,909 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 00:05:39,917 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;@103c9aa5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 00:05:39,918 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 00:05:39,923 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-12 00:05:39,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-12 00:05:39,929 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:05:39,930 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-12 00:05:39,930 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:05:39,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:05:39,938 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-12 00:05:39,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 00:05:39,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [982139968] [2024-11-12 00:05:39,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:05:39,951 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-12 00:05:39,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 00:05:39,955 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-12 00:05:39,956 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-12 00:05:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:05:40,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-12 00:05:40,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 00:05:40,350 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-12 00:05:40,351 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 00:05:40,352 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 00:05:40,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [982139968] [2024-11-12 00:05:40,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [982139968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:05:40,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:05:40,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 00:05:40,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157416678] [2024-11-12 00:05:40,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:05:40,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 00:05:40,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 00:05:40,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 00:05:40,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:05:40,389 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-12 00:05:40,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:05:40,445 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-12 00:05:40,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:05:40,447 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-12 00:05:40,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:05:40,454 INFO L225 Difference]: With dead ends: 18 [2024-11-12 00:05:40,455 INFO L226 Difference]: Without dead ends: 10 [2024-11-12 00:05:40,458 INFO L434 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-12 00:05:40,462 INFO L435 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-12 00:05:40,465 INFO L436 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-12 00:05:40,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-12 00:05:40,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-12 00:05:40,494 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-12 00:05:40,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-12 00:05:40,496 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-12 00:05:40,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:05:40,497 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-12 00:05:40,497 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-12 00:05:40,498 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-12 00:05:40,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-12 00:05:40,498 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:05:40,498 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-12 00:05:40,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-12 00:05:40,699 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-12 00:05:40,701 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:05:40,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:05:40,702 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-12 00:05:40,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 00:05:40,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1487949351] [2024-11-12 00:05:40,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:05:40,704 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-12 00:05:40,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 00:05:40,710 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-12 00:05:40,711 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-12 00:05:40,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:05:40,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-12 00:05:40,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 00:05:41,836 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-12 00:05:41,836 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 00:05:45,478 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-12 00:05:45,481 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 00:05:45,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1487949351] [2024-11-12 00:05:45,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1487949351] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 00:05:45,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 00:05:45,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-12 00:05:45,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571258289] [2024-11-12 00:05:45,482 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 00:05:45,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 00:05:45,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 00:05:45,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 00:05:45,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:05:45,486 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-12 00:05:47,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:05:47,018 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2024-11-12 00:05:47,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 00:05:47,019 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-12 00:05:47,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:05:47,020 INFO L225 Difference]: With dead ends: 21 [2024-11-12 00:05:47,020 INFO L226 Difference]: Without dead ends: 19 [2024-11-12 00:05:47,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2024-11-12 00:05:47,022 INFO L435 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-12 00:05:47,023 INFO L436 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-12 00:05:47,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-12 00:05:47,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2024-11-12 00:05:47,028 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-12 00:05:47,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2024-11-12 00:05:47,029 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 8 [2024-11-12 00:05:47,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:05:47,030 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2024-11-12 00:05:47,030 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-12 00:05:47,030 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2024-11-12 00:05:47,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-12 00:05:47,031 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:05:47,031 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1] [2024-11-12 00:05:47,035 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-12 00:05:47,234 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-12 00:05:47,235 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:05:47,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:05:47,236 INFO L85 PathProgramCache]: Analyzing trace with hash -37306491, now seen corresponding path program 2 times [2024-11-12 00:05:47,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 00:05:47,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [976483908] [2024-11-12 00:05:47,237 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 00:05:47,237 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-12 00:05:47,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 00:05:47,256 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-12 00:05:47,260 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-12 00:05:47,438 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 00:05:47,439 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 00:05:47,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-12 00:05:47,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 00:05:48,280 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-12 00:05:48,280 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 00:05:53,345 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-12 00:05:53,346 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 00:05:53,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [976483908] [2024-11-12 00:05:53,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [976483908] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 00:05:53,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 00:05:53,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-12 00:05:53,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329176554] [2024-11-12 00:05:53,347 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 00:05:53,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 00:05:53,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 00:05:53,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 00:05:53,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:05:53,349 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-12 00:05:53,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:05:53,428 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2024-11-12 00:05:53,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:05:53,429 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-12 00:05:53,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:05:53,430 INFO L225 Difference]: With dead ends: 18 [2024-11-12 00:05:53,430 INFO L226 Difference]: Without dead ends: 0 [2024-11-12 00:05:53,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-12 00:05:53,431 INFO L435 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-12 00:05:53,432 INFO L436 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-12 00:05:53,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-12 00:05:53,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-12 00:05:53,432 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-12 00:05:53,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-12 00:05:53,433 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2024-11-12 00:05:53,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:05:53,433 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 00:05:53,434 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-12 00:05:53,435 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-12 00:05:53,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-12 00:05:53,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 00:05:53,444 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-12 00:05:53,639 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-12 00:05:53,643 INFO L421 BasicCegarLoop]: Path program histogram: [2, 1] [2024-11-12 00:05:53,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-12 00:05:54,095 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 00:05:54,109 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-12 00:05:54,112 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-12 00:05:54,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 12:05:54 BoogieIcfgContainer [2024-11-12 00:05:54,120 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 00:05:54,122 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 00:05:54,122 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 00:05:54,122 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 00:05:54,127 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:05:39" (3/4) ... [2024-11-12 00:05:54,130 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 00:05:54,142 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-12 00:05:54,144 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-12 00:05:54,144 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-12 00:05:54,145 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 00:05:54,261 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 00:05:54,261 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 00:05:54,261 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 00:05:54,262 INFO L158 Benchmark]: Toolchain (without parser) took 15466.32ms. Allocated memory was 73.4MB in the beginning and 450.9MB in the end (delta: 377.5MB). Free memory was 43.1MB in the beginning and 198.7MB in the end (delta: -155.6MB). Peak memory consumption was 221.5MB. Max. memory is 16.1GB. [2024-11-12 00:05:54,262 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 50.3MB. Free memory is still 32.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 00:05:54,263 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.81ms. Allocated memory is still 73.4MB. Free memory was 42.9MB in the beginning and 45.5MB in the end (delta: -2.6MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2024-11-12 00:05:54,263 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.13ms. Allocated memory is still 73.4MB. Free memory was 45.2MB in the beginning and 42.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 00:05:54,263 INFO L158 Benchmark]: Boogie Preprocessor took 57.05ms. Allocated memory is still 73.4MB. Free memory was 42.8MB in the beginning and 39.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 00:05:54,264 INFO L158 Benchmark]: RCFGBuilder took 547.26ms. Allocated memory is still 73.4MB. Free memory was 39.5MB in the beginning and 37.2MB in the end (delta: 2.3MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2024-11-12 00:05:54,264 INFO L158 Benchmark]: TraceAbstraction took 14301.61ms. Allocated memory was 73.4MB in the beginning and 450.9MB in the end (delta: 377.5MB). Free memory was 36.3MB in the beginning and 205.0MB in the end (delta: -168.7MB). Peak memory consumption was 207.1MB. Max. memory is 16.1GB. [2024-11-12 00:05:54,264 INFO L158 Benchmark]: Witness Printer took 139.92ms. Allocated memory is still 450.9MB. Free memory was 205.0MB in the beginning and 198.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 00:05:54,266 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.24ms. Allocated memory is still 50.3MB. Free memory is still 32.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 353.81ms. Allocated memory is still 73.4MB. Free memory was 42.9MB in the beginning and 45.5MB in the end (delta: -2.6MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.13ms. Allocated memory is still 73.4MB. Free memory was 45.2MB in the beginning and 42.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.05ms. Allocated memory is still 73.4MB. Free memory was 42.8MB in the beginning and 39.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 547.26ms. Allocated memory is still 73.4MB. Free memory was 39.5MB in the beginning and 37.2MB in the end (delta: 2.3MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * TraceAbstraction took 14301.61ms. Allocated memory was 73.4MB in the beginning and 450.9MB in the end (delta: 377.5MB). Free memory was 36.3MB in the beginning and 205.0MB in the end (delta: -168.7MB). Peak memory consumption was 207.1MB. Max. memory is 16.1GB. * Witness Printer took 139.92ms. Allocated memory is still 450.9MB. Free memory was 205.0MB in the beginning and 198.7MB 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: 13.8s, OverallIterations: 3, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12 mSDsluCounter, 34 SdHoareTripleChecker+Invalid, 0.2s 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, 2.5s 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, 10.8s 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-12 00:05:54,303 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 Writing output log to file Ultimate.log Result: TRUE