/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_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.safe_analog_estimation_convergence.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-26 02:03:32,332 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-26 02:03:32,368 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2023-12-26 02:03:32,371 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-26 02:03:32,371 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-26 02:03:32,384 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-26 02:03:32,385 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-26 02:03:32,385 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-26 02:03:32,385 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-26 02:03:32,386 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-26 02:03:32,386 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-26 02:03:32,386 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-26 02:03:32,386 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-26 02:03:32,387 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-26 02:03:32,387 INFO L153 SettingsManager]: * Use SBE=true [2023-12-26 02:03:32,387 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-26 02:03:32,387 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-26 02:03:32,387 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-26 02:03:32,388 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-26 02:03:32,388 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-26 02:03:32,388 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-26 02:03:32,389 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-26 02:03:32,389 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-26 02:03:32,389 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-26 02:03:32,389 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-26 02:03:32,389 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-26 02:03:32,390 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-26 02:03:32,390 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-26 02:03:32,390 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-26 02:03:32,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-26 02:03:32,391 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-26 02:03:32,391 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-26 02:03:32,391 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-26 02:03:32,391 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-26 02:03:32,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-26 02:03:32,392 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-26 02:03:32,397 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-26 02:03:32,397 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-26 02:03:32,397 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-26 02:03:32,397 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-26 02:03:32,398 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: Use bitabs translation -> false [2023-12-26 02:03:32,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-26 02:03:32,627 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-26 02:03:32,629 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-26 02:03:32,630 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-26 02:03:32,630 INFO L274 PluginConnector]: CDTParser initialized [2023-12-26 02:03:32,631 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.safe_analog_estimation_convergence.c [2023-12-26 02:03:33,650 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-26 02:03:33,832 INFO L384 CDTParser]: Found 1 translation units. [2023-12-26 02:03:33,832 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.safe_analog_estimation_convergence.c [2023-12-26 02:03:33,841 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0ff04497/a81688b3a6a1418ea2357b1a013938b8/FLAGd011b6d26 [2023-12-26 02:03:33,852 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0ff04497/a81688b3a6a1418ea2357b1a013938b8 [2023-12-26 02:03:33,853 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-26 02:03:33,854 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-26 02:03:33,855 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-26 02:03:33,856 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-26 02:03:33,859 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-26 02:03:33,860 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 02:03:33" (1/1) ... [2023-12-26 02:03:33,861 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17badd6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 02:03:33, skipping insertion in model container [2023-12-26 02:03:33,861 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 02:03:33" (1/1) ... [2023-12-26 02:03:33,906 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-26 02:03:34,002 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.safe_analog_estimation_convergence.c[1287,1300] [2023-12-26 02:03:34,081 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-26 02:03:34,087 INFO L202 MainTranslator]: Completed pre-run [2023-12-26 02:03:34,094 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.safe_analog_estimation_convergence.c[1287,1300] [2023-12-26 02:03:34,144 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-26 02:03:34,153 INFO L206 MainTranslator]: Completed translation [2023-12-26 02:03:34,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 02:03:34 WrapperNode [2023-12-26 02:03:34,154 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-26 02:03:34,154 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-26 02:03:34,154 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-26 02:03:34,155 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-26 02:03:34,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 02:03:34" (1/1) ... [2023-12-26 02:03:34,169 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 02:03:34" (1/1) ... [2023-12-26 02:03:34,204 INFO L138 Inliner]: procedures = 17, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 700 [2023-12-26 02:03:34,205 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-26 02:03:34,205 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-26 02:03:34,205 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-26 02:03:34,205 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-26 02:03:34,213 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 02:03:34" (1/1) ... [2023-12-26 02:03:34,213 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 02:03:34" (1/1) ... [2023-12-26 02:03:34,219 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 02:03:34" (1/1) ... [2023-12-26 02:03:34,231 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-26 02:03:34,231 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 02:03:34" (1/1) ... [2023-12-26 02:03:34,231 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 02:03:34" (1/1) ... [2023-12-26 02:03:34,257 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 02:03:34" (1/1) ... [2023-12-26 02:03:34,259 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 02:03:34" (1/1) ... [2023-12-26 02:03:34,261 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 02:03:34" (1/1) ... [2023-12-26 02:03:34,263 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 02:03:34" (1/1) ... [2023-12-26 02:03:34,273 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-26 02:03:34,273 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-26 02:03:34,273 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-26 02:03:34,274 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-26 02:03:34,274 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 02:03:34" (1/1) ... [2023-12-26 02:03:34,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-26 02:03:34,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-26 02:03:34,333 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-26 02:03:34,352 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-26 02:03:34,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-26 02:03:34,367 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-26 02:03:34,367 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-26 02:03:34,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-26 02:03:34,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-26 02:03:34,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-26 02:03:34,492 INFO L241 CfgBuilder]: Building ICFG [2023-12-26 02:03:34,493 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-26 02:03:34,798 INFO L282 CfgBuilder]: Performing block encoding [2023-12-26 02:03:34,841 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-26 02:03:34,842 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-26 02:03:34,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 02:03:34 BoogieIcfgContainer [2023-12-26 02:03:34,843 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-26 02:03:34,845 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-26 02:03:34,845 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-26 02:03:34,847 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-26 02:03:34,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 02:03:33" (1/3) ... [2023-12-26 02:03:34,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@662dc6a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 02:03:34, skipping insertion in model container [2023-12-26 02:03:34,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 02:03:34" (2/3) ... [2023-12-26 02:03:34,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@662dc6a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 02:03:34, skipping insertion in model container [2023-12-26 02:03:34,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 02:03:34" (3/3) ... [2023-12-26 02:03:34,849 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.safe_analog_estimation_convergence.c [2023-12-26 02:03:34,860 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-26 02:03:34,860 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-26 02:03:34,899 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-26 02:03:34,905 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;@7c650771, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-26 02:03:34,905 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-26 02:03:34,909 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-26 02:03:34,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-26 02:03:34,916 INFO L187 NwaCegarLoop]: Found error trace [2023-12-26 02:03:34,917 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-26 02:03:34,917 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-26 02:03:34,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-26 02:03:34,922 INFO L85 PathProgramCache]: Analyzing trace with hash -784471835, now seen corresponding path program 1 times [2023-12-26 02:03:34,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-26 02:03:34,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926918039] [2023-12-26 02:03:34,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-26 02:03:34,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-26 02:03:35,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-26 02:03:35,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-26 02:03:35,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-26 02:03:35,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-26 02:03:35,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-26 02:03:35,162 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-26 02:03:35,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-26 02:03:35,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926918039] [2023-12-26 02:03:35,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926918039] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-26 02:03:35,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-26 02:03:35,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-26 02:03:35,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422848268] [2023-12-26 02:03:35,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-26 02:03:35,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-26 02:03:35,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-26 02:03:35,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-26 02:03:35,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-26 02:03:35,192 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-26 02:03:35,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-26 02:03:35,215 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2023-12-26 02:03:35,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-26 02:03:35,218 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2023-12-26 02:03:35,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-26 02:03:35,222 INFO L225 Difference]: With dead ends: 45 [2023-12-26 02:03:35,222 INFO L226 Difference]: Without dead ends: 22 [2023-12-26 02:03:35,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-26 02:03:35,226 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-26 02:03:35,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-26 02:03:35,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-26 02:03:35,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-12-26 02:03:35,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-26 02:03:35,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2023-12-26 02:03:35,248 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 16 [2023-12-26 02:03:35,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-26 02:03:35,248 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2023-12-26 02:03:35,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-26 02:03:35,249 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2023-12-26 02:03:35,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-26 02:03:35,249 INFO L187 NwaCegarLoop]: Found error trace [2023-12-26 02:03:35,249 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-26 02:03:35,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-26 02:03:35,250 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-26 02:03:35,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-26 02:03:35,250 INFO L85 PathProgramCache]: Analyzing trace with hash -469048095, now seen corresponding path program 1 times [2023-12-26 02:03:35,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-26 02:03:35,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676171573] [2023-12-26 02:03:35,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-26 02:03:35,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-26 02:03:35,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-26 02:03:35,383 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-26 02:03:35,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-26 02:03:35,481 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-26 02:03:35,481 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-26 02:03:35,482 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-26 02:03:35,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-26 02:03:35,487 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-12-26 02:03:35,489 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-26 02:03:35,531 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-26 02:03:35,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 02:03:35 BoogieIcfgContainer [2023-12-26 02:03:35,547 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-26 02:03:35,548 INFO L158 Benchmark]: Toolchain (without parser) took 1693.26ms. Allocated memory was 179.3MB in the beginning and 315.6MB in the end (delta: 136.3MB). Free memory was 120.1MB in the beginning and 182.5MB in the end (delta: -62.4MB). Peak memory consumption was 75.0MB. Max. memory is 8.0GB. [2023-12-26 02:03:35,548 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 179.3MB. Free memory is still 131.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-26 02:03:35,548 INFO L158 Benchmark]: CACSL2BoogieTranslator took 298.36ms. Allocated memory is still 179.3MB. Free memory was 119.7MB in the beginning and 95.1MB in the end (delta: 24.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-12-26 02:03:35,549 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.47ms. Allocated memory is still 179.3MB. Free memory was 95.1MB in the beginning and 89.7MB in the end (delta: 5.4MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-26 02:03:35,549 INFO L158 Benchmark]: Boogie Preprocessor took 67.48ms. Allocated memory is still 179.3MB. Free memory was 89.7MB in the beginning and 84.5MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-26 02:03:35,550 INFO L158 Benchmark]: RCFGBuilder took 569.72ms. Allocated memory was 179.3MB in the beginning and 315.6MB in the end (delta: 136.3MB). Free memory was 84.5MB in the beginning and 253.3MB in the end (delta: -168.8MB). Peak memory consumption was 26.8MB. Max. memory is 8.0GB. [2023-12-26 02:03:35,550 INFO L158 Benchmark]: TraceAbstraction took 702.65ms. Allocated memory is still 315.6MB. Free memory was 252.8MB in the beginning and 182.5MB in the end (delta: 70.3MB). Peak memory consumption was 70.3MB. Max. memory is 8.0GB. [2023-12-26 02:03:35,552 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 179.3MB. Free memory is still 131.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 298.36ms. Allocated memory is still 179.3MB. Free memory was 119.7MB in the beginning and 95.1MB in the end (delta: 24.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.47ms. Allocated memory is still 179.3MB. Free memory was 95.1MB in the beginning and 89.7MB in the end (delta: 5.4MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 67.48ms. Allocated memory is still 179.3MB. Free memory was 89.7MB in the beginning and 84.5MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 569.72ms. Allocated memory was 179.3MB in the beginning and 315.6MB in the end (delta: 136.3MB). Free memory was 84.5MB in the beginning and 253.3MB in the end (delta: -168.8MB). Peak memory consumption was 26.8MB. Max. memory is 8.0GB. * TraceAbstraction took 702.65ms. Allocated memory is still 315.6MB. Free memory was 252.8MB in the beginning and 182.5MB in the end (delta: 70.3MB). Peak memory consumption was 70.3MB. 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 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwise operation at line 169. Possible FailurePath: [L26] EXPR (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1) [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] EXPR (SORT_1)1 << (1 - 1) [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_9 mask_SORT_9 = (SORT_9)-1 >> (sizeof(SORT_9) * 8 - 31); [L30] const SORT_9 msb_SORT_9 = (SORT_9)1 << (31 - 1); [L32] EXPR (SORT_11)-1 >> (sizeof(SORT_11) * 8 - 16) [L32] const SORT_11 mask_SORT_11 = (SORT_11)-1 >> (sizeof(SORT_11) * 8 - 16); [L33] EXPR (SORT_11)1 << (16 - 1) [L33] const SORT_11 msb_SORT_11 = (SORT_11)1 << (16 - 1); [L35] EXPR (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 8) [L35] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 8); [L36] EXPR (SORT_12)1 << (8 - 1) [L36] const SORT_12 msb_SORT_12 = (SORT_12)1 << (8 - 1); [L38] const SORT_20 mask_SORT_20 = (SORT_20)-1 >> (sizeof(SORT_20) * 8 - 32); [L39] const SORT_20 msb_SORT_20 = (SORT_20)1 << (32 - 1); [L41] const SORT_23 mask_SORT_23 = (SORT_23)-1 >> (sizeof(SORT_23) * 8 - 17); [L42] const SORT_23 msb_SORT_23 = (SORT_23)1 << (17 - 1); [L44] const SORT_26 mask_SORT_26 = (SORT_26)-1 >> (sizeof(SORT_26) * 8 - 18); [L45] const SORT_26 msb_SORT_26 = (SORT_26)1 << (18 - 1); [L47] const SORT_29 mask_SORT_29 = (SORT_29)-1 >> (sizeof(SORT_29) * 8 - 19); [L48] const SORT_29 msb_SORT_29 = (SORT_29)1 << (19 - 1); [L50] const SORT_32 mask_SORT_32 = (SORT_32)-1 >> (sizeof(SORT_32) * 8 - 20); [L51] const SORT_32 msb_SORT_32 = (SORT_32)1 << (20 - 1); [L53] const SORT_35 mask_SORT_35 = (SORT_35)-1 >> (sizeof(SORT_35) * 8 - 21); [L54] const SORT_35 msb_SORT_35 = (SORT_35)1 << (21 - 1); [L56] const SORT_38 mask_SORT_38 = (SORT_38)-1 >> (sizeof(SORT_38) * 8 - 22); [L57] const SORT_38 msb_SORT_38 = (SORT_38)1 << (22 - 1); [L59] const SORT_41 mask_SORT_41 = (SORT_41)-1 >> (sizeof(SORT_41) * 8 - 23); [L60] const SORT_41 msb_SORT_41 = (SORT_41)1 << (23 - 1); [L62] const SORT_44 mask_SORT_44 = (SORT_44)-1 >> (sizeof(SORT_44) * 8 - 24); [L63] const SORT_44 msb_SORT_44 = (SORT_44)1 << (24 - 1); [L65] const SORT_47 mask_SORT_47 = (SORT_47)-1 >> (sizeof(SORT_47) * 8 - 25); [L66] const SORT_47 msb_SORT_47 = (SORT_47)1 << (25 - 1); [L68] const SORT_50 mask_SORT_50 = (SORT_50)-1 >> (sizeof(SORT_50) * 8 - 26); [L69] const SORT_50 msb_SORT_50 = (SORT_50)1 << (26 - 1); [L71] const SORT_53 mask_SORT_53 = (SORT_53)-1 >> (sizeof(SORT_53) * 8 - 27); [L72] const SORT_53 msb_SORT_53 = (SORT_53)1 << (27 - 1); [L74] const SORT_56 mask_SORT_56 = (SORT_56)-1 >> (sizeof(SORT_56) * 8 - 28); [L75] const SORT_56 msb_SORT_56 = (SORT_56)1 << (28 - 1); [L77] const SORT_59 mask_SORT_59 = (SORT_59)-1 >> (sizeof(SORT_59) * 8 - 29); [L78] const SORT_59 msb_SORT_59 = (SORT_59)1 << (29 - 1); [L80] const SORT_62 mask_SORT_62 = (SORT_62)-1 >> (sizeof(SORT_62) * 8 - 30); [L81] const SORT_62 msb_SORT_62 = (SORT_62)1 << (30 - 1); [L83] EXPR (SORT_72)-1 >> (sizeof(SORT_72) * 8 - 3) [L83] const SORT_72 mask_SORT_72 = (SORT_72)-1 >> (sizeof(SORT_72) * 8 - 3); [L84] EXPR (SORT_72)1 << (3 - 1) [L84] const SORT_72 msb_SORT_72 = (SORT_72)1 << (3 - 1); [L86] EXPR (SORT_96)-1 >> (sizeof(SORT_96) * 8 - 4) [L86] const SORT_96 mask_SORT_96 = (SORT_96)-1 >> (sizeof(SORT_96) * 8 - 4); [L87] EXPR (SORT_96)1 << (4 - 1) [L87] const SORT_96 msb_SORT_96 = (SORT_96)1 << (4 - 1); [L89] EXPR (SORT_101)-1 >> (sizeof(SORT_101) * 8 - 14) [L89] const SORT_101 mask_SORT_101 = (SORT_101)-1 >> (sizeof(SORT_101) * 8 - 14); [L90] EXPR (SORT_101)1 << (14 - 1) [L90] const SORT_101 msb_SORT_101 = (SORT_101)1 << (14 - 1); [L92] EXPR (SORT_105)-1 >> (sizeof(SORT_105) * 8 - 2) [L92] const SORT_105 mask_SORT_105 = (SORT_105)-1 >> (sizeof(SORT_105) * 8 - 2); [L93] EXPR (SORT_105)1 << (2 - 1) [L93] const SORT_105 msb_SORT_105 = (SORT_105)1 << (2 - 1); [L95] EXPR (SORT_154)-1 >> (sizeof(SORT_154) * 8 - 7) [L95] const SORT_154 mask_SORT_154 = (SORT_154)-1 >> (sizeof(SORT_154) * 8 - 7); [L96] EXPR (SORT_154)1 << (7 - 1) [L96] const SORT_154 msb_SORT_154 = (SORT_154)1 << (7 - 1); [L98] const SORT_1 var_7 = 0; [L99] const SORT_1 var_8 = 1; [L100] const SORT_9 var_10 = 0; [L101] const SORT_12 var_13 = 0; [L102] const SORT_12 var_14 = 200; [L103] const SORT_72 var_73 = 5; [L104] const SORT_11 var_75 = 0; [L105] const SORT_105 var_106 = 1; [L106] const SORT_12 var_112 = 127; [L107] const SORT_11 var_119 = 64; [L108] const SORT_11 var_121 = 1; [L109] const SORT_11 var_123 = 127; [L110] const SORT_11 var_126 = 200; [L111] const SORT_72 var_131 = 4; [L112] const SORT_72 var_134 = 6; [L113] const SORT_96 var_138 = 9; [L114] const SORT_154 var_155 = 64; [L115] const SORT_72 var_166 = 0; [L116] const SORT_96 var_169 = 0; [L118] SORT_1 input_2; [L119] SORT_1 input_3; [L120] SORT_1 input_4; [L122] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 [L122] SORT_1 state_5 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L123] EXPR __VERIFIER_nondet_ushort() & mask_SORT_11 [L123] SORT_11 state_17 = __VERIFIER_nondet_ushort() & mask_SORT_11; [L124] EXPR __VERIFIER_nondet_ushort() & mask_SORT_11 [L124] SORT_11 state_76 = __VERIFIER_nondet_ushort() & mask_SORT_11; [L125] EXPR __VERIFIER_nondet_uchar() & mask_SORT_96 [L125] SORT_96 state_97 = __VERIFIER_nondet_uchar() & mask_SORT_96; [L126] EXPR __VERIFIER_nondet_uchar() & mask_SORT_96 [L126] SORT_96 state_100 = __VERIFIER_nondet_uchar() & mask_SORT_96; [L128] SORT_11 init_77_arg_1 = var_75; [L129] state_76 = init_77_arg_1 VAL [init_77_arg_1=0, mask_SORT_101=0, mask_SORT_105=0, mask_SORT_11=0, mask_SORT_12=0, mask_SORT_154=0, mask_SORT_1=0, mask_SORT_72=0, mask_SORT_96=0, msb_SORT_101=0, msb_SORT_105=0, msb_SORT_11=0, msb_SORT_12=0, msb_SORT_154=0, msb_SORT_1=0, msb_SORT_72=0, msb_SORT_96=0, state_100=0, state_17=0, state_5=0, state_76=0, state_97=0, var_106=1, var_10=0, var_112=127, var_119=64, var_121=1, var_123=127, var_126=200, var_131=4, var_134=6, var_138=9, var_13=0, var_14=200, var_155=64, var_166=0, var_169=0, var_73=5, var_75=0, var_7=0, var_8=1] [L132] input_2 = __VERIFIER_nondet_uchar() [L133] input_3 = __VERIFIER_nondet_uchar() [L134] EXPR input_3 & mask_SORT_1 [L134] input_3 = input_3 & mask_SORT_1 [L135] input_4 = __VERIFIER_nondet_uchar() [L136] EXPR input_4 & mask_SORT_1 [L136] input_4 = input_4 & mask_SORT_1 [L138] SORT_1 var_84_arg_0 = state_5; [L139] SORT_1 var_84 = ~var_84_arg_0; [L140] SORT_1 var_85_arg_0 = var_84; [L141] SORT_1 var_85 = ~var_85_arg_0; [L142] SORT_1 var_86_arg_0 = state_5; [L143] SORT_1 var_86_arg_1 = var_85; [L144] EXPR var_86_arg_0 | var_86_arg_1 [L144] SORT_1 var_86 = var_86_arg_0 | var_86_arg_1; [L145] EXPR var_86 & mask_SORT_1 [L145] var_86 = var_86 & mask_SORT_1 [L146] SORT_1 constr_87_arg_0 = var_86; VAL [constr_87_arg_0=255, init_77_arg_1=0, input_3=0, input_4=0, mask_SORT_101=0, mask_SORT_105=0, mask_SORT_11=0, mask_SORT_12=0, mask_SORT_154=0, mask_SORT_1=0, mask_SORT_72=0, mask_SORT_96=0, msb_SORT_101=0, msb_SORT_105=0, msb_SORT_11=0, msb_SORT_12=0, msb_SORT_154=0, msb_SORT_1=0, msb_SORT_72=0, msb_SORT_96=0, state_100=0, state_17=0, state_5=0, state_76=0, state_97=0, var_106=1, var_10=0, var_112=127, var_119=64, var_121=1, var_123=127, var_126=200, var_131=4, var_134=6, var_138=9, var_13=0, var_14=200, var_155=64, var_166=0, var_169=0, var_73=5, var_75=0, var_7=0, var_84=255, var_84_arg_0=0, var_85=0, var_85_arg_0=255, var_86=255, var_86_arg_0=0, var_86_arg_1=0, var_8=1] [L147] CALL assume_abort_if_not(constr_87_arg_0) VAL [\old(cond)=255] [L22] COND FALSE !(!cond) VAL [\old(cond)=255, cond=255] [L147] RET assume_abort_if_not(constr_87_arg_0) VAL [constr_87_arg_0=255, init_77_arg_1=0, input_3=0, input_4=0, mask_SORT_101=0, mask_SORT_105=0, mask_SORT_11=0, mask_SORT_12=0, mask_SORT_154=0, mask_SORT_1=0, mask_SORT_72=0, mask_SORT_96=0, msb_SORT_101=0, msb_SORT_105=0, msb_SORT_11=0, msb_SORT_12=0, msb_SORT_154=0, msb_SORT_1=0, msb_SORT_72=0, msb_SORT_96=0, state_100=0, state_17=0, state_5=0, state_76=0, state_97=0, var_106=1, var_10=0, var_112=127, var_119=64, var_121=1, var_123=127, var_126=200, var_131=4, var_134=6, var_138=9, var_13=0, var_14=200, var_155=64, var_166=0, var_169=0, var_73=5, var_75=0, var_7=0, var_84=255, var_84_arg_0=0, var_85=0, var_85_arg_0=255, var_86=255, var_86_arg_0=0, var_86_arg_1=0, var_8=1] [L148] SORT_1 var_88_arg_0 = var_8; [L149] EXPR var_88_arg_0 & mask_SORT_1 [L149] var_88_arg_0 = var_88_arg_0 & mask_SORT_1 [L150] SORT_11 var_88 = var_88_arg_0; [L151] SORT_11 var_89_arg_0 = state_76; [L152] SORT_11 var_89_arg_1 = var_88; [L153] SORT_1 var_89 = var_89_arg_0 <= var_89_arg_1; [L154] SORT_1 var_90_arg_0 = input_4; [L155] SORT_1 var_90_arg_1 = var_89; [L156] EXPR var_90_arg_0 ^ var_90_arg_1 [L156] SORT_1 var_90 = var_90_arg_0 ^ var_90_arg_1; [L157] SORT_1 var_91_arg_0 = var_90; [L158] SORT_1 var_91 = ~var_91_arg_0; [L159] SORT_1 var_92_arg_0 = var_90; [L160] SORT_1 var_92 = ~var_92_arg_0; [L161] SORT_1 var_93_arg_0 = var_91; [L162] SORT_1 var_93_arg_1 = var_92; [L163] EXPR var_93_arg_0 | var_93_arg_1 [L163] SORT_1 var_93 = var_93_arg_0 | var_93_arg_1; [L164] EXPR var_93 & mask_SORT_1 [L164] var_93 = var_93 & mask_SORT_1 [L165] SORT_1 constr_94_arg_0 = var_93; VAL [constr_87_arg_0=255, constr_94_arg_0=255, init_77_arg_1=0, input_3=0, input_4=0, mask_SORT_101=0, mask_SORT_105=0, mask_SORT_11=0, mask_SORT_12=0, mask_SORT_154=0, mask_SORT_1=0, mask_SORT_72=0, mask_SORT_96=0, msb_SORT_101=0, msb_SORT_105=0, msb_SORT_11=0, msb_SORT_12=0, msb_SORT_154=0, msb_SORT_1=0, msb_SORT_72=0, msb_SORT_96=0, state_100=0, state_17=0, state_5=0, state_76=0, state_97=0, var_106=1, var_10=0, var_112=127, var_119=64, var_121=1, var_123=127, var_126=200, var_131=4, var_134=6, var_138=9, var_13=0, var_14=200, var_155=64, var_166=0, var_169=0, var_73=5, var_75=0, var_7=0, var_84=255, var_84_arg_0=0, var_85=0, var_85_arg_0=255, var_86=255, var_86_arg_0=0, var_86_arg_1=0, var_88=0, var_88_arg_0=0, var_89=1, var_89_arg_0=0, var_89_arg_1=0, var_8=1, var_90=0, var_90_arg_0=0, var_90_arg_1=1, var_91=255, var_91_arg_0=0, var_92=255, var_92_arg_0=0, var_93=255, var_93_arg_0=255, var_93_arg_1=255] [L166] CALL assume_abort_if_not(constr_94_arg_0) VAL [\old(cond)=255] [L22] COND FALSE !(!cond) VAL [\old(cond)=255, cond=255] [L166] RET assume_abort_if_not(constr_94_arg_0) VAL [constr_87_arg_0=255, constr_94_arg_0=255, init_77_arg_1=0, input_3=0, input_4=0, mask_SORT_101=0, mask_SORT_105=0, mask_SORT_11=0, mask_SORT_12=0, mask_SORT_154=0, mask_SORT_1=0, mask_SORT_72=0, mask_SORT_96=0, msb_SORT_101=0, msb_SORT_105=0, msb_SORT_11=0, msb_SORT_12=0, msb_SORT_154=0, msb_SORT_1=0, msb_SORT_72=0, msb_SORT_96=0, state_100=0, state_17=0, state_5=0, state_76=0, state_97=0, var_106=1, var_10=0, var_112=127, var_119=64, var_121=1, var_123=127, var_126=200, var_131=4, var_134=6, var_138=9, var_13=0, var_14=200, var_155=64, var_166=0, var_169=0, var_73=5, var_75=0, var_7=0, var_84=255, var_84_arg_0=0, var_85=0, var_85_arg_0=255, var_86=255, var_86_arg_0=0, var_86_arg_1=0, var_88=0, var_88_arg_0=0, var_89=1, var_89_arg_0=0, var_89_arg_1=0, var_8=1, var_90=0, var_90_arg_0=0, var_90_arg_1=1, var_91=255, var_91_arg_0=0, var_92=255, var_92_arg_0=0, var_93=255, var_93_arg_0=255, var_93_arg_1=255] [L168] SORT_72 var_74_arg_0 = var_73; [L169] EXPR var_74_arg_0 & mask_SORT_72 [L169] var_74_arg_0 = var_74_arg_0 & mask_SORT_72 [L170] SORT_11 var_74 = var_74_arg_0; [L171] SORT_11 var_78_arg_0 = var_74; [L172] SORT_11 var_78_arg_1 = state_76; [L173] SORT_1 var_78 = var_78_arg_0 < var_78_arg_1; [L174] SORT_1 var_15_arg_0 = input_3; [L175] SORT_12 var_15_arg_1 = var_14; [L176] SORT_12 var_15_arg_2 = var_13; [L177] SORT_12 var_15 = var_15_arg_0 ? var_15_arg_1 : var_15_arg_2; [L178] EXPR var_15 & mask_SORT_12 [L178] var_15 = var_15 & mask_SORT_12 [L179] SORT_12 var_16_arg_0 = var_13; [L180] SORT_12 var_16_arg_1 = var_15; [L181] EXPR (SORT_11)var_16_arg_0 << 8 [L181] EXPR ((SORT_11)var_16_arg_0 << 8) | var_16_arg_1 [L181] SORT_11 var_16 = ((SORT_11)var_16_arg_0 << 8) | var_16_arg_1; [L182] SORT_11 var_18_arg_0 = var_16; [L183] SORT_11 var_18_arg_1 = state_17; [L184] SORT_11 var_18 = var_18_arg_0 - var_18_arg_1; [L185] EXPR var_18 & mask_SORT_11 [L185] var_18 = var_18 & mask_SORT_11 [L186] SORT_11 var_19_arg_0 = var_18; [L187] EXPR var_19_arg_0 >> 15 [L187] SORT_1 var_19 = var_19_arg_0 >> 15; [L188] SORT_1 var_21_arg_0 = var_19; [L189] SORT_9 var_21_arg_1 = var_10; [L190] SORT_20 var_21 = ((SORT_20)var_21_arg_0 << 31) | var_21_arg_1; [L191] var_21 = var_21 & mask_SORT_20 [L192] SORT_11 var_64_arg_0 = var_18; [L193] EXPR var_64_arg_0 >> 15 [L193] SORT_1 var_64 = var_64_arg_0 >> 15; [L194] SORT_11 var_61_arg_0 = var_18; [L195] EXPR var_61_arg_0 >> 15 [L195] SORT_1 var_61 = var_61_arg_0 >> 15; [L196] SORT_11 var_58_arg_0 = var_18; [L197] EXPR var_58_arg_0 >> 15 [L197] SORT_1 var_58 = var_58_arg_0 >> 15; [L198] SORT_11 var_55_arg_0 = var_18; [L199] EXPR var_55_arg_0 >> 15 [L199] SORT_1 var_55 = var_55_arg_0 >> 15; [L200] SORT_11 var_52_arg_0 = var_18; [L201] EXPR var_52_arg_0 >> 15 [L201] SORT_1 var_52 = var_52_arg_0 >> 15; [L202] SORT_11 var_49_arg_0 = var_18; [L203] EXPR var_49_arg_0 >> 15 [L203] SORT_1 var_49 = var_49_arg_0 >> 15; [L204] SORT_11 var_46_arg_0 = var_18; [L205] EXPR var_46_arg_0 >> 15 [L205] SORT_1 var_46 = var_46_arg_0 >> 15; [L206] SORT_11 var_43_arg_0 = var_18; [L207] EXPR var_43_arg_0 >> 15 [L207] SORT_1 var_43 = var_43_arg_0 >> 15; [L208] SORT_11 var_40_arg_0 = var_18; [L209] EXPR var_40_arg_0 >> 15 [L209] SORT_1 var_40 = var_40_arg_0 >> 15; [L210] SORT_11 var_37_arg_0 = var_18; [L211] EXPR var_37_arg_0 >> 15 [L211] SORT_1 var_37 = var_37_arg_0 >> 15; [L212] SORT_11 var_34_arg_0 = var_18; [L213] EXPR var_34_arg_0 >> 15 [L213] SORT_1 var_34 = var_34_arg_0 >> 15; [L214] SORT_11 var_31_arg_0 = var_18; [L215] EXPR var_31_arg_0 >> 15 [L215] SORT_1 var_31 = var_31_arg_0 >> 15; [L216] SORT_11 var_28_arg_0 = var_18; [L217] EXPR var_28_arg_0 >> 15 [L217] SORT_1 var_28 = var_28_arg_0 >> 15; [L218] SORT_11 var_25_arg_0 = var_18; [L219] EXPR var_25_arg_0 >> 15 [L219] SORT_1 var_25 = var_25_arg_0 >> 15; [L220] SORT_11 var_22_arg_0 = var_18; [L221] EXPR var_22_arg_0 >> 15 [L221] SORT_1 var_22 = var_22_arg_0 >> 15; [L222] SORT_1 var_24_arg_0 = var_22; [L223] SORT_11 var_24_arg_1 = var_18; [L224] SORT_23 var_24 = ((SORT_23)var_24_arg_0 << 16) | var_24_arg_1; [L225] var_24 = var_24 & mask_SORT_23 [L226] SORT_1 var_27_arg_0 = var_25; [L227] SORT_23 var_27_arg_1 = var_24; [L228] SORT_26 var_27 = ((SORT_26)var_27_arg_0 << 17) | var_27_arg_1; [L229] var_27 = var_27 & mask_SORT_26 [L230] SORT_1 var_30_arg_0 = var_28; [L231] SORT_26 var_30_arg_1 = var_27; [L232] SORT_29 var_30 = ((SORT_29)var_30_arg_0 << 18) | var_30_arg_1; [L233] var_30 = var_30 & mask_SORT_29 [L234] SORT_1 var_33_arg_0 = var_31; [L235] SORT_29 var_33_arg_1 = var_30; [L236] SORT_32 var_33 = ((SORT_32)var_33_arg_0 << 19) | var_33_arg_1; [L237] var_33 = var_33 & mask_SORT_32 [L238] SORT_1 var_36_arg_0 = var_34; [L239] SORT_32 var_36_arg_1 = var_33; [L240] SORT_35 var_36 = ((SORT_35)var_36_arg_0 << 20) | var_36_arg_1; [L241] var_36 = var_36 & mask_SORT_35 [L242] SORT_1 var_39_arg_0 = var_37; [L243] SORT_35 var_39_arg_1 = var_36; [L244] SORT_38 var_39 = ((SORT_38)var_39_arg_0 << 21) | var_39_arg_1; [L245] var_39 = var_39 & mask_SORT_38 [L246] SORT_1 var_42_arg_0 = var_40; [L247] SORT_38 var_42_arg_1 = var_39; [L248] SORT_41 var_42 = ((SORT_41)var_42_arg_0 << 22) | var_42_arg_1; [L249] var_42 = var_42 & mask_SORT_41 [L250] SORT_1 var_45_arg_0 = var_43; [L251] SORT_41 var_45_arg_1 = var_42; [L252] SORT_44 var_45 = ((SORT_44)var_45_arg_0 << 23) | var_45_arg_1; [L253] var_45 = var_45 & mask_SORT_44 [L254] SORT_1 var_48_arg_0 = var_46; [L255] SORT_44 var_48_arg_1 = var_45; [L256] SORT_47 var_48 = ((SORT_47)var_48_arg_0 << 24) | var_48_arg_1; [L257] var_48 = var_48 & mask_SORT_47 [L258] SORT_1 var_51_arg_0 = var_49; [L259] SORT_47 var_51_arg_1 = var_48; [L260] SORT_50 var_51 = ((SORT_50)var_51_arg_0 << 25) | var_51_arg_1; [L261] var_51 = var_51 & mask_SORT_50 [L262] SORT_1 var_54_arg_0 = var_52; [L263] SORT_50 var_54_arg_1 = var_51; [L264] SORT_53 var_54 = ((SORT_53)var_54_arg_0 << 26) | var_54_arg_1; [L265] var_54 = var_54 & mask_SORT_53 [L266] SORT_1 var_57_arg_0 = var_55; [L267] SORT_53 var_57_arg_1 = var_54; [L268] SORT_56 var_57 = ((SORT_56)var_57_arg_0 << 27) | var_57_arg_1; [L269] var_57 = var_57 & mask_SORT_56 [L270] SORT_1 var_60_arg_0 = var_58; [L271] SORT_56 var_60_arg_1 = var_57; [L272] SORT_59 var_60 = ((SORT_59)var_60_arg_0 << 28) | var_60_arg_1; [L273] var_60 = var_60 & mask_SORT_59 [L274] SORT_1 var_63_arg_0 = var_61; [L275] SORT_59 var_63_arg_1 = var_60; [L276] SORT_62 var_63 = ((SORT_62)var_63_arg_0 << 29) | var_63_arg_1; [L277] var_63 = var_63 & mask_SORT_62 [L278] SORT_1 var_65_arg_0 = var_64; [L279] SORT_62 var_65_arg_1 = var_63; [L280] SORT_9 var_65 = ((SORT_9)var_65_arg_0 << 30) | var_65_arg_1; [L281] SORT_9 var_66_arg_0 = var_65; [L282] var_66_arg_0 = var_66_arg_0 & mask_SORT_9 [L283] SORT_20 var_66 = var_66_arg_0; [L284] SORT_20 var_67_arg_0 = var_21; [L285] SORT_20 var_67_arg_1 = var_66; [L286] SORT_1 var_67 = var_67_arg_0 <= var_67_arg_1; [L287] SORT_1 var_68_arg_0 = var_67; [L288] SORT_1 var_68_arg_1 = var_8; [L289] SORT_1 var_68_arg_2 = var_7; [L290] SORT_1 var_68 = var_68_arg_0 ? var_68_arg_1 : var_68_arg_2; [L291] SORT_1 var_69_arg_0 = input_3; [L292] SORT_1 var_69_arg_1 = var_68; [L293] EXPR var_69_arg_0 ^ var_69_arg_1 [L293] SORT_1 var_69 = var_69_arg_0 ^ var_69_arg_1; [L294] SORT_1 var_70_arg_0 = var_69; [L295] SORT_1 var_70 = ~var_70_arg_0; [L296] SORT_1 var_79_arg_0 = var_78; [L297] SORT_1 var_79_arg_1 = var_70; [L298] SORT_1 var_79_arg_2 = var_8; [L299] SORT_1 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L300] SORT_1 var_80_arg_0 = var_79; [L301] SORT_1 var_80 = ~var_80_arg_0; [L302] SORT_1 var_81_arg_0 = var_79; [L303] SORT_1 var_81 = ~var_81_arg_0; [L304] SORT_1 var_82_arg_0 = var_80; [L305] SORT_1 var_82_arg_1 = var_81; [L306] EXPR var_82_arg_0 & var_82_arg_1 [L306] SORT_1 var_82 = var_82_arg_0 & var_82_arg_1; [L307] EXPR var_82 & mask_SORT_1 [L307] var_82 = var_82 & mask_SORT_1 [L308] SORT_1 bad_83_arg_0 = var_82; [L309] CALL __VERIFIER_assert(!(bad_83_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 2 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 26 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1 IncrementalHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 26 mSDtfsCounter, 1 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 32 NumberOfCodeBlocks, 32 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 15 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 4/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 could not prove your program: unable to determine feasibility of some traces [2023-12-26 02:03:35,584 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...