/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.trace.refinement.strategy WOLF -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.mul5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-17387ad-m [2024-11-06 06:59:12,229 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 06:59:12,302 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-06 06:59:12,308 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 06:59:12,309 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 06:59:12,336 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 06:59:12,337 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 06:59:12,337 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 06:59:12,338 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 06:59:12,338 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 06:59:12,339 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 06:59:12,339 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 06:59:12,341 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 06:59:12,344 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 06:59:12,344 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 06:59:12,345 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 06:59:12,345 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 06:59:12,345 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 06:59:12,345 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 06:59:12,346 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 06:59:12,346 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 06:59:12,348 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-06 06:59:12,348 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-06 06:59:12,349 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 06:59:12,349 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-06 06:59:12,349 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 06:59:12,349 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 06:59:12,350 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 06:59:12,350 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 06:59:12,350 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 06:59:12,350 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 06:59:12,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 06:59:12,351 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 06:59:12,351 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 06:59:12,351 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 06:59:12,352 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-06 06:59:12,352 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-06 06:59:12,352 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 06:59:12,352 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 06:59:12,353 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 06:59:12,353 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 06:59:12,354 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: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> WOLF [2024-11-06 06:59:12,577 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 06:59:12,601 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 06:59:12,605 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 06:59:12,606 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 06:59:12,607 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 06:59:12,608 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.mul5.c [2024-11-06 06:59:14,047 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 06:59:14,240 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 06:59:14,241 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.mul5.c [2024-11-06 06:59:14,249 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d680cbcf0/67bdc59786184f7ca04ae49d52a56919/FLAG617a77c1b [2024-11-06 06:59:14,627 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d680cbcf0/67bdc59786184f7ca04ae49d52a56919 [2024-11-06 06:59:14,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 06:59:14,632 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-06 06:59:14,634 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 06:59:14,635 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 06:59:14,638 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 06:59:14,639 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:59:14" (1/1) ... [2024-11-06 06:59:14,640 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7315209e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:59:14, skipping insertion in model container [2024-11-06 06:59:14,640 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:59:14" (1/1) ... [2024-11-06 06:59:14,676 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 06:59:14,841 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.mul5.c[1244,1257] [2024-11-06 06:59:14,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 06:59:14,923 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 06:59:14,938 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.mul5.c[1244,1257] [2024-11-06 06:59:14,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 06:59:15,011 INFO L204 MainTranslator]: Completed translation [2024-11-06 06:59:15,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:59:15 WrapperNode [2024-11-06 06:59:15,012 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 06:59:15,013 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 06:59:15,014 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 06:59:15,014 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 06:59:15,020 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:59:15" (1/1) ... [2024-11-06 06:59:15,038 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:59:15" (1/1) ... [2024-11-06 06:59:15,065 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 269 [2024-11-06 06:59:15,066 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 06:59:15,067 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 06:59:15,067 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 06:59:15,067 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 06:59:15,076 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:59:15" (1/1) ... [2024-11-06 06:59:15,076 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:59:15" (1/1) ... [2024-11-06 06:59:15,081 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:59:15" (1/1) ... [2024-11-06 06:59:15,094 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2024-11-06 06:59:15,094 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:59:15" (1/1) ... [2024-11-06 06:59:15,094 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:59:15" (1/1) ... [2024-11-06 06:59:15,105 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:59:15" (1/1) ... [2024-11-06 06:59:15,132 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:59:15" (1/1) ... [2024-11-06 06:59:15,138 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:59:15" (1/1) ... [2024-11-06 06:59:15,140 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:59:15" (1/1) ... [2024-11-06 06:59:15,144 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 06:59:15,146 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 06:59:15,146 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 06:59:15,146 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 06:59:15,147 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:59:15" (1/1) ... [2024-11-06 06:59:15,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 06:59:15,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 06:59:15,174 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-06 06:59:15,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-06 06:59:15,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 06:59:15,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-06 06:59:15,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-06 06:59:15,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 06:59:15,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 06:59:15,295 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 06:59:15,296 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 06:59:15,718 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2024-11-06 06:59:15,718 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 06:59:15,735 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 06:59:15,739 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 06:59:15,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:59:15 BoogieIcfgContainer [2024-11-06 06:59:15,740 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 06:59:15,742 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 06:59:15,743 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 06:59:15,752 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 06:59:15,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 06:59:14" (1/3) ... [2024-11-06 06:59:15,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c1e43d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:59:15, skipping insertion in model container [2024-11-06 06:59:15,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:59:15" (2/3) ... [2024-11-06 06:59:15,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c1e43d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:59:15, skipping insertion in model container [2024-11-06 06:59:15,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:59:15" (3/3) ... [2024-11-06 06:59:15,756 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul5.c [2024-11-06 06:59:15,769 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 06:59:15,769 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 06:59:15,811 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 06:59:15,818 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;@3892805a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 06:59:15,818 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 06:59:15,821 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 06:59:15,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-06 06:59:15,825 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 06:59:15,826 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-06 06:59:15,826 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 06:59:15,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 06:59:15,831 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-06 06:59:15,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 06:59:15,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1201337663] [2024-11-06 06:59:15,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 06:59:15,846 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 06:59:15,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 06:59:15,849 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 06:59:15,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-06 06:59:15,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 06:59:15,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-06 06:59:16,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 06:59:16,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 06:59:16,181 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 06:59:16,181 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 06:59:16,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1201337663] [2024-11-06 06:59:16,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1201337663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 06:59:16,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 06:59:16,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 06:59:16,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43585886] [2024-11-06 06:59:16,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 06:59:16,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 06:59:16,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 06:59:16,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 06:59:16,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 06:59:16,206 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 06:59:16,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 06:59:16,365 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2024-11-06 06:59:16,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 06:59:16,370 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-06 06:59:16,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 06:59:16,376 INFO L225 Difference]: With dead ends: 17 [2024-11-06 06:59:16,377 INFO L226 Difference]: Without dead ends: 9 [2024-11-06 06:59:16,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 06:59:16,385 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 06:59:16,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 06:59:16,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-11-06 06:59:16,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-06 06:59:16,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 06:59:16,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-06 06:59:16,415 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-06 06:59:16,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 06:59:16,415 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-06 06:59:16,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 06:59:16,416 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-06 06:59:16,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-06 06:59:16,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 06:59:16,417 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-06 06:59:16,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-06 06:59:16,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 06:59:16,621 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 06:59:16,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 06:59:16,622 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-06 06:59:16,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 06:59:16,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1116725583] [2024-11-06 06:59:16,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 06:59:16,623 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 06:59:16,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 06:59:16,625 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 06:59:16,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-06 06:59:16,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 06:59:16,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-06 06:59:16,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 06:59:17,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 06:59:17,272 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 06:59:22,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 06:59:22,902 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 06:59:22,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1116725583] [2024-11-06 06:59:22,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1116725583] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 06:59:22,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 06:59:22,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-06 06:59:22,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356006488] [2024-11-06 06:59:22,903 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 06:59:22,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 06:59:22,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 06:59:22,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 06:59:22,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-06 06:59:22,906 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 06:59:23,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 06:59:23,267 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-11-06 06:59:23,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 06:59:23,279 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-06 06:59:23,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 06:59:23,280 INFO L225 Difference]: With dead ends: 14 [2024-11-06 06:59:23,280 INFO L226 Difference]: Without dead ends: 12 [2024-11-06 06:59:23,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-06 06:59:23,282 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 06:59:23,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 06:59:23,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-06 06:59:23,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-06 06:59:23,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 06:59:23,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-06 06:59:23,286 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-06 06:59:23,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 06:59:23,286 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-06 06:59:23,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 06:59:23,286 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-06 06:59:23,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-06 06:59:23,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 06:59:23,287 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-06 06:59:23,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-06 06:59:23,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 06:59:23,488 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 06:59:23,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 06:59:23,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-06 06:59:23,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 06:59:23,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [312347849] [2024-11-06 06:59:23,490 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 06:59:23,490 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 06:59:23,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 06:59:23,491 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 06:59:23,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-06 06:59:23,844 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 06:59:23,844 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-06 06:59:23,844 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-06 06:59:24,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 06:59:24,161 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-06 06:59:24,161 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-06 06:59:24,162 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 06:59:24,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-06 06:59:24,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 06:59:24,368 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1] [2024-11-06 06:59:24,410 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 06:59:24,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 06:59:24 BoogieIcfgContainer [2024-11-06 06:59:24,413 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 06:59:24,414 INFO L158 Benchmark]: Toolchain (without parser) took 9782.06ms. Allocated memory was 208.7MB in the beginning and 433.1MB in the end (delta: 224.4MB). Free memory was 151.8MB in the beginning and 370.2MB in the end (delta: -218.4MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2024-11-06 06:59:24,414 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 208.7MB. Free memory is still 161.1MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-06 06:59:24,415 INFO L158 Benchmark]: CACSL2BoogieTranslator took 377.94ms. Allocated memory is still 208.7MB. Free memory was 151.6MB in the beginning and 133.3MB in the end (delta: 18.2MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2024-11-06 06:59:24,415 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.65ms. Allocated memory is still 208.7MB. Free memory was 133.3MB in the beginning and 130.6MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-11-06 06:59:24,416 INFO L158 Benchmark]: Boogie Preprocessor took 78.05ms. Allocated memory was 208.7MB in the beginning and 360.7MB in the end (delta: 152.0MB). Free memory was 130.6MB in the beginning and 329.8MB in the end (delta: -199.2MB). Peak memory consumption was 10.0MB. Max. memory is 8.0GB. [2024-11-06 06:59:24,416 INFO L158 Benchmark]: RCFGBuilder took 594.43ms. Allocated memory is still 360.7MB. Free memory was 329.3MB in the beginning and 301.5MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2024-11-06 06:59:24,417 INFO L158 Benchmark]: TraceAbstraction took 8671.01ms. Allocated memory was 360.7MB in the beginning and 433.1MB in the end (delta: 72.4MB). Free memory was 301.0MB in the beginning and 370.2MB in the end (delta: -69.2MB). Peak memory consumption was 2.6MB. Max. memory is 8.0GB. [2024-11-06 06:59:24,418 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.13ms. Allocated memory is still 208.7MB. Free memory is still 161.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 377.94ms. Allocated memory is still 208.7MB. Free memory was 151.6MB in the beginning and 133.3MB in the end (delta: 18.2MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.65ms. Allocated memory is still 208.7MB. Free memory was 133.3MB in the beginning and 130.6MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 78.05ms. Allocated memory was 208.7MB in the beginning and 360.7MB in the end (delta: 152.0MB). Free memory was 130.6MB in the beginning and 329.8MB in the end (delta: -199.2MB). Peak memory consumption was 10.0MB. Max. memory is 8.0GB. * RCFGBuilder took 594.43ms. Allocated memory is still 360.7MB. Free memory was 329.3MB in the beginning and 301.5MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * TraceAbstraction took 8671.01ms. Allocated memory was 360.7MB in the beginning and 433.1MB in the end (delta: 72.4MB). Free memory was 301.0MB in the beginning and 370.2MB in the end (delta: -69.2MB). Peak memory consumption was 2.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a 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_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 32); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (32 - 1); [L32] const SORT_8 mask_SORT_8 = (SORT_8)-1 >> (sizeof(SORT_8) * 8 - 10); [L33] const SORT_8 msb_SORT_8 = (SORT_8)1 << (10 - 1); [L35] const SORT_14 mask_SORT_14 = (SORT_14)-1 >> (sizeof(SORT_14) * 8 - 64); [L36] const SORT_14 msb_SORT_14 = (SORT_14)1 << (64 - 1); [L38] const SORT_1 var_10 = 0; [L39] const SORT_14 var_15 = 0; [L40] const SORT_1 var_24 = 1; [L41] const SORT_5 var_28 = 0; [L42] const SORT_8 var_35 = 0; [L43] const SORT_5 var_57 = 1; [L44] const SORT_5 var_61 = 1000; [L45] const SORT_5 var_63 = 3735928559; [L46] const SORT_5 var_66 = 12245771; [L48] SORT_1 input_2; [L49] SORT_1 input_3; [L50] SORT_1 input_4; [L51] SORT_5 input_6; [L52] SORT_5 input_7; [L53] SORT_8 input_9; [L55] SORT_1 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L56] SORT_14 state_16 = __VERIFIER_nondet_ulong() & mask_SORT_14; [L57] SORT_14 state_18 = __VERIFIER_nondet_ulong() & mask_SORT_14; [L58] SORT_5 state_29 = __VERIFIER_nondet_uint() & mask_SORT_5; [L59] SORT_5 state_31 = __VERIFIER_nondet_uint() & mask_SORT_5; [L60] SORT_8 state_36 = __VERIFIER_nondet_ushort() & mask_SORT_8; [L61] SORT_1 state_38 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L62] SORT_1 state_40 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L63] SORT_5 state_42 = __VERIFIER_nondet_uint() & mask_SORT_5; [L64] SORT_5 state_44 = __VERIFIER_nondet_uint() & mask_SORT_5; [L66] SORT_1 init_12_arg_1 = var_10; [L67] state_11 = init_12_arg_1 [L68] SORT_14 init_17_arg_1 = var_15; [L69] state_16 = init_17_arg_1 [L70] SORT_14 init_19_arg_1 = var_15; [L71] state_18 = init_19_arg_1 [L72] SORT_5 init_30_arg_1 = var_28; [L73] state_29 = init_30_arg_1 [L74] SORT_5 init_32_arg_1 = var_28; [L75] state_31 = init_32_arg_1 [L76] SORT_8 init_37_arg_1 = var_35; [L77] state_36 = init_37_arg_1 [L78] SORT_1 init_39_arg_1 = var_24; [L79] state_38 = init_39_arg_1 [L80] SORT_1 init_41_arg_1 = var_24; [L81] state_40 = init_41_arg_1 [L82] SORT_5 init_43_arg_1 = var_28; [L83] state_42 = init_43_arg_1 [L84] SORT_5 init_45_arg_1 = var_28; [L85] state_44 = init_45_arg_1 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_57=1, var_61=1000, var_63=-559038737, var_66=12245771] [L88] input_2 = __VERIFIER_nondet_uchar() [L89] input_3 = __VERIFIER_nondet_uchar() [L90] input_3 = input_3 & mask_SORT_1 [L91] input_4 = __VERIFIER_nondet_uchar() [L92] input_4 = input_4 & mask_SORT_1 [L93] input_6 = __VERIFIER_nondet_uint() [L94] input_6 = input_6 & mask_SORT_5 [L95] input_7 = __VERIFIER_nondet_uint() [L96] input_7 = input_7 & mask_SORT_5 [L97] input_9 = __VERIFIER_nondet_ushort() [L100] SORT_1 var_13_arg_0 = state_11; [L101] SORT_1 var_13 = ~var_13_arg_0; [L102] SORT_14 var_20_arg_0 = state_16; [L103] SORT_14 var_20_arg_1 = state_18; [L104] SORT_1 var_20 = var_20_arg_0 == var_20_arg_1; [L105] SORT_1 var_21_arg_0 = var_13; [L106] SORT_1 var_21_arg_1 = var_20; [L107] SORT_1 var_21 = var_21_arg_0 | var_21_arg_1; [L108] SORT_1 var_25_arg_0 = var_21; [L109] SORT_1 var_25 = ~var_25_arg_0; [L110] SORT_1 var_26_arg_0 = var_24; [L111] SORT_1 var_26_arg_1 = var_25; [L112] SORT_1 var_26 = var_26_arg_0 & var_26_arg_1; [L113] var_26 = var_26 & mask_SORT_1 [L114] SORT_1 bad_27_arg_0 = var_26; [L115] CALL __VERIFIER_assert(!(bad_27_arg_0)) [L21] COND FALSE !(!(cond)) [L115] RET __VERIFIER_assert(!(bad_27_arg_0)) [L117] SORT_1 next_51_arg_1 = var_24; [L118] SORT_1 var_33_arg_0 = state_11; [L119] SORT_1 var_33 = ~var_33_arg_0; [L120] var_33 = var_33 & mask_SORT_1 [L121] SORT_5 var_52_arg_0 = state_29; [L122] var_52_arg_0 = var_52_arg_0 & mask_SORT_5 [L123] SORT_14 var_52 = var_52_arg_0; [L124] SORT_5 var_53_arg_0 = state_31; [L125] var_53_arg_0 = var_53_arg_0 & mask_SORT_5 [L126] SORT_14 var_53 = var_53_arg_0; [L127] SORT_14 var_54_arg_0 = var_52; [L128] SORT_14 var_54_arg_1 = var_53; [L129] SORT_14 var_54 = var_54_arg_0 * var_54_arg_1; [L130] SORT_1 var_55_arg_0 = var_33; [L131] SORT_14 var_55_arg_1 = var_15; [L132] SORT_14 var_55_arg_2 = var_54; [L133] SORT_14 var_55 = var_55_arg_0 ? var_55_arg_1 : var_55_arg_2; [L134] var_55 = var_55 & mask_SORT_14 [L135] SORT_14 next_56_arg_1 = var_55; [L136] SORT_1 var_70_arg_0 = state_38; [L137] SORT_1 var_70_arg_1 = state_40; [L138] SORT_1 var_70 = var_70_arg_0 | var_70_arg_1; [L139] var_70 = var_70 & mask_SORT_1 [L140] SORT_8 var_60_arg_0 = state_36; [L141] var_60_arg_0 = var_60_arg_0 & mask_SORT_8 [L142] SORT_5 var_60 = var_60_arg_0; [L143] SORT_5 var_62_arg_0 = var_60; [L144] SORT_5 var_62_arg_1 = var_61; [L145] SORT_1 var_62 = var_62_arg_0 > var_62_arg_1; [L146] SORT_5 var_64_arg_0 = input_6; [L147] SORT_5 var_64_arg_1 = var_63; [L148] SORT_1 var_64 = var_64_arg_0 == var_64_arg_1; [L149] SORT_1 var_65_arg_0 = var_62; [L150] SORT_1 var_65_arg_1 = var_64; [L151] SORT_1 var_65 = var_65_arg_0 & var_65_arg_1; [L152] SORT_5 var_67_arg_0 = input_7; [L153] SORT_5 var_67_arg_1 = var_66; [L154] SORT_1 var_67 = var_67_arg_0 == var_67_arg_1; [L155] SORT_1 var_68_arg_0 = var_65; [L156] SORT_1 var_68_arg_1 = var_67; [L157] SORT_1 var_68 = var_68_arg_0 & var_68_arg_1; [L158] var_68 = var_68 & mask_SORT_1 [L159] SORT_5 var_46_arg_0 = state_42; [L160] var_46_arg_0 = var_46_arg_0 & mask_SORT_5 [L161] SORT_14 var_46 = var_46_arg_0; [L162] SORT_5 var_47_arg_0 = state_44; [L163] var_47_arg_0 = var_47_arg_0 & mask_SORT_5 [L164] SORT_14 var_47 = var_47_arg_0; [L165] SORT_14 var_48_arg_0 = var_46; [L166] SORT_14 var_48_arg_1 = var_47; [L167] SORT_14 var_48 = var_48_arg_0 * var_48_arg_1; [L168] SORT_5 var_58_arg_0 = var_57; [L169] var_58_arg_0 = var_58_arg_0 & mask_SORT_5 [L170] SORT_14 var_58 = var_58_arg_0; [L171] SORT_14 var_59_arg_0 = var_48; [L172] SORT_14 var_59_arg_1 = var_58; [L173] SORT_14 var_59 = var_59_arg_0 + var_59_arg_1; [L174] SORT_1 var_69_arg_0 = var_68; [L175] SORT_14 var_69_arg_1 = var_59; [L176] SORT_14 var_69_arg_2 = var_48; [L177] SORT_14 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L178] SORT_1 var_71_arg_0 = var_70; [L179] SORT_14 var_71_arg_1 = var_69; [L180] SORT_14 var_71_arg_2 = state_18; [L181] SORT_14 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2; [L182] SORT_1 var_72_arg_0 = var_33; [L183] SORT_14 var_72_arg_1 = var_15; [L184] SORT_14 var_72_arg_2 = var_71; [L185] SORT_14 var_72 = var_72_arg_0 ? var_72_arg_1 : var_72_arg_2; [L186] var_72 = var_72 & mask_SORT_14 [L187] SORT_14 next_73_arg_1 = var_72; [L188] SORT_1 var_74_arg_0 = input_3; [L189] SORT_5 var_74_arg_1 = input_6; [L190] SORT_5 var_74_arg_2 = state_29; [L191] SORT_5 var_74 = var_74_arg_0 ? var_74_arg_1 : var_74_arg_2; [L192] SORT_1 var_75_arg_0 = var_33; [L193] SORT_5 var_75_arg_1 = var_28; [L194] SORT_5 var_75_arg_2 = var_74; [L195] SORT_5 var_75 = var_75_arg_0 ? var_75_arg_1 : var_75_arg_2; [L196] SORT_5 next_76_arg_1 = var_75; [L197] SORT_1 var_77_arg_0 = input_4; [L198] SORT_5 var_77_arg_1 = input_7; [L199] SORT_5 var_77_arg_2 = state_31; [L200] SORT_5 var_77 = var_77_arg_0 ? var_77_arg_1 : var_77_arg_2; [L201] SORT_1 var_78_arg_0 = var_33; [L202] SORT_5 var_78_arg_1 = var_28; [L203] SORT_5 var_78_arg_2 = var_77; [L204] SORT_5 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L205] SORT_5 next_79_arg_1 = var_78; [L206] SORT_1 var_80_arg_0 = var_33; [L207] SORT_8 var_80_arg_1 = input_9; [L208] SORT_8 var_80_arg_2 = state_36; [L209] SORT_8 var_80 = var_80_arg_0 ? var_80_arg_1 : var_80_arg_2; [L210] SORT_8 next_81_arg_1 = var_80; [L211] SORT_1 var_82_arg_0 = var_33; [L212] SORT_1 var_82_arg_1 = var_24; [L213] SORT_1 var_82_arg_2 = input_3; [L214] SORT_1 var_82 = var_82_arg_0 ? var_82_arg_1 : var_82_arg_2; [L215] SORT_1 next_83_arg_1 = var_82; [L216] SORT_1 var_84_arg_0 = var_33; [L217] SORT_1 var_84_arg_1 = var_24; [L218] SORT_1 var_84_arg_2 = input_4; [L219] SORT_1 var_84 = var_84_arg_0 ? var_84_arg_1 : var_84_arg_2; [L220] SORT_1 next_85_arg_1 = var_84; [L221] SORT_1 var_86_arg_0 = input_3; [L222] SORT_5 var_86_arg_1 = input_6; [L223] SORT_5 var_86_arg_2 = state_42; [L224] SORT_5 var_86 = var_86_arg_0 ? var_86_arg_1 : var_86_arg_2; [L225] SORT_1 var_87_arg_0 = var_33; [L226] SORT_5 var_87_arg_1 = var_28; [L227] SORT_5 var_87_arg_2 = var_86; [L228] SORT_5 var_87 = var_87_arg_0 ? var_87_arg_1 : var_87_arg_2; [L229] SORT_5 next_88_arg_1 = var_87; [L230] SORT_1 var_89_arg_0 = input_4; [L231] SORT_5 var_89_arg_1 = input_7; [L232] SORT_5 var_89_arg_2 = state_44; [L233] SORT_5 var_89 = var_89_arg_0 ? var_89_arg_1 : var_89_arg_2; [L234] SORT_1 var_90_arg_0 = var_33; [L235] SORT_5 var_90_arg_1 = var_28; [L236] SORT_5 var_90_arg_2 = var_89; [L237] SORT_5 var_90 = var_90_arg_0 ? var_90_arg_1 : var_90_arg_2; [L238] SORT_5 next_91_arg_1 = var_90; [L240] state_11 = next_51_arg_1 [L241] state_16 = next_56_arg_1 [L242] state_18 = next_73_arg_1 [L243] state_29 = next_76_arg_1 [L244] state_31 = next_79_arg_1 [L245] state_36 = next_81_arg_1 [L246] state_38 = next_83_arg_1 [L247] state_40 = next_85_arg_1 [L248] state_42 = next_88_arg_1 [L249] state_44 = next_91_arg_1 [L88] input_2 = __VERIFIER_nondet_uchar() [L89] input_3 = __VERIFIER_nondet_uchar() [L90] input_3 = input_3 & mask_SORT_1 [L91] input_4 = __VERIFIER_nondet_uchar() [L92] input_4 = input_4 & mask_SORT_1 [L93] input_6 = __VERIFIER_nondet_uint() [L94] input_6 = input_6 & mask_SORT_5 [L95] input_7 = __VERIFIER_nondet_uint() [L96] input_7 = input_7 & mask_SORT_5 [L97] input_9 = __VERIFIER_nondet_ushort() [L100] SORT_1 var_13_arg_0 = state_11; [L101] SORT_1 var_13 = ~var_13_arg_0; [L102] SORT_14 var_20_arg_0 = state_16; [L103] SORT_14 var_20_arg_1 = state_18; [L104] SORT_1 var_20 = var_20_arg_0 == var_20_arg_1; [L105] SORT_1 var_21_arg_0 = var_13; [L106] SORT_1 var_21_arg_1 = var_20; [L107] SORT_1 var_21 = var_21_arg_0 | var_21_arg_1; [L108] SORT_1 var_25_arg_0 = var_21; [L109] SORT_1 var_25 = ~var_25_arg_0; [L110] SORT_1 var_26_arg_0 = var_24; [L111] SORT_1 var_26_arg_1 = var_25; [L112] SORT_1 var_26 = var_26_arg_0 & var_26_arg_1; [L113] var_26 = var_26 & mask_SORT_1 [L114] SORT_1 bad_27_arg_0 = var_26; [L115] CALL __VERIFIER_assert(!(bad_27_arg_0)) [L21] COND FALSE !(!(cond)) [L115] RET __VERIFIER_assert(!(bad_27_arg_0)) [L117] SORT_1 next_51_arg_1 = var_24; [L118] SORT_1 var_33_arg_0 = state_11; [L119] SORT_1 var_33 = ~var_33_arg_0; [L120] var_33 = var_33 & mask_SORT_1 [L121] SORT_5 var_52_arg_0 = state_29; [L122] var_52_arg_0 = var_52_arg_0 & mask_SORT_5 [L123] SORT_14 var_52 = var_52_arg_0; [L124] SORT_5 var_53_arg_0 = state_31; [L125] var_53_arg_0 = var_53_arg_0 & mask_SORT_5 [L126] SORT_14 var_53 = var_53_arg_0; [L127] SORT_14 var_54_arg_0 = var_52; [L128] SORT_14 var_54_arg_1 = var_53; [L129] SORT_14 var_54 = var_54_arg_0 * var_54_arg_1; [L130] SORT_1 var_55_arg_0 = var_33; [L131] SORT_14 var_55_arg_1 = var_15; [L132] SORT_14 var_55_arg_2 = var_54; [L133] SORT_14 var_55 = var_55_arg_0 ? var_55_arg_1 : var_55_arg_2; [L134] var_55 = var_55 & mask_SORT_14 [L135] SORT_14 next_56_arg_1 = var_55; [L136] SORT_1 var_70_arg_0 = state_38; [L137] SORT_1 var_70_arg_1 = state_40; [L138] SORT_1 var_70 = var_70_arg_0 | var_70_arg_1; [L139] var_70 = var_70 & mask_SORT_1 [L140] SORT_8 var_60_arg_0 = state_36; [L141] var_60_arg_0 = var_60_arg_0 & mask_SORT_8 [L142] SORT_5 var_60 = var_60_arg_0; [L143] SORT_5 var_62_arg_0 = var_60; [L144] SORT_5 var_62_arg_1 = var_61; [L145] SORT_1 var_62 = var_62_arg_0 > var_62_arg_1; [L146] SORT_5 var_64_arg_0 = input_6; [L147] SORT_5 var_64_arg_1 = var_63; [L148] SORT_1 var_64 = var_64_arg_0 == var_64_arg_1; [L149] SORT_1 var_65_arg_0 = var_62; [L150] SORT_1 var_65_arg_1 = var_64; [L151] SORT_1 var_65 = var_65_arg_0 & var_65_arg_1; [L152] SORT_5 var_67_arg_0 = input_7; [L153] SORT_5 var_67_arg_1 = var_66; [L154] SORT_1 var_67 = var_67_arg_0 == var_67_arg_1; [L155] SORT_1 var_68_arg_0 = var_65; [L156] SORT_1 var_68_arg_1 = var_67; [L157] SORT_1 var_68 = var_68_arg_0 & var_68_arg_1; [L158] var_68 = var_68 & mask_SORT_1 [L159] SORT_5 var_46_arg_0 = state_42; [L160] var_46_arg_0 = var_46_arg_0 & mask_SORT_5 [L161] SORT_14 var_46 = var_46_arg_0; [L162] SORT_5 var_47_arg_0 = state_44; [L163] var_47_arg_0 = var_47_arg_0 & mask_SORT_5 [L164] SORT_14 var_47 = var_47_arg_0; [L165] SORT_14 var_48_arg_0 = var_46; [L166] SORT_14 var_48_arg_1 = var_47; [L167] SORT_14 var_48 = var_48_arg_0 * var_48_arg_1; [L168] SORT_5 var_58_arg_0 = var_57; [L169] var_58_arg_0 = var_58_arg_0 & mask_SORT_5 [L170] SORT_14 var_58 = var_58_arg_0; [L171] SORT_14 var_59_arg_0 = var_48; [L172] SORT_14 var_59_arg_1 = var_58; [L173] SORT_14 var_59 = var_59_arg_0 + var_59_arg_1; [L174] SORT_1 var_69_arg_0 = var_68; [L175] SORT_14 var_69_arg_1 = var_59; [L176] SORT_14 var_69_arg_2 = var_48; [L177] SORT_14 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L178] SORT_1 var_71_arg_0 = var_70; [L179] SORT_14 var_71_arg_1 = var_69; [L180] SORT_14 var_71_arg_2 = state_18; [L181] SORT_14 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2; [L182] SORT_1 var_72_arg_0 = var_33; [L183] SORT_14 var_72_arg_1 = var_15; [L184] SORT_14 var_72_arg_2 = var_71; [L185] SORT_14 var_72 = var_72_arg_0 ? var_72_arg_1 : var_72_arg_2; [L186] var_72 = var_72 & mask_SORT_14 [L187] SORT_14 next_73_arg_1 = var_72; [L188] SORT_1 var_74_arg_0 = input_3; [L189] SORT_5 var_74_arg_1 = input_6; [L190] SORT_5 var_74_arg_2 = state_29; [L191] SORT_5 var_74 = var_74_arg_0 ? var_74_arg_1 : var_74_arg_2; [L192] SORT_1 var_75_arg_0 = var_33; [L193] SORT_5 var_75_arg_1 = var_28; [L194] SORT_5 var_75_arg_2 = var_74; [L195] SORT_5 var_75 = var_75_arg_0 ? var_75_arg_1 : var_75_arg_2; [L196] SORT_5 next_76_arg_1 = var_75; [L197] SORT_1 var_77_arg_0 = input_4; [L198] SORT_5 var_77_arg_1 = input_7; [L199] SORT_5 var_77_arg_2 = state_31; [L200] SORT_5 var_77 = var_77_arg_0 ? var_77_arg_1 : var_77_arg_2; [L201] SORT_1 var_78_arg_0 = var_33; [L202] SORT_5 var_78_arg_1 = var_28; [L203] SORT_5 var_78_arg_2 = var_77; [L204] SORT_5 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L205] SORT_5 next_79_arg_1 = var_78; [L206] SORT_1 var_80_arg_0 = var_33; [L207] SORT_8 var_80_arg_1 = input_9; [L208] SORT_8 var_80_arg_2 = state_36; [L209] SORT_8 var_80 = var_80_arg_0 ? var_80_arg_1 : var_80_arg_2; [L210] SORT_8 next_81_arg_1 = var_80; [L211] SORT_1 var_82_arg_0 = var_33; [L212] SORT_1 var_82_arg_1 = var_24; [L213] SORT_1 var_82_arg_2 = input_3; [L214] SORT_1 var_82 = var_82_arg_0 ? var_82_arg_1 : var_82_arg_2; [L215] SORT_1 next_83_arg_1 = var_82; [L216] SORT_1 var_84_arg_0 = var_33; [L217] SORT_1 var_84_arg_1 = var_24; [L218] SORT_1 var_84_arg_2 = input_4; [L219] SORT_1 var_84 = var_84_arg_0 ? var_84_arg_1 : var_84_arg_2; [L220] SORT_1 next_85_arg_1 = var_84; [L221] SORT_1 var_86_arg_0 = input_3; [L222] SORT_5 var_86_arg_1 = input_6; [L223] SORT_5 var_86_arg_2 = state_42; [L224] SORT_5 var_86 = var_86_arg_0 ? var_86_arg_1 : var_86_arg_2; [L225] SORT_1 var_87_arg_0 = var_33; [L226] SORT_5 var_87_arg_1 = var_28; [L227] SORT_5 var_87_arg_2 = var_86; [L228] SORT_5 var_87 = var_87_arg_0 ? var_87_arg_1 : var_87_arg_2; [L229] SORT_5 next_88_arg_1 = var_87; [L230] SORT_1 var_89_arg_0 = input_4; [L231] SORT_5 var_89_arg_1 = input_7; [L232] SORT_5 var_89_arg_2 = state_44; [L233] SORT_5 var_89 = var_89_arg_0 ? var_89_arg_1 : var_89_arg_2; [L234] SORT_1 var_90_arg_0 = var_33; [L235] SORT_5 var_90_arg_1 = var_28; [L236] SORT_5 var_90_arg_2 = var_89; [L237] SORT_5 var_90 = var_90_arg_0 ? var_90_arg_1 : var_90_arg_2; [L238] SORT_5 next_91_arg_1 = var_90; [L240] state_11 = next_51_arg_1 [L241] state_16 = next_56_arg_1 [L242] state_18 = next_73_arg_1 [L243] state_29 = next_76_arg_1 [L244] state_31 = next_79_arg_1 [L245] state_36 = next_81_arg_1 [L246] state_38 = next_83_arg_1 [L247] state_40 = next_85_arg_1 [L248] state_42 = next_88_arg_1 [L249] state_44 = next_91_arg_1 [L88] input_2 = __VERIFIER_nondet_uchar() [L89] input_3 = __VERIFIER_nondet_uchar() [L90] input_3 = input_3 & mask_SORT_1 [L91] input_4 = __VERIFIER_nondet_uchar() [L92] input_4 = input_4 & mask_SORT_1 [L93] input_6 = __VERIFIER_nondet_uint() [L94] input_6 = input_6 & mask_SORT_5 [L95] input_7 = __VERIFIER_nondet_uint() [L96] input_7 = input_7 & mask_SORT_5 [L97] input_9 = __VERIFIER_nondet_ushort() [L100] SORT_1 var_13_arg_0 = state_11; [L101] SORT_1 var_13 = ~var_13_arg_0; [L102] SORT_14 var_20_arg_0 = state_16; [L103] SORT_14 var_20_arg_1 = state_18; [L104] SORT_1 var_20 = var_20_arg_0 == var_20_arg_1; [L105] SORT_1 var_21_arg_0 = var_13; [L106] SORT_1 var_21_arg_1 = var_20; [L107] SORT_1 var_21 = var_21_arg_0 | var_21_arg_1; [L108] SORT_1 var_25_arg_0 = var_21; [L109] SORT_1 var_25 = ~var_25_arg_0; [L110] SORT_1 var_26_arg_0 = var_24; [L111] SORT_1 var_26_arg_1 = var_25; [L112] SORT_1 var_26 = var_26_arg_0 & var_26_arg_1; [L113] var_26 = var_26 & mask_SORT_1 [L114] SORT_1 bad_27_arg_0 = var_26; [L115] CALL __VERIFIER_assert(!(bad_27_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.6s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 33 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 32 IncrementalHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 9 mSDtfsCounter, 32 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=2, InterpolantAutomatonStates: 11, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 18 ConstructedInterpolants, 4 QuantifiedInterpolants, 754 SizeOfPredicates, 25 NumberOfNonLiveVariables, 187 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-06 06:59:24,473 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...