/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 21:43:54,129 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 21:43:54,190 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf [2023-12-16 21:43:54,200 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 21:43:54,200 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 21:43:54,221 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 21:43:54,221 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 21:43:54,222 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 21:43:54,222 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 21:43:54,222 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 21:43:54,223 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 21:43:54,223 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 21:43:54,226 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 21:43:54,230 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 21:43:54,230 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 21:43:54,231 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 21:43:54,232 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 21:43:54,232 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 21:43:54,232 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 21:43:54,232 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 21:43:54,233 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 21:43:54,233 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 21:43:54,233 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 21:43:54,233 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 21:43:54,234 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 21:43:54,234 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 21:43:54,234 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 21:43:54,234 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 21:43:54,235 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 21:43:54,235 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 21:43:54,236 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 21:43:54,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 21:43:54,236 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 21:43:54,236 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 21:43:54,236 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 21:43:54,237 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 21:43:54,237 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 21:43:54,237 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 21:43:54,237 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 21:43:54,237 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 21:43:54,237 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 21:43:54,238 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 21:43:54,238 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 21:43:54,238 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 [2023-12-16 21:43:54,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 21:43:54,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 21:43:54,429 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 21:43:54,430 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 21:43:54,431 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 21:43:54,431 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v5.c [2023-12-16 21:43:55,466 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 21:43:55,645 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 21:43:55,646 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v5.c [2023-12-16 21:43:55,661 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99ef48d95/2fd720d72e364fb58d070ad8b58a8663/FLAGcde4b9aef [2023-12-16 21:43:55,674 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99ef48d95/2fd720d72e364fb58d070ad8b58a8663 [2023-12-16 21:43:55,676 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 21:43:55,677 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 21:43:55,680 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 21:43:55,680 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 21:43:55,684 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 21:43:55,684 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 09:43:55" (1/1) ... [2023-12-16 21:43:55,685 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c9e0d5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:43:55, skipping insertion in model container [2023-12-16 21:43:55,685 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 09:43:55" (1/1) ... [2023-12-16 21:43:55,719 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 21:43:55,822 WARN L239 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.eq_sdp_v5.c[1249,1262] [2023-12-16 21:43:55,886 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 21:43:55,898 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 21:43:55,908 WARN L239 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.eq_sdp_v5.c[1249,1262] [2023-12-16 21:43:55,938 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 21:43:55,954 INFO L206 MainTranslator]: Completed translation [2023-12-16 21:43:55,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:43:55 WrapperNode [2023-12-16 21:43:55,957 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 21:43:55,958 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 21:43:55,958 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 21:43:55,958 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 21:43:55,963 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:43:55" (1/1) ... [2023-12-16 21:43:55,985 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:43:55" (1/1) ... [2023-12-16 21:43:56,005 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 250 [2023-12-16 21:43:56,005 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 21:43:56,006 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 21:43:56,006 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 21:43:56,006 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 21:43:56,013 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:43:55" (1/1) ... [2023-12-16 21:43:56,013 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:43:55" (1/1) ... [2023-12-16 21:43:56,016 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:43:55" (1/1) ... [2023-12-16 21:43:56,025 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]. [2023-12-16 21:43:56,025 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:43:55" (1/1) ... [2023-12-16 21:43:56,025 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:43:55" (1/1) ... [2023-12-16 21:43:56,030 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:43:55" (1/1) ... [2023-12-16 21:43:56,032 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:43:55" (1/1) ... [2023-12-16 21:43:56,033 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:43:55" (1/1) ... [2023-12-16 21:43:56,034 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:43:55" (1/1) ... [2023-12-16 21:43:56,036 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 21:43:56,036 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 21:43:56,037 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 21:43:56,037 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 21:43:56,037 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:43:55" (1/1) ... [2023-12-16 21:43:56,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 21:43:56,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 21:43:56,072 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) [2023-12-16 21:43:56,076 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 [2023-12-16 21:43:56,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 21:43:56,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 21:43:56,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 21:43:56,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 21:43:56,168 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 21:43:56,169 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 21:43:56,344 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 21:43:56,367 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 21:43:56,367 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 21:43:56,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 09:43:56 BoogieIcfgContainer [2023-12-16 21:43:56,368 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 21:43:56,369 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 21:43:56,369 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 21:43:56,371 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 21:43:56,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 09:43:55" (1/3) ... [2023-12-16 21:43:56,372 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b33bf5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 09:43:56, skipping insertion in model container [2023-12-16 21:43:56,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:43:55" (2/3) ... [2023-12-16 21:43:56,372 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b33bf5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 09:43:56, skipping insertion in model container [2023-12-16 21:43:56,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 09:43:56" (3/3) ... [2023-12-16 21:43:56,373 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.eq_sdp_v5.c [2023-12-16 21:43:56,405 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 21:43:56,405 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 21:43:56,440 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 21:43:56,445 INFO L357 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, mHoare=true, 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;@1df1759a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 21:43:56,445 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 21:43:56,449 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 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) [2023-12-16 21:43:56,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-16 21:43:56,453 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 21:43:56,456 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-16 21:43:56,458 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 21:43:56,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 21:43:56,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1827279, now seen corresponding path program 1 times [2023-12-16 21:43:56,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 21:43:56,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1384068265] [2023-12-16 21:43:56,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 21:43:56,472 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 [2023-12-16 21:43:56,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 21:43:56,484 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) [2023-12-16 21:43:56,560 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 [2023-12-16 21:43:56,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 21:43:56,638 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-16 21:43:56,642 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 21:43:56,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 21:43:56,808 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 21:43:56,808 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 21:43:56,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1384068265] [2023-12-16 21:43:56,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1384068265] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 21:43:56,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 21:43:56,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 21:43:56,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637580782] [2023-12-16 21:43:56,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 21:43:56,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 21:43:56,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 21:43:56,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 21:43:56,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 21:43:56,839 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 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) [2023-12-16 21:43:56,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 21:43:56,884 INFO L93 Difference]: Finished difference Result 16 states and 24 transitions. [2023-12-16 21:43:56,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 21:43:56,886 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 [2023-12-16 21:43:56,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 21:43:56,891 INFO L225 Difference]: With dead ends: 16 [2023-12-16 21:43:56,891 INFO L226 Difference]: Without dead ends: 9 [2023-12-16 21:43:56,893 INFO L412 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 [2023-12-16 21:43:56,896 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 3 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 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 [2023-12-16 21:43:56,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 21:43:56,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2023-12-16 21:43:56,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2023-12-16 21:43:56,916 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) [2023-12-16 21:43:56,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2023-12-16 21:43:56,917 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2023-12-16 21:43:56,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 21:43:56,917 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2023-12-16 21:43:56,918 INFO L496 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) [2023-12-16 21:43:56,918 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2023-12-16 21:43:56,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-16 21:43:56,918 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 21:43:56,918 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2023-12-16 21:43:56,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-16 21:43:57,120 WARN L477 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 [2023-12-16 21:43:57,121 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 21:43:57,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 21:43:57,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1393329571, now seen corresponding path program 1 times [2023-12-16 21:43:57,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 21:43:57,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1955602609] [2023-12-16 21:43:57,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 21:43:57,124 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 [2023-12-16 21:43:57,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 21:43:57,125 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) [2023-12-16 21:43:57,154 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 [2023-12-16 21:43:57,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 21:43:57,300 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 48 conjunts are in the unsatisfiable core [2023-12-16 21:43:57,303 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 21:43:57,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 21:43:57,639 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 21:43:58,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 21:43:58,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 21:43:58,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1955602609] [2023-12-16 21:43:58,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1955602609] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 21:43:58,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 21:43:58,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-16 21:43:58,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921662771] [2023-12-16 21:43:58,292 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 21:43:58,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 21:43:58,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 21:43:58,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 21:43:58,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-12-16 21:43:58,294 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 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) [2023-12-16 21:43:58,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 21:43:58,405 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2023-12-16 21:43:58,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 21:43:58,406 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 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 [2023-12-16 21:43:58,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 21:43:58,407 INFO L225 Difference]: With dead ends: 14 [2023-12-16 21:43:58,407 INFO L226 Difference]: Without dead ends: 12 [2023-12-16 21:43:58,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-12-16 21:43:58,408 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 6 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 21:43:58,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 16 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 21:43:58,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-12-16 21:43:58,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2023-12-16 21:43:58,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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) [2023-12-16 21:43:58,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2023-12-16 21:43:58,411 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2023-12-16 21:43:58,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 21:43:58,411 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2023-12-16 21:43:58,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 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) [2023-12-16 21:43:58,411 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2023-12-16 21:43:58,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-16 21:43:58,411 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 21:43:58,412 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2023-12-16 21:43:58,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-16 21:43:58,612 WARN L477 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 [2023-12-16 21:43:58,613 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 21:43:58,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 21:43:58,614 INFO L85 PathProgramCache]: Analyzing trace with hash -2112524529, now seen corresponding path program 2 times [2023-12-16 21:43:58,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 21:43:58,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2112046755] [2023-12-16 21:43:58,616 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 21:43:58,616 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 [2023-12-16 21:43:58,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 21:43:58,619 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) [2023-12-16 21:43:58,621 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 [2023-12-16 21:43:58,776 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 21:43:58,776 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 21:43:58,780 INFO L262 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 76 conjunts are in the unsatisfiable core [2023-12-16 21:43:58,784 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 21:43:59,159 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 21:43:59,159 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 21:44:02,377 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 21:44:02,378 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 21:44:02,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2112046755] [2023-12-16 21:44:02,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2112046755] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 21:44:02,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 21:44:02,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-16 21:44:02,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085788682] [2023-12-16 21:44:02,378 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 21:44:02,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 21:44:02,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 21:44:02,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 21:44:02,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-12-16 21:44:02,380 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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) [2023-12-16 21:44:02,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 21:44:02,592 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2023-12-16 21:44:02,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 21:44:02,593 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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 10 [2023-12-16 21:44:02,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 21:44:02,593 INFO L225 Difference]: With dead ends: 17 [2023-12-16 21:44:02,593 INFO L226 Difference]: Without dead ends: 15 [2023-12-16 21:44:02,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2023-12-16 21:44:02,594 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 18 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 21:44:02,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 12 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 21:44:02,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-12-16 21:44:02,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2023-12-16 21:44:02,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 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) [2023-12-16 21:44:02,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2023-12-16 21:44:02,597 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 10 [2023-12-16 21:44:02,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 21:44:02,598 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2023-12-16 21:44:02,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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) [2023-12-16 21:44:02,598 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2023-12-16 21:44:02,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-16 21:44:02,598 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 21:44:02,598 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2023-12-16 21:44:02,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-16 21:44:02,802 WARN L477 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 [2023-12-16 21:44:02,802 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 21:44:02,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 21:44:02,803 INFO L85 PathProgramCache]: Analyzing trace with hash -57678563, now seen corresponding path program 3 times [2023-12-16 21:44:02,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 21:44:02,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [647001090] [2023-12-16 21:44:02,803 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 21:44:02,804 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 [2023-12-16 21:44:02,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 21:44:02,805 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 21:44:02,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-16 21:44:03,051 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-16 21:44:03,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-12-16 21:44:03,051 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 21:44:03,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 21:44:03,334 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-16 21:44:03,334 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 21:44:03,335 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 21:44:03,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-16 21:44:03,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 21:44:03,545 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-12-16 21:44:03,547 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 21:44:03,576 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 21:44:03,577 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 21:44:03,577 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 21:44:03,577 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 21:44:03,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 09:44:03 BoogieIcfgContainer [2023-12-16 21:44:03,592 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 21:44:03,592 INFO L158 Benchmark]: Toolchain (without parser) took 7915.12ms. Allocated memory was 330.3MB in the beginning and 476.1MB in the end (delta: 145.8MB). Free memory was 277.7MB in the beginning and 288.1MB in the end (delta: -10.4MB). Peak memory consumption was 135.4MB. Max. memory is 8.0GB. [2023-12-16 21:44:03,592 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 232.8MB. Free memory is still 180.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 21:44:03,593 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.16ms. Allocated memory is still 330.3MB. Free memory was 277.4MB in the beginning and 261.6MB in the end (delta: 15.8MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-16 21:44:03,593 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.20ms. Allocated memory is still 330.3MB. Free memory was 261.6MB in the beginning and 258.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 21:44:03,593 INFO L158 Benchmark]: Boogie Preprocessor took 30.50ms. Allocated memory is still 330.3MB. Free memory was 258.9MB in the beginning and 255.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 21:44:03,593 INFO L158 Benchmark]: RCFGBuilder took 331.29ms. Allocated memory is still 330.3MB. Free memory was 255.8MB in the beginning and 230.6MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2023-12-16 21:44:03,594 INFO L158 Benchmark]: TraceAbstraction took 7222.71ms. Allocated memory was 330.3MB in the beginning and 476.1MB in the end (delta: 145.8MB). Free memory was 229.9MB in the beginning and 288.1MB in the end (delta: -58.2MB). Peak memory consumption was 87.1MB. Max. memory is 8.0GB. [2023-12-16 21:44:03,595 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 232.8MB. Free memory is still 180.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 277.16ms. Allocated memory is still 330.3MB. Free memory was 277.4MB in the beginning and 261.6MB in the end (delta: 15.8MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.20ms. Allocated memory is still 330.3MB. Free memory was 261.6MB in the beginning and 258.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.50ms. Allocated memory is still 330.3MB. Free memory was 258.9MB in the beginning and 255.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 331.29ms. Allocated memory is still 330.3MB. Free memory was 255.8MB in the beginning and 230.6MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 7222.71ms. Allocated memory was 330.3MB in the beginning and 476.1MB in the end (delta: 145.8MB). Free memory was 229.9MB in the beginning and 288.1MB in the end (delta: -58.2MB). Peak memory consumption was 87.1MB. 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 - 8); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (8 - 1); [L29] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 1); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (1 - 1); [L32] const SORT_1 var_9 = 0; [L33] const SORT_5 var_17 = 1; [L34] const SORT_5 var_29 = 0; [L35] const SORT_1 var_75 = 1; [L37] SORT_1 input_2; [L38] SORT_1 input_3; [L39] SORT_1 input_4; [L40] SORT_5 input_6; [L41] SORT_5 input_7; [L42] SORT_5 input_8; [L43] SORT_5 input_27; [L45] SORT_1 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L46] SORT_1 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L47] SORT_1 state_21 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L48] SORT_1 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L49] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L50] SORT_5 state_30 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L51] SORT_1 state_32 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L52] SORT_5 state_34 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L53] SORT_1 state_36 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L54] SORT_1 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L55] SORT_1 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] SORT_1 init_11_arg_1 = var_9; [L58] state_10 = init_11_arg_1 [L59] SORT_1 init_13_arg_1 = var_9; [L60] state_12 = init_13_arg_1 [L61] SORT_1 init_22_arg_1 = var_9; [L62] state_21 = init_22_arg_1 [L63] SORT_1 init_24_arg_1 = var_9; [L64] state_23 = init_24_arg_1 [L65] SORT_1 init_26_arg_1 = var_9; [L66] state_25 = init_26_arg_1 [L67] SORT_5 init_31_arg_1 = var_29; [L68] state_30 = init_31_arg_1 [L69] SORT_1 init_33_arg_1 = var_9; [L70] state_32 = init_33_arg_1 [L71] SORT_5 init_35_arg_1 = var_29; [L72] state_34 = init_35_arg_1 [L73] SORT_1 init_37_arg_1 = var_9; [L74] state_36 = init_37_arg_1 [L75] SORT_1 init_40_arg_1 = var_9; [L76] state_39 = init_40_arg_1 [L77] SORT_1 init_42_arg_1 = var_9; [L78] state_41 = init_42_arg_1 VAL [init_11_arg_1=0, init_13_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_31_arg_1=0, init_33_arg_1=0, init_35_arg_1=0, init_37_arg_1=0, init_40_arg_1=0, init_42_arg_1=0, mask_SORT_1=255, mask_SORT_5=1, msb_SORT_1=128, msb_SORT_5=1, state_10=0, state_12=0, state_21=0, state_23=0, state_25=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, var_17=1, var_29=0, var_75=1, var_9=0] [L81] input_2 = __VERIFIER_nondet_uchar() [L82] input_3 = __VERIFIER_nondet_uchar() [L83] input_4 = __VERIFIER_nondet_uchar() [L84] input_6 = __VERIFIER_nondet_uchar() [L85] input_7 = __VERIFIER_nondet_uchar() [L86] input_7 = input_7 & mask_SORT_5 [L87] input_8 = __VERIFIER_nondet_uchar() [L88] input_8 = input_8 & mask_SORT_5 [L89] input_27 = __VERIFIER_nondet_uchar() [L92] SORT_1 var_14_arg_0 = state_10; [L93] SORT_1 var_14_arg_1 = state_12; [L94] SORT_5 var_14 = var_14_arg_0 == var_14_arg_1; [L95] SORT_5 var_18_arg_0 = var_14; [L96] SORT_5 var_18 = ~var_18_arg_0; [L97] SORT_5 var_19_arg_0 = var_17; [L98] SORT_5 var_19_arg_1 = var_18; [L99] SORT_5 var_19 = var_19_arg_0 & var_19_arg_1; [L100] var_19 = var_19 & mask_SORT_5 [L101] SORT_5 bad_20_arg_0 = var_19; [L102] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L102] RET __VERIFIER_assert(!(bad_20_arg_0)) [L104] SORT_5 var_52_arg_0 = input_8; [L105] SORT_5 var_52_arg_1 = var_17; [L106] SORT_5 var_52 = var_52_arg_0 == var_52_arg_1; [L107] SORT_5 var_53_arg_0 = var_52; [L108] SORT_1 var_53_arg_1 = var_9; [L109] SORT_1 var_53_arg_2 = state_41; [L110] SORT_1 var_53 = var_53_arg_0 ? var_53_arg_1 : var_53_arg_2; [L111] var_53 = var_53 & mask_SORT_1 [L112] SORT_1 next_54_arg_1 = var_53; [L113] SORT_5 var_58_arg_0 = input_8; [L114] SORT_5 var_58_arg_1 = var_17; [L115] SORT_5 var_58 = var_58_arg_0 == var_58_arg_1; [L116] SORT_1 var_56_arg_0 = state_36; [L117] SORT_1 var_56_arg_1 = state_32; [L118] SORT_1 var_56 = var_56_arg_0 - var_56_arg_1; [L119] SORT_1 var_55_arg_0 = state_36; [L120] SORT_1 var_55_arg_1 = state_32; [L121] SORT_1 var_55 = var_55_arg_0 - var_55_arg_1; [L122] SORT_5 var_57_arg_0 = state_34; [L123] SORT_1 var_57_arg_1 = var_56; [L124] SORT_1 var_57_arg_2 = var_55; [L125] SORT_1 var_57 = var_57_arg_0 ? var_57_arg_1 : var_57_arg_2; [L126] SORT_5 var_59_arg_0 = var_58; [L127] SORT_1 var_59_arg_1 = var_9; [L128] SORT_1 var_59_arg_2 = var_57; [L129] SORT_1 var_59 = var_59_arg_0 ? var_59_arg_1 : var_59_arg_2; [L130] var_59 = var_59 & mask_SORT_1 [L131] SORT_1 next_60_arg_1 = var_59; [L132] SORT_5 var_61_arg_0 = var_58; [L133] SORT_1 var_61_arg_1 = var_9; [L134] SORT_1 var_61_arg_2 = input_2; [L135] SORT_1 var_61 = var_61_arg_0 ? var_61_arg_1 : var_61_arg_2; [L136] SORT_1 next_62_arg_1 = var_61; [L137] SORT_5 var_63_arg_0 = var_58; [L138] SORT_1 var_63_arg_1 = var_9; [L139] SORT_1 var_63_arg_2 = input_3; [L140] SORT_1 var_63 = var_63_arg_0 ? var_63_arg_1 : var_63_arg_2; [L141] SORT_1 next_64_arg_1 = var_63; [L142] SORT_5 var_65_arg_0 = var_58; [L143] SORT_1 var_65_arg_1 = var_9; [L144] SORT_1 var_65_arg_2 = input_4; [L145] SORT_1 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L146] SORT_1 next_66_arg_1 = var_65; [L147] SORT_5 var_67_arg_0 = var_58; [L148] SORT_5 var_67_arg_1 = var_29; [L149] SORT_5 var_67_arg_2 = input_7; [L150] SORT_5 var_67 = var_67_arg_0 ? var_67_arg_1 : var_67_arg_2; [L151] SORT_5 next_68_arg_1 = var_67; [L152] SORT_5 var_69_arg_0 = var_58; [L153] SORT_1 var_69_arg_1 = var_9; [L154] SORT_1 var_69_arg_2 = state_25; [L155] SORT_1 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L156] SORT_1 next_70_arg_1 = var_69; [L157] SORT_5 var_71_arg_0 = var_58; [L158] SORT_5 var_71_arg_1 = var_29; [L159] SORT_5 var_71_arg_2 = state_30; [L160] SORT_5 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2; [L161] var_71 = var_71 & mask_SORT_5 [L162] SORT_5 next_72_arg_1 = var_71; [L163] SORT_1 var_76_arg_0 = state_21; [L164] SORT_1 var_76_arg_1 = var_75; [L165] SORT_1 var_76 = var_76_arg_0 & var_76_arg_1; [L166] var_76 = var_76 & mask_SORT_1 [L167] SORT_1 var_77_arg_0 = var_76; [L168] SORT_1 var_77_arg_1 = var_75; [L169] SORT_5 var_77 = var_77_arg_0 == var_77_arg_1; [L170] SORT_1 var_74_arg_0 = state_21; [L171] SORT_1 var_74_arg_1 = state_23; [L172] SORT_1 var_74 = var_74_arg_0 + var_74_arg_1; [L173] SORT_1 var_73_arg_0 = state_21; [L174] SORT_1 var_73_arg_1 = state_23; [L175] SORT_1 var_73 = var_73_arg_0 - var_73_arg_1; [L176] SORT_5 var_78_arg_0 = var_77; [L177] SORT_1 var_78_arg_1 = var_74; [L178] SORT_1 var_78_arg_2 = var_73; [L179] SORT_1 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L180] SORT_5 var_79_arg_0 = var_58; [L181] SORT_1 var_79_arg_1 = var_9; [L182] SORT_1 var_79_arg_2 = var_78; [L183] SORT_1 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L184] SORT_1 next_80_arg_1 = var_79; [L185] SORT_1 var_45_arg_0 = input_2; [L186] SORT_5 var_45 = var_45_arg_0 >> 0; [L187] var_45 = var_45 & mask_SORT_5 [L188] SORT_1 var_44_arg_0 = input_2; [L189] SORT_1 var_44_arg_1 = input_3; [L190] SORT_1 var_44 = var_44_arg_0 + var_44_arg_1; [L191] SORT_1 var_43_arg_0 = input_2; [L192] SORT_1 var_43_arg_1 = input_3; [L193] SORT_1 var_43 = var_43_arg_0 - var_43_arg_1; [L194] SORT_5 var_46_arg_0 = var_45; [L195] SORT_1 var_46_arg_1 = var_44; [L196] SORT_1 var_46_arg_2 = var_43; [L197] SORT_1 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; [L198] SORT_1 var_48_arg_0 = var_46; [L199] SORT_1 var_48_arg_1 = input_4; [L200] SORT_1 var_48 = var_48_arg_0 + var_48_arg_1; [L201] SORT_1 var_47_arg_0 = var_46; [L202] SORT_1 var_47_arg_1 = input_4; [L203] SORT_1 var_47 = var_47_arg_0 - var_47_arg_1; [L204] SORT_5 var_49_arg_0 = input_7; [L205] SORT_1 var_49_arg_1 = var_48; [L206] SORT_1 var_49_arg_2 = var_47; [L207] SORT_1 var_49 = var_49_arg_0 ? var_49_arg_1 : var_49_arg_2; [L208] SORT_5 var_81_arg_0 = var_52; [L209] SORT_1 var_81_arg_1 = var_9; [L210] SORT_1 var_81_arg_2 = var_49; [L211] SORT_1 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L212] SORT_1 next_82_arg_1 = var_81; [L213] SORT_5 var_83_arg_0 = var_52; [L214] SORT_1 var_83_arg_1 = var_9; [L215] SORT_1 var_83_arg_2 = state_39; [L216] SORT_1 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L217] SORT_1 next_84_arg_1 = var_83; [L219] state_10 = next_54_arg_1 [L220] state_12 = next_60_arg_1 [L221] state_21 = next_62_arg_1 [L222] state_23 = next_64_arg_1 [L223] state_25 = next_66_arg_1 [L224] state_30 = next_68_arg_1 [L225] state_32 = next_70_arg_1 [L226] state_34 = next_72_arg_1 [L227] state_36 = next_80_arg_1 [L228] state_39 = next_82_arg_1 [L229] state_41 = next_84_arg_1 VAL [bad_20_arg_0=0, init_11_arg_1=0, init_13_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_31_arg_1=0, init_33_arg_1=0, init_35_arg_1=0, init_37_arg_1=0, init_40_arg_1=0, init_42_arg_1=0, input_2=63, input_3=130, input_4=97, input_7=1, input_8=0, mask_SORT_1=255, mask_SORT_5=1, msb_SORT_1=128, msb_SORT_5=1, next_54_arg_1=0, next_60_arg_1=0, next_62_arg_1=63, next_64_arg_1=130, next_66_arg_1=97, next_68_arg_1=1, next_70_arg_1=0, next_72_arg_1=0, next_80_arg_1=0, next_82_arg_1=34, next_84_arg_1=0, state_10=0, state_12=0, state_21=63, state_23=130, state_25=97, state_30=1, state_32=0, state_34=0, state_36=0, state_39=34, state_41=0, var_14=1, var_14_arg_0=0, var_14_arg_1=0, var_17=1, var_18=254, var_18_arg_0=1, var_19=0, var_19_arg_0=1, var_19_arg_1=254, var_29=0, var_43=189, var_43_arg_0=63, var_43_arg_1=130, var_44=193, var_44_arg_0=63, var_44_arg_1=130, var_45=1, var_45_arg_0=63, var_46=193, var_46_arg_0=1, var_46_arg_1=193, var_46_arg_2=189, var_47=96, var_47_arg_0=193, var_47_arg_1=97, var_48=34, var_48_arg_0=193, var_48_arg_1=97, var_49=34, var_49_arg_0=1, var_49_arg_1=34, var_49_arg_2=96, var_52=0, var_52_arg_0=0, var_52_arg_1=1, var_53=0, var_53_arg_0=0, var_53_arg_1=0, var_53_arg_2=0, var_55=0, var_55_arg_0=0, var_55_arg_1=0, var_56=0, var_56_arg_0=0, var_56_arg_1=0, var_57=0, var_57_arg_0=0, var_57_arg_1=0, var_57_arg_2=0, var_58=0, var_58_arg_0=0, var_58_arg_1=1, var_59=0, var_59_arg_0=0, var_59_arg_1=0, var_59_arg_2=0, var_61=63, var_61_arg_0=0, var_61_arg_1=0, var_61_arg_2=63, var_63=130, var_63_arg_0=0, var_63_arg_1=0, var_63_arg_2=130, var_65=97, var_65_arg_0=0, var_65_arg_1=0, var_65_arg_2=97, var_67=1, var_67_arg_0=0, var_67_arg_1=0, var_67_arg_2=1, var_69=0, var_69_arg_0=0, var_69_arg_1=0, var_69_arg_2=0, var_71=0, var_71_arg_0=0, var_71_arg_1=0, var_71_arg_2=0, var_73=0, var_73_arg_0=0, var_73_arg_1=0, var_74=0, var_74_arg_0=0, var_74_arg_1=0, var_75=1, var_76=0, var_76_arg_0=0, var_76_arg_1=1, var_77=0, var_77_arg_0=0, var_77_arg_1=1, var_78=0, var_78_arg_0=0, var_78_arg_1=0, var_78_arg_2=0, var_79=0, var_79_arg_0=0, var_79_arg_1=0, var_79_arg_2=0, var_81=34, var_81_arg_0=0, var_81_arg_1=0, var_81_arg_2=34, var_83=0, var_83_arg_0=0, var_83_arg_1=0, var_83_arg_2=0, var_9=0] [L81] input_2 = __VERIFIER_nondet_uchar() [L82] input_3 = __VERIFIER_nondet_uchar() [L83] input_4 = __VERIFIER_nondet_uchar() [L84] input_6 = __VERIFIER_nondet_uchar() [L85] input_7 = __VERIFIER_nondet_uchar() [L86] input_7 = input_7 & mask_SORT_5 [L87] input_8 = __VERIFIER_nondet_uchar() [L88] input_8 = input_8 & mask_SORT_5 [L89] input_27 = __VERIFIER_nondet_uchar() [L92] SORT_1 var_14_arg_0 = state_10; [L93] SORT_1 var_14_arg_1 = state_12; [L94] SORT_5 var_14 = var_14_arg_0 == var_14_arg_1; [L95] SORT_5 var_18_arg_0 = var_14; [L96] SORT_5 var_18 = ~var_18_arg_0; [L97] SORT_5 var_19_arg_0 = var_17; [L98] SORT_5 var_19_arg_1 = var_18; [L99] SORT_5 var_19 = var_19_arg_0 & var_19_arg_1; [L100] var_19 = var_19 & mask_SORT_5 [L101] SORT_5 bad_20_arg_0 = var_19; [L102] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L102] RET __VERIFIER_assert(!(bad_20_arg_0)) [L104] SORT_5 var_52_arg_0 = input_8; [L105] SORT_5 var_52_arg_1 = var_17; [L106] SORT_5 var_52 = var_52_arg_0 == var_52_arg_1; [L107] SORT_5 var_53_arg_0 = var_52; [L108] SORT_1 var_53_arg_1 = var_9; [L109] SORT_1 var_53_arg_2 = state_41; [L110] SORT_1 var_53 = var_53_arg_0 ? var_53_arg_1 : var_53_arg_2; [L111] var_53 = var_53 & mask_SORT_1 [L112] SORT_1 next_54_arg_1 = var_53; [L113] SORT_5 var_58_arg_0 = input_8; [L114] SORT_5 var_58_arg_1 = var_17; [L115] SORT_5 var_58 = var_58_arg_0 == var_58_arg_1; [L116] SORT_1 var_56_arg_0 = state_36; [L117] SORT_1 var_56_arg_1 = state_32; [L118] SORT_1 var_56 = var_56_arg_0 - var_56_arg_1; [L119] SORT_1 var_55_arg_0 = state_36; [L120] SORT_1 var_55_arg_1 = state_32; [L121] SORT_1 var_55 = var_55_arg_0 - var_55_arg_1; [L122] SORT_5 var_57_arg_0 = state_34; [L123] SORT_1 var_57_arg_1 = var_56; [L124] SORT_1 var_57_arg_2 = var_55; [L125] SORT_1 var_57 = var_57_arg_0 ? var_57_arg_1 : var_57_arg_2; [L126] SORT_5 var_59_arg_0 = var_58; [L127] SORT_1 var_59_arg_1 = var_9; [L128] SORT_1 var_59_arg_2 = var_57; [L129] SORT_1 var_59 = var_59_arg_0 ? var_59_arg_1 : var_59_arg_2; [L130] var_59 = var_59 & mask_SORT_1 [L131] SORT_1 next_60_arg_1 = var_59; [L132] SORT_5 var_61_arg_0 = var_58; [L133] SORT_1 var_61_arg_1 = var_9; [L134] SORT_1 var_61_arg_2 = input_2; [L135] SORT_1 var_61 = var_61_arg_0 ? var_61_arg_1 : var_61_arg_2; [L136] SORT_1 next_62_arg_1 = var_61; [L137] SORT_5 var_63_arg_0 = var_58; [L138] SORT_1 var_63_arg_1 = var_9; [L139] SORT_1 var_63_arg_2 = input_3; [L140] SORT_1 var_63 = var_63_arg_0 ? var_63_arg_1 : var_63_arg_2; [L141] SORT_1 next_64_arg_1 = var_63; [L142] SORT_5 var_65_arg_0 = var_58; [L143] SORT_1 var_65_arg_1 = var_9; [L144] SORT_1 var_65_arg_2 = input_4; [L145] SORT_1 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L146] SORT_1 next_66_arg_1 = var_65; [L147] SORT_5 var_67_arg_0 = var_58; [L148] SORT_5 var_67_arg_1 = var_29; [L149] SORT_5 var_67_arg_2 = input_7; [L150] SORT_5 var_67 = var_67_arg_0 ? var_67_arg_1 : var_67_arg_2; [L151] SORT_5 next_68_arg_1 = var_67; [L152] SORT_5 var_69_arg_0 = var_58; [L153] SORT_1 var_69_arg_1 = var_9; [L154] SORT_1 var_69_arg_2 = state_25; [L155] SORT_1 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L156] SORT_1 next_70_arg_1 = var_69; [L157] SORT_5 var_71_arg_0 = var_58; [L158] SORT_5 var_71_arg_1 = var_29; [L159] SORT_5 var_71_arg_2 = state_30; [L160] SORT_5 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2; [L161] var_71 = var_71 & mask_SORT_5 [L162] SORT_5 next_72_arg_1 = var_71; [L163] SORT_1 var_76_arg_0 = state_21; [L164] SORT_1 var_76_arg_1 = var_75; [L165] SORT_1 var_76 = var_76_arg_0 & var_76_arg_1; [L166] var_76 = var_76 & mask_SORT_1 [L167] SORT_1 var_77_arg_0 = var_76; [L168] SORT_1 var_77_arg_1 = var_75; [L169] SORT_5 var_77 = var_77_arg_0 == var_77_arg_1; [L170] SORT_1 var_74_arg_0 = state_21; [L171] SORT_1 var_74_arg_1 = state_23; [L172] SORT_1 var_74 = var_74_arg_0 + var_74_arg_1; [L173] SORT_1 var_73_arg_0 = state_21; [L174] SORT_1 var_73_arg_1 = state_23; [L175] SORT_1 var_73 = var_73_arg_0 - var_73_arg_1; [L176] SORT_5 var_78_arg_0 = var_77; [L177] SORT_1 var_78_arg_1 = var_74; [L178] SORT_1 var_78_arg_2 = var_73; [L179] SORT_1 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L180] SORT_5 var_79_arg_0 = var_58; [L181] SORT_1 var_79_arg_1 = var_9; [L182] SORT_1 var_79_arg_2 = var_78; [L183] SORT_1 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L184] SORT_1 next_80_arg_1 = var_79; [L185] SORT_1 var_45_arg_0 = input_2; [L186] SORT_5 var_45 = var_45_arg_0 >> 0; [L187] var_45 = var_45 & mask_SORT_5 [L188] SORT_1 var_44_arg_0 = input_2; [L189] SORT_1 var_44_arg_1 = input_3; [L190] SORT_1 var_44 = var_44_arg_0 + var_44_arg_1; [L191] SORT_1 var_43_arg_0 = input_2; [L192] SORT_1 var_43_arg_1 = input_3; [L193] SORT_1 var_43 = var_43_arg_0 - var_43_arg_1; [L194] SORT_5 var_46_arg_0 = var_45; [L195] SORT_1 var_46_arg_1 = var_44; [L196] SORT_1 var_46_arg_2 = var_43; [L197] SORT_1 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; [L198] SORT_1 var_48_arg_0 = var_46; [L199] SORT_1 var_48_arg_1 = input_4; [L200] SORT_1 var_48 = var_48_arg_0 + var_48_arg_1; [L201] SORT_1 var_47_arg_0 = var_46; [L202] SORT_1 var_47_arg_1 = input_4; [L203] SORT_1 var_47 = var_47_arg_0 - var_47_arg_1; [L204] SORT_5 var_49_arg_0 = input_7; [L205] SORT_1 var_49_arg_1 = var_48; [L206] SORT_1 var_49_arg_2 = var_47; [L207] SORT_1 var_49 = var_49_arg_0 ? var_49_arg_1 : var_49_arg_2; [L208] SORT_5 var_81_arg_0 = var_52; [L209] SORT_1 var_81_arg_1 = var_9; [L210] SORT_1 var_81_arg_2 = var_49; [L211] SORT_1 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L212] SORT_1 next_82_arg_1 = var_81; [L213] SORT_5 var_83_arg_0 = var_52; [L214] SORT_1 var_83_arg_1 = var_9; [L215] SORT_1 var_83_arg_2 = state_39; [L216] SORT_1 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L217] SORT_1 next_84_arg_1 = var_83; [L219] state_10 = next_54_arg_1 [L220] state_12 = next_60_arg_1 [L221] state_21 = next_62_arg_1 [L222] state_23 = next_64_arg_1 [L223] state_25 = next_66_arg_1 [L224] state_30 = next_68_arg_1 [L225] state_32 = next_70_arg_1 [L226] state_34 = next_72_arg_1 [L227] state_36 = next_80_arg_1 [L228] state_39 = next_82_arg_1 [L229] state_41 = next_84_arg_1 VAL [bad_20_arg_0=0, init_11_arg_1=0, init_13_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_31_arg_1=0, init_33_arg_1=0, init_35_arg_1=0, init_37_arg_1=0, init_40_arg_1=0, init_42_arg_1=0, input_2=0, input_3=0, input_4=0, input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_5=1, msb_SORT_1=128, msb_SORT_5=1, next_54_arg_1=0, next_60_arg_1=0, next_62_arg_1=0, next_64_arg_1=0, next_66_arg_1=0, next_68_arg_1=0, next_70_arg_1=97, next_72_arg_1=1, next_80_arg_1=193, next_82_arg_1=0, next_84_arg_1=34, state_10=0, state_12=0, state_21=0, state_23=0, state_25=0, state_30=0, state_32=97, state_34=1, state_36=193, state_39=0, state_41=34, var_14=1, var_14_arg_0=0, var_14_arg_1=0, var_17=1, var_18=254, var_18_arg_0=1, var_19=0, var_19_arg_0=1, var_19_arg_1=254, var_29=0, var_43=0, var_43_arg_0=0, var_43_arg_1=0, var_44=0, var_44_arg_0=0, var_44_arg_1=0, var_45=0, var_45_arg_0=0, var_46=0, var_46_arg_0=0, var_46_arg_1=0, var_46_arg_2=0, var_47=0, var_47_arg_0=0, var_47_arg_1=0, var_48=0, var_48_arg_0=0, var_48_arg_1=0, var_49=0, var_49_arg_0=0, var_49_arg_1=0, var_49_arg_2=0, var_52=0, var_52_arg_0=0, var_52_arg_1=1, var_53=0, var_53_arg_0=0, var_53_arg_1=0, var_53_arg_2=0, var_55=0, var_55_arg_0=0, var_55_arg_1=0, var_56=0, var_56_arg_0=0, var_56_arg_1=0, var_57=0, var_57_arg_0=0, var_57_arg_1=0, var_57_arg_2=0, var_58=0, var_58_arg_0=0, var_58_arg_1=1, var_59=0, var_59_arg_0=0, var_59_arg_1=0, var_59_arg_2=0, var_61=0, var_61_arg_0=0, var_61_arg_1=0, var_61_arg_2=0, var_63=0, var_63_arg_0=0, var_63_arg_1=0, var_63_arg_2=0, var_65=0, var_65_arg_0=0, var_65_arg_1=0, var_65_arg_2=0, var_67=0, var_67_arg_0=0, var_67_arg_1=0, var_67_arg_2=0, var_69=97, var_69_arg_0=0, var_69_arg_1=0, var_69_arg_2=97, var_71=1, var_71_arg_0=0, var_71_arg_1=0, var_71_arg_2=1, var_73=189, var_73_arg_0=63, var_73_arg_1=130, var_74=193, var_74_arg_0=63, var_74_arg_1=130, var_75=1, var_76=1, var_76_arg_0=63, var_76_arg_1=1, var_77=1, var_77_arg_0=1, var_77_arg_1=1, var_78=193, var_78_arg_0=1, var_78_arg_1=193, var_78_arg_2=189, var_79=193, var_79_arg_0=0, var_79_arg_1=0, var_79_arg_2=193, var_81=0, var_81_arg_0=0, var_81_arg_1=0, var_81_arg_2=0, var_83=34, var_83_arg_0=0, var_83_arg_1=0, var_83_arg_2=34, var_9=0] [L81] input_2 = __VERIFIER_nondet_uchar() [L82] input_3 = __VERIFIER_nondet_uchar() [L83] input_4 = __VERIFIER_nondet_uchar() [L84] input_6 = __VERIFIER_nondet_uchar() [L85] input_7 = __VERIFIER_nondet_uchar() [L86] input_7 = input_7 & mask_SORT_5 [L87] input_8 = __VERIFIER_nondet_uchar() [L88] input_8 = input_8 & mask_SORT_5 [L89] input_27 = __VERIFIER_nondet_uchar() [L92] SORT_1 var_14_arg_0 = state_10; [L93] SORT_1 var_14_arg_1 = state_12; [L94] SORT_5 var_14 = var_14_arg_0 == var_14_arg_1; [L95] SORT_5 var_18_arg_0 = var_14; [L96] SORT_5 var_18 = ~var_18_arg_0; [L97] SORT_5 var_19_arg_0 = var_17; [L98] SORT_5 var_19_arg_1 = var_18; [L99] SORT_5 var_19 = var_19_arg_0 & var_19_arg_1; [L100] var_19 = var_19 & mask_SORT_5 [L101] SORT_5 bad_20_arg_0 = var_19; [L102] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L102] RET __VERIFIER_assert(!(bad_20_arg_0)) [L104] SORT_5 var_52_arg_0 = input_8; [L105] SORT_5 var_52_arg_1 = var_17; [L106] SORT_5 var_52 = var_52_arg_0 == var_52_arg_1; [L107] SORT_5 var_53_arg_0 = var_52; [L108] SORT_1 var_53_arg_1 = var_9; [L109] SORT_1 var_53_arg_2 = state_41; [L110] SORT_1 var_53 = var_53_arg_0 ? var_53_arg_1 : var_53_arg_2; [L111] var_53 = var_53 & mask_SORT_1 [L112] SORT_1 next_54_arg_1 = var_53; [L113] SORT_5 var_58_arg_0 = input_8; [L114] SORT_5 var_58_arg_1 = var_17; [L115] SORT_5 var_58 = var_58_arg_0 == var_58_arg_1; [L116] SORT_1 var_56_arg_0 = state_36; [L117] SORT_1 var_56_arg_1 = state_32; [L118] SORT_1 var_56 = var_56_arg_0 - var_56_arg_1; [L119] SORT_1 var_55_arg_0 = state_36; [L120] SORT_1 var_55_arg_1 = state_32; [L121] SORT_1 var_55 = var_55_arg_0 - var_55_arg_1; [L122] SORT_5 var_57_arg_0 = state_34; [L123] SORT_1 var_57_arg_1 = var_56; [L124] SORT_1 var_57_arg_2 = var_55; [L125] SORT_1 var_57 = var_57_arg_0 ? var_57_arg_1 : var_57_arg_2; [L126] SORT_5 var_59_arg_0 = var_58; [L127] SORT_1 var_59_arg_1 = var_9; [L128] SORT_1 var_59_arg_2 = var_57; [L129] SORT_1 var_59 = var_59_arg_0 ? var_59_arg_1 : var_59_arg_2; [L130] var_59 = var_59 & mask_SORT_1 [L131] SORT_1 next_60_arg_1 = var_59; [L132] SORT_5 var_61_arg_0 = var_58; [L133] SORT_1 var_61_arg_1 = var_9; [L134] SORT_1 var_61_arg_2 = input_2; [L135] SORT_1 var_61 = var_61_arg_0 ? var_61_arg_1 : var_61_arg_2; [L136] SORT_1 next_62_arg_1 = var_61; [L137] SORT_5 var_63_arg_0 = var_58; [L138] SORT_1 var_63_arg_1 = var_9; [L139] SORT_1 var_63_arg_2 = input_3; [L140] SORT_1 var_63 = var_63_arg_0 ? var_63_arg_1 : var_63_arg_2; [L141] SORT_1 next_64_arg_1 = var_63; [L142] SORT_5 var_65_arg_0 = var_58; [L143] SORT_1 var_65_arg_1 = var_9; [L144] SORT_1 var_65_arg_2 = input_4; [L145] SORT_1 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L146] SORT_1 next_66_arg_1 = var_65; [L147] SORT_5 var_67_arg_0 = var_58; [L148] SORT_5 var_67_arg_1 = var_29; [L149] SORT_5 var_67_arg_2 = input_7; [L150] SORT_5 var_67 = var_67_arg_0 ? var_67_arg_1 : var_67_arg_2; [L151] SORT_5 next_68_arg_1 = var_67; [L152] SORT_5 var_69_arg_0 = var_58; [L153] SORT_1 var_69_arg_1 = var_9; [L154] SORT_1 var_69_arg_2 = state_25; [L155] SORT_1 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L156] SORT_1 next_70_arg_1 = var_69; [L157] SORT_5 var_71_arg_0 = var_58; [L158] SORT_5 var_71_arg_1 = var_29; [L159] SORT_5 var_71_arg_2 = state_30; [L160] SORT_5 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2; [L161] var_71 = var_71 & mask_SORT_5 [L162] SORT_5 next_72_arg_1 = var_71; [L163] SORT_1 var_76_arg_0 = state_21; [L164] SORT_1 var_76_arg_1 = var_75; [L165] SORT_1 var_76 = var_76_arg_0 & var_76_arg_1; [L166] var_76 = var_76 & mask_SORT_1 [L167] SORT_1 var_77_arg_0 = var_76; [L168] SORT_1 var_77_arg_1 = var_75; [L169] SORT_5 var_77 = var_77_arg_0 == var_77_arg_1; [L170] SORT_1 var_74_arg_0 = state_21; [L171] SORT_1 var_74_arg_1 = state_23; [L172] SORT_1 var_74 = var_74_arg_0 + var_74_arg_1; [L173] SORT_1 var_73_arg_0 = state_21; [L174] SORT_1 var_73_arg_1 = state_23; [L175] SORT_1 var_73 = var_73_arg_0 - var_73_arg_1; [L176] SORT_5 var_78_arg_0 = var_77; [L177] SORT_1 var_78_arg_1 = var_74; [L178] SORT_1 var_78_arg_2 = var_73; [L179] SORT_1 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L180] SORT_5 var_79_arg_0 = var_58; [L181] SORT_1 var_79_arg_1 = var_9; [L182] SORT_1 var_79_arg_2 = var_78; [L183] SORT_1 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L184] SORT_1 next_80_arg_1 = var_79; [L185] SORT_1 var_45_arg_0 = input_2; [L186] SORT_5 var_45 = var_45_arg_0 >> 0; [L187] var_45 = var_45 & mask_SORT_5 [L188] SORT_1 var_44_arg_0 = input_2; [L189] SORT_1 var_44_arg_1 = input_3; [L190] SORT_1 var_44 = var_44_arg_0 + var_44_arg_1; [L191] SORT_1 var_43_arg_0 = input_2; [L192] SORT_1 var_43_arg_1 = input_3; [L193] SORT_1 var_43 = var_43_arg_0 - var_43_arg_1; [L194] SORT_5 var_46_arg_0 = var_45; [L195] SORT_1 var_46_arg_1 = var_44; [L196] SORT_1 var_46_arg_2 = var_43; [L197] SORT_1 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; [L198] SORT_1 var_48_arg_0 = var_46; [L199] SORT_1 var_48_arg_1 = input_4; [L200] SORT_1 var_48 = var_48_arg_0 + var_48_arg_1; [L201] SORT_1 var_47_arg_0 = var_46; [L202] SORT_1 var_47_arg_1 = input_4; [L203] SORT_1 var_47 = var_47_arg_0 - var_47_arg_1; [L204] SORT_5 var_49_arg_0 = input_7; [L205] SORT_1 var_49_arg_1 = var_48; [L206] SORT_1 var_49_arg_2 = var_47; [L207] SORT_1 var_49 = var_49_arg_0 ? var_49_arg_1 : var_49_arg_2; [L208] SORT_5 var_81_arg_0 = var_52; [L209] SORT_1 var_81_arg_1 = var_9; [L210] SORT_1 var_81_arg_2 = var_49; [L211] SORT_1 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L212] SORT_1 next_82_arg_1 = var_81; [L213] SORT_5 var_83_arg_0 = var_52; [L214] SORT_1 var_83_arg_1 = var_9; [L215] SORT_1 var_83_arg_2 = state_39; [L216] SORT_1 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L217] SORT_1 next_84_arg_1 = var_83; [L219] state_10 = next_54_arg_1 [L220] state_12 = next_60_arg_1 [L221] state_21 = next_62_arg_1 [L222] state_23 = next_64_arg_1 [L223] state_25 = next_66_arg_1 [L224] state_30 = next_68_arg_1 [L225] state_32 = next_70_arg_1 [L226] state_34 = next_72_arg_1 [L227] state_36 = next_80_arg_1 [L228] state_39 = next_82_arg_1 [L229] state_41 = next_84_arg_1 VAL [bad_20_arg_0=0, init_11_arg_1=0, init_13_arg_1=0, init_22_arg_1=0, init_24_arg_1=0, init_26_arg_1=0, init_31_arg_1=0, init_33_arg_1=0, init_35_arg_1=0, init_37_arg_1=0, init_40_arg_1=0, init_42_arg_1=0, input_2=0, input_3=0, input_4=0, input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_5=1, msb_SORT_1=128, msb_SORT_5=1, next_54_arg_1=34, next_60_arg_1=96, next_62_arg_1=0, next_64_arg_1=0, next_66_arg_1=0, next_68_arg_1=0, next_70_arg_1=0, next_72_arg_1=0, next_80_arg_1=0, next_82_arg_1=0, next_84_arg_1=0, state_10=34, state_12=96, state_21=0, state_23=0, state_25=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, var_14=1, var_14_arg_0=0, var_14_arg_1=0, var_17=1, var_18=254, var_18_arg_0=1, var_19=0, var_19_arg_0=1, var_19_arg_1=254, var_29=0, var_43=0, var_43_arg_0=0, var_43_arg_1=0, var_44=0, var_44_arg_0=0, var_44_arg_1=0, var_45=0, var_45_arg_0=0, var_46=0, var_46_arg_0=0, var_46_arg_1=0, var_46_arg_2=0, var_47=0, var_47_arg_0=0, var_47_arg_1=0, var_48=0, var_48_arg_0=0, var_48_arg_1=0, var_49=0, var_49_arg_0=0, var_49_arg_1=0, var_49_arg_2=0, var_52=0, var_52_arg_0=0, var_52_arg_1=1, var_53=34, var_53_arg_0=0, var_53_arg_1=0, var_53_arg_2=34, var_55=96, var_55_arg_0=193, var_55_arg_1=97, var_56=96, var_56_arg_0=193, var_56_arg_1=97, var_57=96, var_57_arg_0=1, var_57_arg_1=96, var_57_arg_2=96, var_58=0, var_58_arg_0=0, var_58_arg_1=1, var_59=96, var_59_arg_0=0, var_59_arg_1=0, var_59_arg_2=96, var_61=0, var_61_arg_0=0, var_61_arg_1=0, var_61_arg_2=0, var_63=0, var_63_arg_0=0, var_63_arg_1=0, var_63_arg_2=0, var_65=0, var_65_arg_0=0, var_65_arg_1=0, var_65_arg_2=0, var_67=0, var_67_arg_0=0, var_67_arg_1=0, var_67_arg_2=0, var_69=0, var_69_arg_0=0, var_69_arg_1=0, var_69_arg_2=0, var_71=0, var_71_arg_0=0, var_71_arg_1=0, var_71_arg_2=0, var_73=0, var_73_arg_0=0, var_73_arg_1=0, var_74=0, var_74_arg_0=0, var_74_arg_1=0, var_75=1, var_76=0, var_76_arg_0=0, var_76_arg_1=1, var_77=0, var_77_arg_0=0, var_77_arg_1=1, var_78=0, var_78_arg_0=0, var_78_arg_1=0, var_78_arg_2=0, var_79=0, var_79_arg_0=0, var_79_arg_1=0, var_79_arg_2=0, var_81=0, var_81_arg_0=0, var_81_arg_1=0, var_81_arg_2=0, var_83=0, var_83_arg_0=0, var_83_arg_1=0, var_83_arg_2=0, var_9=0] [L81] input_2 = __VERIFIER_nondet_uchar() [L82] input_3 = __VERIFIER_nondet_uchar() [L83] input_4 = __VERIFIER_nondet_uchar() [L84] input_6 = __VERIFIER_nondet_uchar() [L85] input_7 = __VERIFIER_nondet_uchar() [L86] input_7 = input_7 & mask_SORT_5 [L87] input_8 = __VERIFIER_nondet_uchar() [L88] input_8 = input_8 & mask_SORT_5 [L89] input_27 = __VERIFIER_nondet_uchar() [L92] SORT_1 var_14_arg_0 = state_10; [L93] SORT_1 var_14_arg_1 = state_12; [L94] SORT_5 var_14 = var_14_arg_0 == var_14_arg_1; [L95] SORT_5 var_18_arg_0 = var_14; [L96] SORT_5 var_18 = ~var_18_arg_0; [L97] SORT_5 var_19_arg_0 = var_17; [L98] SORT_5 var_19_arg_1 = var_18; [L99] SORT_5 var_19 = var_19_arg_0 & var_19_arg_1; [L100] var_19 = var_19 & mask_SORT_5 [L101] SORT_5 bad_20_arg_0 = var_19; [L102] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L21] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L21] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.1s, OverallIterations: 4, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 27 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 27 mSDsluCounter, 34 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 28 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 58 IncrementalHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 6 mSDtfsCounter, 58 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=3, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 33 ConstructedInterpolants, 13 QuantifiedInterpolants, 10888 SizeOfPredicates, 132 NumberOfNonLiveVariables, 573 ConjunctsInSsa, 141 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 0/18 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! [2023-12-16 21:44:03,626 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...