./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p14.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p14.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 6941340a217c21b00eedda9dba2fb93b4ff9d5189cb3951c1318a65ece342f1e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 07:08:04,824 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 07:08:04,891 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-14 07:08:04,895 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 07:08:04,897 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 07:08:04,929 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 07:08:04,930 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 07:08:04,930 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 07:08:04,931 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 07:08:04,931 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 07:08:04,932 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 07:08:04,932 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 07:08:04,933 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 07:08:04,933 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 07:08:04,935 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 07:08:04,935 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 07:08:04,936 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 07:08:04,936 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 07:08:04,936 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 07:08:04,936 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 07:08:04,937 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 07:08:04,937 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 07:08:04,937 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 07:08:04,938 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 07:08:04,938 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 07:08:04,938 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 07:08:04,939 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 07:08:04,939 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 07:08:04,939 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 07:08:04,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:08:04,940 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 07:08:04,940 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 07:08:04,940 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 07:08:04,941 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 07:08:04,941 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 07:08:04,941 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 07:08:04,941 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 07:08:04,941 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 07:08:04,942 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 07:08:04,942 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 -> 6941340a217c21b00eedda9dba2fb93b4ff9d5189cb3951c1318a65ece342f1e [2024-10-14 07:08:05,215 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 07:08:05,242 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 07:08:05,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 07:08:05,247 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 07:08:05,248 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 07:08:05,249 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p14.c [2024-10-14 07:08:06,689 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 07:08:06,880 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 07:08:06,881 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p14.c [2024-10-14 07:08:06,891 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38b3cac14/d26b5cc016394e9aae6b5022ec50a03f/FLAG95e1c08e8 [2024-10-14 07:08:06,905 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38b3cac14/d26b5cc016394e9aae6b5022ec50a03f [2024-10-14 07:08:06,907 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 07:08:06,908 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 07:08:06,909 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 07:08:06,909 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 07:08:06,915 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 07:08:06,915 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:08:06" (1/1) ... [2024-10-14 07:08:06,916 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fab4655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:06, skipping insertion in model container [2024-10-14 07:08:06,916 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:08:06" (1/1) ... [2024-10-14 07:08:07,003 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 07:08:07,145 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p14.c[1266,1279] [2024-10-14 07:08:07,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:08:07,260 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 07:08:07,279 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p14.c[1266,1279] [2024-10-14 07:08:07,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:08:07,389 INFO L204 MainTranslator]: Completed translation [2024-10-14 07:08:07,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:07 WrapperNode [2024-10-14 07:08:07,389 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 07:08:07,390 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 07:08:07,391 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 07:08:07,391 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 07:08:07,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:07" (1/1) ... [2024-10-14 07:08:07,425 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:07" (1/1) ... [2024-10-14 07:08:07,511 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 706 [2024-10-14 07:08:07,512 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 07:08:07,512 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 07:08:07,512 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 07:08:07,515 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 07:08:07,526 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:07" (1/1) ... [2024-10-14 07:08:07,527 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:07" (1/1) ... [2024-10-14 07:08:07,538 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:07" (1/1) ... [2024-10-14 07:08:07,583 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 07:08:07,583 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:07" (1/1) ... [2024-10-14 07:08:07,584 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:07" (1/1) ... [2024-10-14 07:08:07,612 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:07" (1/1) ... [2024-10-14 07:08:07,618 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:07" (1/1) ... [2024-10-14 07:08:07,637 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:07" (1/1) ... [2024-10-14 07:08:07,647 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:07" (1/1) ... [2024-10-14 07:08:07,662 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 07:08:07,663 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 07:08:07,664 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 07:08:07,664 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 07:08:07,665 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:07" (1/1) ... [2024-10-14 07:08:07,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:08:07,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:08:07,698 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 07:08:07,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 07:08:07,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 07:08:07,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 07:08:07,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 07:08:07,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 07:08:07,862 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 07:08:07,864 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 07:08:08,682 INFO L? ?]: Removed 342 outVars from TransFormulas that were not future-live. [2024-10-14 07:08:08,682 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 07:08:08,720 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 07:08:08,723 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 07:08:08,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:08:08 BoogieIcfgContainer [2024-10-14 07:08:08,724 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 07:08:08,727 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 07:08:08,728 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 07:08:08,732 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 07:08:08,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:08:06" (1/3) ... [2024-10-14 07:08:08,733 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b3a631e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:08:08, skipping insertion in model container [2024-10-14 07:08:08,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:07" (2/3) ... [2024-10-14 07:08:08,733 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b3a631e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:08:08, skipping insertion in model container [2024-10-14 07:08:08,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:08:08" (3/3) ... [2024-10-14 07:08:08,735 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p14.c [2024-10-14 07:08:08,753 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 07:08:08,753 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 07:08:08,819 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 07:08:08,826 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;@53ae8e07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 07:08:08,826 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 07:08:08,830 INFO L276 IsEmpty]: Start isEmpty. Operand has 135 states, 133 states have (on average 1.5037593984962405) internal successors, (200), 134 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:08:08,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-14 07:08:08,838 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:08:08,838 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:08:08,839 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:08:08,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:08:08,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1461182874, now seen corresponding path program 1 times [2024-10-14 07:08:08,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:08:08,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922103319] [2024-10-14 07:08:08,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:08:08,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:08:09,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:08:09,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:08:09,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:08:09,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922103319] [2024-10-14 07:08:09,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922103319] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:08:09,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:08:09,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 07:08:09,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998820218] [2024-10-14 07:08:09,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:08:09,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 07:08:09,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:08:09,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 07:08:09,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 07:08:09,536 INFO L87 Difference]: Start difference. First operand has 135 states, 133 states have (on average 1.5037593984962405) internal successors, (200), 134 states have internal predecessors, (200), 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 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:08:09,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:08:09,600 INFO L93 Difference]: Finished difference Result 222 states and 330 transitions. [2024-10-14 07:08:09,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 07:08:09,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 38 [2024-10-14 07:08:09,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:08:09,613 INFO L225 Difference]: With dead ends: 222 [2024-10-14 07:08:09,613 INFO L226 Difference]: Without dead ends: 136 [2024-10-14 07:08:09,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 07:08:09,621 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 0 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:08:09,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 580 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:08:09,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-14 07:08:09,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-10-14 07:08:09,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.4814814814814814) internal successors, (200), 135 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:08:09,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 200 transitions. [2024-10-14 07:08:09,664 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 200 transitions. Word has length 38 [2024-10-14 07:08:09,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:08:09,664 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 200 transitions. [2024-10-14 07:08:09,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:08:09,665 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 200 transitions. [2024-10-14 07:08:09,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-14 07:08:09,668 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:08:09,668 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:08:09,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 07:08:09,669 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:08:09,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:08:09,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1949666536, now seen corresponding path program 1 times [2024-10-14 07:08:09,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:08:09,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335838073] [2024-10-14 07:08:09,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:08:09,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:08:09,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:08:09,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:08:09,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:08:09,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335838073] [2024-10-14 07:08:09,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335838073] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:08:09,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:08:09,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 07:08:09,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355339554] [2024-10-14 07:08:09,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:08:09,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 07:08:09,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:08:09,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 07:08:09,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 07:08:09,876 INFO L87 Difference]: Start difference. First operand 136 states and 200 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:08:09,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:08:09,921 INFO L93 Difference]: Finished difference Result 225 states and 330 transitions. [2024-10-14 07:08:09,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 07:08:09,922 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 39 [2024-10-14 07:08:09,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:08:09,923 INFO L225 Difference]: With dead ends: 225 [2024-10-14 07:08:09,923 INFO L226 Difference]: Without dead ends: 138 [2024-10-14 07:08:09,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 07:08:09,925 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 0 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:08:09,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:08:09,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-14 07:08:09,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-10-14 07:08:09,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 1.4744525547445255) internal successors, (202), 137 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:08:09,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 202 transitions. [2024-10-14 07:08:09,943 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 202 transitions. Word has length 39 [2024-10-14 07:08:09,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:08:09,945 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 202 transitions. [2024-10-14 07:08:09,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:08:09,945 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 202 transitions. [2024-10-14 07:08:09,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-14 07:08:09,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:08:09,947 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:08:09,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 07:08:09,947 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:08:09,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:08:09,948 INFO L85 PathProgramCache]: Analyzing trace with hash -787845249, now seen corresponding path program 1 times [2024-10-14 07:08:09,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:08:09,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664648256] [2024-10-14 07:08:09,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:08:09,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:08:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:08:10,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:08:10,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:08:10,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664648256] [2024-10-14 07:08:10,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664648256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:08:10,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:08:10,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 07:08:10,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674213862] [2024-10-14 07:08:10,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:08:10,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 07:08:10,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:08:10,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 07:08:10,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 07:08:10,338 INFO L87 Difference]: Start difference. First operand 138 states and 202 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:08:10,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:08:10,382 INFO L93 Difference]: Finished difference Result 227 states and 331 transitions. [2024-10-14 07:08:10,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 07:08:10,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-10-14 07:08:10,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:08:10,384 INFO L225 Difference]: With dead ends: 227 [2024-10-14 07:08:10,386 INFO L226 Difference]: Without dead ends: 138 [2024-10-14 07:08:10,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 07:08:10,388 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 6 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:08:10,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 565 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:08:10,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-14 07:08:10,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-10-14 07:08:10,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 1.467153284671533) internal successors, (201), 137 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:08:10,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 201 transitions. [2024-10-14 07:08:10,406 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 201 transitions. Word has length 40 [2024-10-14 07:08:10,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:08:10,407 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 201 transitions. [2024-10-14 07:08:10,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:08:10,407 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 201 transitions. [2024-10-14 07:08:10,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-14 07:08:10,408 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:08:10,408 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:08:10,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 07:08:10,409 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:08:10,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:08:10,409 INFO L85 PathProgramCache]: Analyzing trace with hash -2039479217, now seen corresponding path program 1 times [2024-10-14 07:08:10,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:08:10,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451071489] [2024-10-14 07:08:10,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:08:10,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:08:10,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:08:10,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:08:10,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:08:10,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451071489] [2024-10-14 07:08:10,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451071489] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:08:10,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:08:10,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 07:08:10,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682060978] [2024-10-14 07:08:10,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:08:10,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 07:08:10,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:08:10,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 07:08:10,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 07:08:10,823 INFO L87 Difference]: Start difference. First operand 138 states and 201 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:08:10,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:08:10,872 INFO L93 Difference]: Finished difference Result 231 states and 334 transitions. [2024-10-14 07:08:10,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 07:08:10,873 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 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 41 [2024-10-14 07:08:10,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:08:10,874 INFO L225 Difference]: With dead ends: 231 [2024-10-14 07:08:10,874 INFO L226 Difference]: Without dead ends: 142 [2024-10-14 07:08:10,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 07:08:10,877 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 173 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:08:10,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 568 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:08:10,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-14 07:08:10,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2024-10-14 07:08:10,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.457142857142857) internal successors, (204), 140 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:08:10,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 204 transitions. [2024-10-14 07:08:10,885 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 204 transitions. Word has length 41 [2024-10-14 07:08:10,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:08:10,885 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 204 transitions. [2024-10-14 07:08:10,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:08:10,886 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 204 transitions. [2024-10-14 07:08:10,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-14 07:08:10,887 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:08:10,887 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:08:10,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 07:08:10,888 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:08:10,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:08:10,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1520000220, now seen corresponding path program 1 times [2024-10-14 07:08:10,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:08:10,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052467198] [2024-10-14 07:08:10,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:08:10,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:08:10,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 07:08:10,936 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 07:08:10,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 07:08:11,020 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 07:08:11,021 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 07:08:11,023 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 07:08:11,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 07:08:11,029 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-14 07:08:11,091 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 07:08:11,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 07:08:11 BoogieIcfgContainer [2024-10-14 07:08:11,099 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 07:08:11,100 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 07:08:11,100 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 07:08:11,100 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 07:08:11,101 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:08:08" (3/4) ... [2024-10-14 07:08:11,105 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 07:08:11,106 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 07:08:11,107 INFO L158 Benchmark]: Toolchain (without parser) took 4198.77ms. Allocated memory was 192.9MB in the beginning and 278.9MB in the end (delta: 86.0MB). Free memory was 118.2MB in the beginning and 115.8MB in the end (delta: 2.3MB). Peak memory consumption was 89.4MB. Max. memory is 16.1GB. [2024-10-14 07:08:11,107 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 192.9MB. Free memory was 159.9MB in the beginning and 159.8MB in the end (delta: 16.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 07:08:11,108 INFO L158 Benchmark]: CACSL2BoogieTranslator took 480.51ms. Allocated memory is still 192.9MB. Free memory was 118.2MB in the beginning and 140.4MB in the end (delta: -22.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 07:08:11,108 INFO L158 Benchmark]: Boogie Procedure Inliner took 121.38ms. Allocated memory is still 192.9MB. Free memory was 140.4MB in the beginning and 126.5MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 07:08:11,108 INFO L158 Benchmark]: Boogie Preprocessor took 150.41ms. Allocated memory is still 192.9MB. Free memory was 126.5MB in the beginning and 117.4MB in the end (delta: 9.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 07:08:11,109 INFO L158 Benchmark]: RCFGBuilder took 1061.86ms. Allocated memory was 192.9MB in the beginning and 278.9MB in the end (delta: 86.0MB). Free memory was 117.4MB in the beginning and 199.2MB in the end (delta: -81.7MB). Peak memory consumption was 58.4MB. Max. memory is 16.1GB. [2024-10-14 07:08:11,109 INFO L158 Benchmark]: TraceAbstraction took 2371.91ms. Allocated memory is still 278.9MB. Free memory was 198.1MB in the beginning and 115.8MB in the end (delta: 82.3MB). Peak memory consumption was 82.3MB. Max. memory is 16.1GB. [2024-10-14 07:08:11,110 INFO L158 Benchmark]: Witness Printer took 6.59ms. Allocated memory is still 278.9MB. Free memory was 115.8MB in the beginning and 115.8MB in the end (delta: 2.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 07:08:11,112 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.22ms. Allocated memory is still 192.9MB. Free memory was 159.9MB in the beginning and 159.8MB in the end (delta: 16.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 480.51ms. Allocated memory is still 192.9MB. Free memory was 118.2MB in the beginning and 140.4MB in the end (delta: -22.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 121.38ms. Allocated memory is still 192.9MB. Free memory was 140.4MB in the beginning and 126.5MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 150.41ms. Allocated memory is still 192.9MB. Free memory was 126.5MB in the beginning and 117.4MB in the end (delta: 9.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1061.86ms. Allocated memory was 192.9MB in the beginning and 278.9MB in the end (delta: 86.0MB). Free memory was 117.4MB in the beginning and 199.2MB in the end (delta: -81.7MB). Peak memory consumption was 58.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2371.91ms. Allocated memory is still 278.9MB. Free memory was 198.1MB in the beginning and 115.8MB in the end (delta: 82.3MB). Peak memory consumption was 82.3MB. Max. memory is 16.1GB. * Witness Printer took 6.59ms. Allocated memory is still 278.9MB. Free memory was 115.8MB in the beginning and 115.8MB in the end (delta: 2.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 162. 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_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 8); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (8 - 1); [L32] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 32); [L33] const SORT_10 msb_SORT_10 = (SORT_10)1 << (32 - 1); [L35] const SORT_32 mask_SORT_32 = (SORT_32)-1 >> (sizeof(SORT_32) * 8 - 4); [L36] const SORT_32 msb_SORT_32 = (SORT_32)1 << (4 - 1); [L38] const SORT_70 mask_SORT_70 = (SORT_70)-1 >> (sizeof(SORT_70) * 8 - 10); [L39] const SORT_70 msb_SORT_70 = (SORT_70)1 << (10 - 1); [L41] const SORT_1 var_7 = 0; [L42] const SORT_10 var_12 = 0; [L43] const SORT_1 var_22 = 1; [L44] const SORT_70 var_71 = 0; [L45] const SORT_10 var_95 = 104; [L46] const SORT_10 var_143 = 1; [L48] SORT_1 input_2; [L49] SORT_3 input_4; [L50] SORT_1 input_5; [L51] SORT_1 input_6; [L52] SORT_1 input_30; [L53] SORT_32 input_33; [L54] SORT_1 input_35; [L55] SORT_32 input_37; [L56] SORT_1 input_39; [L57] SORT_1 input_41; [L58] SORT_1 input_47; [L59] SORT_1 input_49; [L60] SORT_1 input_51; [L61] SORT_3 input_55; [L62] SORT_1 input_58; [L63] SORT_1 input_66; [L64] SORT_1 input_75; [L65] SORT_1 input_77; [L66] SORT_1 input_89; [L67] SORT_1 input_90; [L68] SORT_1 input_91; [L69] SORT_1 input_105; [L70] SORT_1 input_111; [L71] SORT_1 input_117; [L72] SORT_1 input_123; [L73] SORT_1 input_124; [L74] SORT_1 input_125; [L75] SORT_70 input_141; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L77] SORT_1 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L78] SORT_1 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L79] SORT_1 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L80] SORT_1 state_28 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L81] SORT_1 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L82] SORT_1 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L83] SORT_1 state_53 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L84] SORT_1 state_60 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L85] SORT_1 state_62 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L86] SORT_1 state_64 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L87] SORT_1 state_68 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L88] EXPR __VERIFIER_nondet_ushort() & mask_SORT_70 VAL [mask_SORT_1=1, mask_SORT_70=1023, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L88] SORT_70 state_72 = __VERIFIER_nondet_ushort() & mask_SORT_70; [L90] SORT_1 init_9_arg_1 = var_7; [L91] state_8 = init_9_arg_1 [L92] SORT_1 init_16_arg_1 = var_7; [L93] state_15 = init_16_arg_1 [L94] SORT_1 init_27_arg_1 = var_7; [L95] state_26 = init_27_arg_1 [L96] SORT_1 init_29_arg_1 = var_7; [L97] state_28 = init_29_arg_1 [L98] SORT_1 init_44_arg_1 = var_7; [L99] state_43 = init_44_arg_1 [L100] SORT_1 init_46_arg_1 = var_7; [L101] state_45 = init_46_arg_1 [L102] SORT_1 init_54_arg_1 = var_22; [L103] state_53 = init_54_arg_1 [L104] SORT_1 init_61_arg_1 = var_7; [L105] state_60 = init_61_arg_1 [L106] SORT_1 init_63_arg_1 = var_7; [L107] state_62 = init_63_arg_1 [L108] SORT_1 init_65_arg_1 = var_7; [L109] state_64 = init_65_arg_1 [L110] SORT_1 init_69_arg_1 = var_7; [L111] state_68 = init_69_arg_1 [L112] SORT_70 init_73_arg_1 = var_71; [L113] state_72 = init_73_arg_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, state_15=0, state_26=0, state_28=0, state_43=0, state_45=0, state_53=1, state_60=0, state_62=0, state_64=0, state_68=0, state_72=0, state_8=0, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L116] input_2 = __VERIFIER_nondet_uchar() [L117] input_4 = __VERIFIER_nondet_uchar() [L118] input_5 = __VERIFIER_nondet_uchar() [L119] input_6 = __VERIFIER_nondet_uchar() [L120] input_30 = __VERIFIER_nondet_uchar() [L121] input_33 = __VERIFIER_nondet_uchar() [L122] input_35 = __VERIFIER_nondet_uchar() [L123] input_37 = __VERIFIER_nondet_uchar() [L124] input_39 = __VERIFIER_nondet_uchar() [L125] input_41 = __VERIFIER_nondet_uchar() [L126] input_47 = __VERIFIER_nondet_uchar() [L127] input_49 = __VERIFIER_nondet_uchar() [L128] input_51 = __VERIFIER_nondet_uchar() [L129] input_55 = __VERIFIER_nondet_uchar() [L130] input_58 = __VERIFIER_nondet_uchar() [L131] input_66 = __VERIFIER_nondet_uchar() [L132] input_75 = __VERIFIER_nondet_uchar() [L133] input_77 = __VERIFIER_nondet_uchar() [L134] input_89 = __VERIFIER_nondet_uchar() [L135] input_90 = __VERIFIER_nondet_uchar() [L136] input_91 = __VERIFIER_nondet_uchar() [L137] input_105 = __VERIFIER_nondet_uchar() [L138] input_111 = __VERIFIER_nondet_uchar() [L139] input_117 = __VERIFIER_nondet_uchar() [L140] input_123 = __VERIFIER_nondet_uchar() [L141] input_124 = __VERIFIER_nondet_uchar() [L142] input_125 = __VERIFIER_nondet_uchar() [L143] input_141 = __VERIFIER_nondet_ushort() [L146] SORT_1 var_11_arg_0 = state_8; VAL [mask_SORT_1=1, mask_SORT_70=1023, state_15=0, state_26=0, state_28=0, state_43=0, state_45=0, state_53=1, state_60=0, state_62=0, state_64=0, state_68=0, state_72=0, state_8=0, var_11_arg_0=0, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L147] EXPR var_11_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, state_15=0, state_26=0, state_28=0, state_43=0, state_45=0, state_53=1, state_60=0, state_62=0, state_64=0, state_68=0, state_72=0, state_8=0, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L147] var_11_arg_0 = var_11_arg_0 & mask_SORT_1 [L148] SORT_10 var_11 = var_11_arg_0; [L149] SORT_10 var_13_arg_0 = var_11; [L150] SORT_10 var_13_arg_1 = var_12; [L151] SORT_1 var_13 = var_13_arg_0 == var_13_arg_1; [L152] SORT_1 var_14_arg_0 = var_13; [L153] SORT_1 var_14 = ~var_14_arg_0; [L154] SORT_1 var_17_arg_0 = state_15; VAL [mask_SORT_1=1, mask_SORT_70=1023, state_15=0, state_26=0, state_28=0, state_43=0, state_45=0, state_53=1, state_60=0, state_62=0, state_64=0, state_68=0, state_72=0, state_8=0, var_12=0, var_143=1, var_14=-2, var_17_arg_0=0, var_22=1, var_71=0, var_7=0, var_95=104] [L155] EXPR var_17_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, state_15=0, state_26=0, state_28=0, state_43=0, state_45=0, state_53=1, state_60=0, state_62=0, state_64=0, state_68=0, state_72=0, state_8=0, var_12=0, var_143=1, var_14=-2, var_22=1, var_71=0, var_7=0, var_95=104] [L155] var_17_arg_0 = var_17_arg_0 & mask_SORT_1 [L156] SORT_10 var_17 = var_17_arg_0; [L157] SORT_10 var_18_arg_0 = var_17; [L158] SORT_10 var_18_arg_1 = var_12; [L159] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L160] SORT_1 var_19_arg_0 = var_14; [L161] SORT_1 var_19_arg_1 = var_18; VAL [mask_SORT_1=1, mask_SORT_70=1023, state_15=0, state_26=0, state_28=0, state_43=0, state_45=0, state_53=1, state_60=0, state_62=0, state_64=0, state_68=0, state_72=0, state_8=0, var_12=0, var_143=1, var_19_arg_0=-2, var_19_arg_1=1, var_22=1, var_71=0, var_7=0, var_95=104] [L162] EXPR var_19_arg_0 | var_19_arg_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, state_15=0, state_26=0, state_28=0, state_43=0, state_45=0, state_53=1, state_60=0, state_62=0, state_64=0, state_68=0, state_72=0, state_8=0, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L162] SORT_1 var_19 = var_19_arg_0 | var_19_arg_1; [L163] SORT_1 var_23_arg_0 = var_19; [L164] SORT_1 var_23 = ~var_23_arg_0; [L165] SORT_1 var_24_arg_0 = var_22; [L166] SORT_1 var_24_arg_1 = var_23; VAL [mask_SORT_1=1, mask_SORT_70=1023, state_15=0, state_26=0, state_28=0, state_43=0, state_45=0, state_53=1, state_60=0, state_62=0, state_64=0, state_68=0, state_72=0, state_8=0, var_12=0, var_143=1, var_22=1, var_24_arg_0=1, var_24_arg_1=-255, var_71=0, var_7=0, var_95=104] [L167] EXPR var_24_arg_0 & var_24_arg_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, state_15=0, state_26=0, state_28=0, state_43=0, state_45=0, state_53=1, state_60=0, state_62=0, state_64=0, state_68=0, state_72=0, state_8=0, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L167] SORT_1 var_24 = var_24_arg_0 & var_24_arg_1; [L168] EXPR var_24 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, state_15=0, state_26=0, state_28=0, state_43=0, state_45=0, state_53=1, state_60=0, state_62=0, state_64=0, state_68=0, state_72=0, state_8=0, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L168] var_24 = var_24 & mask_SORT_1 [L169] SORT_1 bad_25_arg_0 = var_24; [L170] CALL __VERIFIER_assert(!(bad_25_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 135 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 179 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 179 mSDsluCounter, 2290 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1518 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 68 IncrementalHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 772 mSDtfsCounter, 68 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=4, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 200 NumberOfCodeBlocks, 200 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 154 ConstructedInterpolants, 0 QuantifiedInterpolants, 305 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 07:08:11,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p14.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 6941340a217c21b00eedda9dba2fb93b4ff9d5189cb3951c1318a65ece342f1e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 07:08:13,373 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 07:08:13,454 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-14 07:08:13,459 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 07:08:13,459 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 07:08:13,494 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 07:08:13,495 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 07:08:13,495 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 07:08:13,496 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 07:08:13,496 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 07:08:13,496 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 07:08:13,497 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 07:08:13,498 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 07:08:13,500 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 07:08:13,500 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 07:08:13,501 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 07:08:13,501 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 07:08:13,501 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 07:08:13,502 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 07:08:13,502 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 07:08:13,502 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 07:08:13,506 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 07:08:13,507 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 07:08:13,507 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 07:08:13,507 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 07:08:13,507 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 07:08:13,508 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 07:08:13,508 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 07:08:13,508 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 07:08:13,509 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 07:08:13,509 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 07:08:13,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:08:13,510 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 07:08:13,510 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 07:08:13,511 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 07:08:13,511 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 07:08:13,511 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 07:08:13,511 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 07:08:13,512 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 07:08:13,512 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 07:08:13,512 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 07:08:13,513 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 07:08:13,513 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 -> 6941340a217c21b00eedda9dba2fb93b4ff9d5189cb3951c1318a65ece342f1e [2024-10-14 07:08:13,836 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 07:08:13,864 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 07:08:13,866 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 07:08:13,868 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 07:08:13,868 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 07:08:13,869 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p14.c [2024-10-14 07:08:15,473 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 07:08:15,733 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 07:08:15,734 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p14.c [2024-10-14 07:08:15,754 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2454f5792/ca52cb7c0b8e46ba9764505ac8df050b/FLAGfe3a59aca [2024-10-14 07:08:16,065 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2454f5792/ca52cb7c0b8e46ba9764505ac8df050b [2024-10-14 07:08:16,067 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 07:08:16,069 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 07:08:16,069 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 07:08:16,070 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 07:08:16,074 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 07:08:16,074 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:08:16" (1/1) ... [2024-10-14 07:08:16,075 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70f3c92b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:16, skipping insertion in model container [2024-10-14 07:08:16,075 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:08:16" (1/1) ... [2024-10-14 07:08:16,117 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 07:08:16,287 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p14.c[1266,1279] [2024-10-14 07:08:16,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:08:16,447 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 07:08:16,459 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p14.c[1266,1279] [2024-10-14 07:08:16,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:08:16,566 INFO L204 MainTranslator]: Completed translation [2024-10-14 07:08:16,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:16 WrapperNode [2024-10-14 07:08:16,567 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 07:08:16,568 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 07:08:16,569 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 07:08:16,569 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 07:08:16,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:16" (1/1) ... [2024-10-14 07:08:16,595 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:16" (1/1) ... [2024-10-14 07:08:16,648 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 450 [2024-10-14 07:08:16,649 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 07:08:16,650 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 07:08:16,650 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 07:08:16,650 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 07:08:16,661 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:16" (1/1) ... [2024-10-14 07:08:16,661 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:16" (1/1) ... [2024-10-14 07:08:16,675 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:16" (1/1) ... [2024-10-14 07:08:16,707 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 07:08:16,707 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:16" (1/1) ... [2024-10-14 07:08:16,711 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:16" (1/1) ... [2024-10-14 07:08:16,727 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:16" (1/1) ... [2024-10-14 07:08:16,735 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:16" (1/1) ... [2024-10-14 07:08:16,738 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:16" (1/1) ... [2024-10-14 07:08:16,740 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:16" (1/1) ... [2024-10-14 07:08:16,744 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 07:08:16,745 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 07:08:16,745 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 07:08:16,745 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 07:08:16,746 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:16" (1/1) ... [2024-10-14 07:08:16,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:08:16,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:08:16,798 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 07:08:16,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 07:08:16,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 07:08:16,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 07:08:16,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 07:08:16,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 07:08:17,037 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 07:08:17,039 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 07:08:17,384 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2024-10-14 07:08:17,384 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 07:08:17,428 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 07:08:17,429 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 07:08:17,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:08:17 BoogieIcfgContainer [2024-10-14 07:08:17,430 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 07:08:17,432 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 07:08:17,432 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 07:08:17,435 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 07:08:17,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:08:16" (1/3) ... [2024-10-14 07:08:17,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4025edc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:08:17, skipping insertion in model container [2024-10-14 07:08:17,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:08:16" (2/3) ... [2024-10-14 07:08:17,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4025edc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:08:17, skipping insertion in model container [2024-10-14 07:08:17,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:08:17" (3/3) ... [2024-10-14 07:08:17,440 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p14.c [2024-10-14 07:08:17,459 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 07:08:17,459 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 07:08:17,524 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 07:08:17,531 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;@3b328b26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 07:08:17,531 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 07:08:17,536 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:08:17,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-14 07:08:17,542 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:08:17,544 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-14 07:08:17,544 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:08:17,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:08:17,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-14 07:08:17,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:08:17,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1810881737] [2024-10-14 07:08:17,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:08:17,563 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:08:17,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:08:17,567 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 07:08:17,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 07:08:17,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:08:17,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-14 07:08:17,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:08:17,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:08:17,953 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 07:08:17,953 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:08:17,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1810881737] [2024-10-14 07:08:17,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1810881737] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:08:17,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:08:17,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 07:08:17,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364533585] [2024-10-14 07:08:17,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:08:17,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 07:08:17,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:08:17,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 07:08:17,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 07:08:17,987 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:08:18,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:08:18,047 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-14 07:08:18,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 07:08:18,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-14 07:08:18,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:08:18,057 INFO L225 Difference]: With dead ends: 15 [2024-10-14 07:08:18,057 INFO L226 Difference]: Without dead ends: 9 [2024-10-14 07:08:18,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 07:08:18,065 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:08:18,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:08:18,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-14 07:08:18,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-14 07:08:18,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:08:18,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-14 07:08:18,102 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-14 07:08:18,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:08:18,102 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-14 07:08:18,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:08:18,103 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-14 07:08:18,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 07:08:18,104 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:08:18,104 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-14 07:08:18,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 07:08:18,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:08:18,309 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:08:18,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:08:18,309 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-14 07:08:18,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:08:18,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [188409552] [2024-10-14 07:08:18,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:08:18,311 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:08:18,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:08:18,318 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 07:08:18,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 07:08:18,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:08:18,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-14 07:08:18,538 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:08:18,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:08:18,731 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 07:08:19,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:08:19,219 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:08:19,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [188409552] [2024-10-14 07:08:19,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [188409552] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 07:08:19,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 07:08:19,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-14 07:08:19,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918069144] [2024-10-14 07:08:19,220 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 07:08:19,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 07:08:19,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:08:19,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 07:08:19,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 07:08:19,223 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:08:19,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:08:19,447 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2024-10-14 07:08:19,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 07:08:19,448 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 07:08:19,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:08:19,449 INFO L225 Difference]: With dead ends: 9 [2024-10-14 07:08:19,449 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 07:08:19,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-14 07:08:19,451 INFO L432 NwaCegarLoop]: 0 mSDtfsCounter, 8 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:08:19,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 0 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:08:19,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 07:08:19,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 07:08:19,454 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-10-14 07:08:19,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 07:08:19,455 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2024-10-14 07:08:19,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:08:19,455 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 07:08:19,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:08:19,455 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 07:08:19,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 07:08:19,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 07:08:19,465 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-10-14 07:08:19,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:08:19,663 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-14 07:08:19,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 07:08:19,719 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 07:08:19,732 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-10-14 07:08:19,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 07:08:19 BoogieIcfgContainer [2024-10-14 07:08:19,737 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 07:08:19,737 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 07:08:19,737 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 07:08:19,738 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 07:08:19,738 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:08:17" (3/4) ... [2024-10-14 07:08:19,740 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 07:08:19,753 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-14 07:08:19,756 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-14 07:08:19,757 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 07:08:19,757 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 07:08:19,890 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 07:08:19,890 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 07:08:19,890 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 07:08:19,892 INFO L158 Benchmark]: Toolchain (without parser) took 3822.41ms. Allocated memory was 75.5MB in the beginning and 111.1MB in the end (delta: 35.7MB). Free memory was 48.8MB in the beginning and 56.8MB in the end (delta: -8.0MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. [2024-10-14 07:08:19,893 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 52.4MB. Free memory is still 24.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 07:08:19,893 INFO L158 Benchmark]: CACSL2BoogieTranslator took 497.86ms. Allocated memory is still 75.5MB. Free memory was 48.6MB in the beginning and 48.8MB in the end (delta: -211.4kB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 07:08:19,893 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.68ms. Allocated memory is still 75.5MB. Free memory was 48.8MB in the beginning and 44.9MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 07:08:19,893 INFO L158 Benchmark]: Boogie Preprocessor took 94.02ms. Allocated memory is still 75.5MB. Free memory was 44.6MB in the beginning and 40.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 07:08:19,894 INFO L158 Benchmark]: RCFGBuilder took 685.36ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 40.5MB in the beginning and 55.8MB in the end (delta: -15.4MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2024-10-14 07:08:19,894 INFO L158 Benchmark]: TraceAbstraction took 2304.78ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 55.2MB in the beginning and 66.2MB in the end (delta: -11.0MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. [2024-10-14 07:08:19,894 INFO L158 Benchmark]: Witness Printer took 153.07ms. Allocated memory is still 111.1MB. Free memory was 66.2MB in the beginning and 56.8MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 07:08:19,896 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.20ms. Allocated memory is still 52.4MB. Free memory is still 24.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 497.86ms. Allocated memory is still 75.5MB. Free memory was 48.6MB in the beginning and 48.8MB in the end (delta: -211.4kB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.68ms. Allocated memory is still 75.5MB. Free memory was 48.8MB in the beginning and 44.9MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 94.02ms. Allocated memory is still 75.5MB. Free memory was 44.6MB in the beginning and 40.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 685.36ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 40.5MB in the beginning and 55.8MB in the end (delta: -15.4MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2304.78ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 55.2MB in the beginning and 66.2MB in the end (delta: -11.0MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. * Witness Printer took 153.07ms. Allocated memory is still 111.1MB. Free memory was 66.2MB in the beginning and 56.8MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. 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 * 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, 7 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24 IncrementalHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 2 mSDtfsCounter, 24 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=1, InterpolantAutomatonStates: 10, 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, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 15 ConstructedInterpolants, 4 QuantifiedInterpolants, 694 SizeOfPredicates, 13 NumberOfNonLiveVariables, 150 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 0/4 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: 114]: Loop Invariant Derived loop invariant: (((0 == var_12) && (0 == state_15)) && (1 == mask_SORT_1)) RESULT: Ultimate proved your program to be correct! [2024-10-14 07:08:19,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE