/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-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-32.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 22:55:31,143 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 22:55:31,212 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-20 22:55:31,215 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 22:55:31,215 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 22:55:31,242 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 22:55:31,243 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 22:55:31,243 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 22:55:31,244 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 22:55:31,247 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 22:55:31,247 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 22:55:31,247 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 22:55:31,248 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 22:55:31,248 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 22:55:31,249 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 22:55:31,249 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 22:55:31,249 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 22:55:31,249 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 22:55:31,249 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 22:55:31,250 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 22:55:31,250 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 22:55:31,250 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 22:55:31,250 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 22:55:31,250 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 22:55:31,250 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 22:55:31,251 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 22:55:31,251 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 22:55:31,251 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 22:55:31,251 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 22:55:31,252 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 22:55:31,252 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 22:55:31,252 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 22:55:31,253 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 22:55:31,253 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 22:55:31,253 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 22:55:31,253 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 22:55:31,253 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 22:55:31,253 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 22:55:31,254 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 22:55:31,254 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 22:55:31,254 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 22:55:31,254 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 22:55:31,254 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 22:55:31,254 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-20 22:55:31,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 22:55:31,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 22:55:31,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 22:55:31,464 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 22:55:31,464 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 22:55:31,465 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-32.i [2023-12-20 22:55:32,457 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 22:55:32,631 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 22:55:32,631 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-32.i [2023-12-20 22:55:32,636 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8332bcc36/dfccb5ed55aa4184a9aa54bad189691c/FLAG96ba70b15 [2023-12-20 22:55:32,645 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8332bcc36/dfccb5ed55aa4184a9aa54bad189691c [2023-12-20 22:55:32,647 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 22:55:32,648 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 22:55:32,649 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 22:55:32,649 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 22:55:32,653 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 22:55:32,653 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 10:55:32" (1/1) ... [2023-12-20 22:55:32,654 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45952fdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:55:32, skipping insertion in model container [2023-12-20 22:55:32,654 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 10:55:32" (1/1) ... [2023-12-20 22:55:32,669 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 22:55:32,766 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-32.i[915,928] [2023-12-20 22:55:32,810 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 22:55:32,817 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 22:55:32,824 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-32.i[915,928] [2023-12-20 22:55:32,839 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 22:55:32,849 INFO L206 MainTranslator]: Completed translation [2023-12-20 22:55:32,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:55:32 WrapperNode [2023-12-20 22:55:32,849 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 22:55:32,850 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 22:55:32,850 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 22:55:32,850 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 22:55:32,854 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:55:32" (1/1) ... [2023-12-20 22:55:32,859 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:55:32" (1/1) ... [2023-12-20 22:55:32,885 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 143 [2023-12-20 22:55:32,885 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 22:55:32,886 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 22:55:32,886 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 22:55:32,886 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 22:55:32,893 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:55:32" (1/1) ... [2023-12-20 22:55:32,893 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:55:32" (1/1) ... [2023-12-20 22:55:32,903 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:55:32" (1/1) ... [2023-12-20 22:55:32,913 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-20 22:55:32,914 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:55:32" (1/1) ... [2023-12-20 22:55:32,914 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:55:32" (1/1) ... [2023-12-20 22:55:32,918 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:55:32" (1/1) ... [2023-12-20 22:55:32,920 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:55:32" (1/1) ... [2023-12-20 22:55:32,921 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:55:32" (1/1) ... [2023-12-20 22:55:32,922 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:55:32" (1/1) ... [2023-12-20 22:55:32,925 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 22:55:32,925 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 22:55:32,925 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 22:55:32,925 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 22:55:32,926 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:55:32" (1/1) ... [2023-12-20 22:55:32,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 22:55:32,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 22:55:32,948 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-20 22:55:32,983 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-20 22:55:32,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 22:55:32,988 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-20 22:55:32,989 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-20 22:55:32,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 22:55:32,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 22:55:32,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 22:55:33,061 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 22:55:33,064 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 22:55:33,295 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 22:55:33,316 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 22:55:33,317 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-20 22:55:33,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 10:55:33 BoogieIcfgContainer [2023-12-20 22:55:33,317 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 22:55:33,318 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 22:55:33,319 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 22:55:33,321 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 22:55:33,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 10:55:32" (1/3) ... [2023-12-20 22:55:33,321 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f3ed6f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 10:55:33, skipping insertion in model container [2023-12-20 22:55:33,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:55:32" (2/3) ... [2023-12-20 22:55:33,322 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f3ed6f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 10:55:33, skipping insertion in model container [2023-12-20 22:55:33,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 10:55:33" (3/3) ... [2023-12-20 22:55:33,323 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-32.i [2023-12-20 22:55:33,334 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 22:55:33,334 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-20 22:55:33,363 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 22:55:33,367 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;@3313077d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 22:55:33,367 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-20 22:55:33,370 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 32 states have internal predecessors, (44), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-20 22:55:33,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-20 22:55:33,377 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:55:33,377 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 22:55:33,377 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:55:33,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:55:33,381 INFO L85 PathProgramCache]: Analyzing trace with hash 732711065, now seen corresponding path program 1 times [2023-12-20 22:55:33,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:55:33,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263350987] [2023-12-20 22:55:33,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:55:33,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:55:33,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:55:33,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:55:33,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263350987] [2023-12-20 22:55:33,489 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-12-20 22:55:33,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638159862] [2023-12-20 22:55:33,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:55:33,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 22:55:33,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 22:55:33,502 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 22:55:33,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-20 22:55:33,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:55:33,719 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-20 22:55:33,723 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 22:55:33,762 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2023-12-20 22:55:33,762 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 22:55:33,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638159862] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:55:33,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:55:33,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-20 22:55:33,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963601809] [2023-12-20 22:55:33,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:55:33,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-20 22:55:33,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:55:33,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-20 22:55:33,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-20 22:55:33,792 INFO L87 Difference]: Start difference. First operand has 50 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 32 states have internal predecessors, (44), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-20 22:55:33,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:55:33,814 INFO L93 Difference]: Finished difference Result 99 states and 167 transitions. [2023-12-20 22:55:33,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-20 22:55:33,816 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 103 [2023-12-20 22:55:33,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:55:33,820 INFO L225 Difference]: With dead ends: 99 [2023-12-20 22:55:33,821 INFO L226 Difference]: Without dead ends: 48 [2023-12-20 22:55:33,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 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-20 22:55:33,825 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 22:55:33,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 22:55:33,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-12-20 22:55:33,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2023-12-20 22:55:33,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-20 22:55:33,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2023-12-20 22:55:33,853 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 103 [2023-12-20 22:55:33,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:55:33,853 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2023-12-20 22:55:33,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-20 22:55:33,854 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2023-12-20 22:55:33,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-20 22:55:33,855 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:55:33,855 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 22:55:33,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-20 22:55:34,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-12-20 22:55:34,061 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:55:34,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:55:34,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1163077785, now seen corresponding path program 1 times [2023-12-20 22:55:34,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:55:34,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297611817] [2023-12-20 22:55:34,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:55:34,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:55:34,094 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 22:55:34,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1608630936] [2023-12-20 22:55:34,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:55:34,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 22:55:34,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 22:55:34,106 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 22:55:34,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-20 22:55:34,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:55:34,175 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-20 22:55:34,178 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 22:55:34,291 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-20 22:55:34,291 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 22:55:34,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:55:34,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297611817] [2023-12-20 22:55:34,291 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 22:55:34,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608630936] [2023-12-20 22:55:34,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608630936] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:55:34,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:55:34,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 22:55:34,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468346618] [2023-12-20 22:55:34,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:55:34,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 22:55:34,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:55:34,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 22:55:34,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 22:55:34,294 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-20 22:55:34,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:55:34,367 INFO L93 Difference]: Finished difference Result 157 states and 231 transitions. [2023-12-20 22:55:34,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 22:55:34,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 103 [2023-12-20 22:55:34,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:55:34,369 INFO L225 Difference]: With dead ends: 157 [2023-12-20 22:55:34,369 INFO L226 Difference]: Without dead ends: 110 [2023-12-20 22:55:34,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 100 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-20 22:55:34,370 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 60 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 22:55:34,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 205 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 22:55:34,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-12-20 22:55:34,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 93. [2023-12-20 22:55:34,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 58 states have (on average 1.293103448275862) internal successors, (75), 58 states have internal predecessors, (75), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-20 22:55:34,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 139 transitions. [2023-12-20 22:55:34,386 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 139 transitions. Word has length 103 [2023-12-20 22:55:34,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:55:34,386 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 139 transitions. [2023-12-20 22:55:34,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-20 22:55:34,387 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 139 transitions. [2023-12-20 22:55:34,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-20 22:55:34,388 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:55:34,388 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 22:55:34,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-20 22:55:34,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-12-20 22:55:34,593 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:55:34,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:55:34,594 INFO L85 PathProgramCache]: Analyzing trace with hash 576271771, now seen corresponding path program 1 times [2023-12-20 22:55:34,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:55:34,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847279984] [2023-12-20 22:55:34,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:55:34,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:55:34,636 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 22:55:34,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1023183429] [2023-12-20 22:55:34,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:55:34,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 22:55:34,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 22:55:34,642 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 22:55:34,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-20 22:55:34,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 22:55:34,769 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-20 22:55:34,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 22:55:34,857 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-20 22:55:34,858 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-20 22:55:34,858 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-20 22:55:34,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-20 22:55:35,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 22:55:35,079 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-20 22:55:35,082 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 22:55:35,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 10:55:35 BoogieIcfgContainer [2023-12-20 22:55:35,172 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 22:55:35,172 INFO L158 Benchmark]: Toolchain (without parser) took 2524.26ms. Allocated memory is still 186.6MB. Free memory was 152.3MB in the beginning and 76.0MB in the end (delta: 76.3MB). Peak memory consumption was 76.7MB. Max. memory is 8.0GB. [2023-12-20 22:55:35,172 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 186.6MB. Free memory is still 144.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 22:55:35,173 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.15ms. Allocated memory is still 186.6MB. Free memory was 152.3MB in the beginning and 139.2MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-20 22:55:35,173 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.63ms. Allocated memory is still 186.6MB. Free memory was 139.2MB in the beginning and 135.9MB in the end (delta: 3.3MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-20 22:55:35,173 INFO L158 Benchmark]: Boogie Preprocessor took 38.64ms. Allocated memory is still 186.6MB. Free memory was 135.9MB in the beginning and 131.3MB in the end (delta: 4.6MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-20 22:55:35,173 INFO L158 Benchmark]: RCFGBuilder took 391.95ms. Allocated memory is still 186.6MB. Free memory was 131.3MB in the beginning and 111.4MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-12-20 22:55:35,174 INFO L158 Benchmark]: TraceAbstraction took 1853.47ms. Allocated memory is still 186.6MB. Free memory was 111.0MB in the beginning and 76.0MB in the end (delta: 35.0MB). Peak memory consumption was 35.8MB. Max. memory is 8.0GB. [2023-12-20 22:55:35,175 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.12ms. Allocated memory is still 186.6MB. Free memory is still 144.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 200.15ms. Allocated memory is still 186.6MB. Free memory was 152.3MB in the beginning and 139.2MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.63ms. Allocated memory is still 186.6MB. Free memory was 139.2MB in the beginning and 135.9MB in the end (delta: 3.3MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.64ms. Allocated memory is still 186.6MB. Free memory was 135.9MB in the beginning and 131.3MB in the end (delta: 4.6MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 391.95ms. Allocated memory is still 186.6MB. Free memory was 131.3MB in the beginning and 111.4MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 1853.47ms. Allocated memory is still 186.6MB. Free memory was 111.0MB in the beginning and 76.0MB in the end (delta: 35.0MB). Peak memory consumption was 35.8MB. 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: 19]: 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 90. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 0; [L23] unsigned short int var_1_3 = 128; [L24] unsigned short int var_1_4 = 4; [L25] unsigned short int var_1_5 = 0; [L26] signed short int var_1_6 = 0; [L27] unsigned char var_1_7 = 1; [L28] signed short int var_1_8 = -2; [L29] signed short int var_1_9 = 500; [L30] unsigned long int var_1_10 = 10; [L31] unsigned char var_1_11 = 2; [L32] unsigned char var_1_12 = 64; [L33] unsigned long int var_1_13 = 1; [L34] unsigned long int last_1_var_1_10 = 10; [L35] unsigned long int last_1_var_1_13 = 1; [L94] isInitial = 1 [L95] FCALL initially() [L96] int k_loop; [L97] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=128, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L97] COND TRUE k_loop < 1 [L98] CALL updateLastVariables() [L86] last_1_var_1_10 = var_1_10 [L87] last_1_var_1_13 = var_1_13 [L98] RET updateLastVariables() [L99] CALL updateVariables() [L60] var_1_3 = __VERIFIER_nondet_ushort() [L61] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L61] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L62] CALL assume_abort_if_not(var_1_3 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L62] RET assume_abort_if_not(var_1_3 <= 32767) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L63] var_1_4 = __VERIFIER_nondet_ushort() [L64] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L64] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L65] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=115, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=115, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L65] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=115, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L66] var_1_5 = __VERIFIER_nondet_ushort() [L67] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=115, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=115, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L67] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=115, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L68] CALL assume_abort_if_not(var_1_5 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=115, var_1_5=65534, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=115, var_1_5=65534, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L68] RET assume_abort_if_not(var_1_5 <= 65534) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=115, var_1_5=65534, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L69] var_1_7 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=115, var_1_5=65534, var_1_6=0, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=115, var_1_5=65534, var_1_6=0, var_1_8=-2, var_1_9=500] [L70] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=115, var_1_5=65534, var_1_6=0, var_1_8=-2, var_1_9=500] [L71] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=115, var_1_5=65534, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=115, var_1_5=65534, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L71] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=115, var_1_5=65534, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L72] var_1_8 = __VERIFIER_nondet_short() [L73] CALL assume_abort_if_not(var_1_8 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=115, var_1_5=65534, var_1_6=0, var_1_7=1, var_1_8=16383, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=115, var_1_5=65534, var_1_6=0, var_1_7=1, var_1_8=16383, var_1_9=500] [L73] RET assume_abort_if_not(var_1_8 >= -16383) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=115, var_1_5=65534, var_1_6=0, var_1_7=1, var_1_8=16383, var_1_9=500] [L74] CALL assume_abort_if_not(var_1_8 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=115, var_1_5=65534, var_1_6=0, var_1_7=1, var_1_8=16383, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=115, var_1_5=65534, var_1_6=0, var_1_7=1, var_1_8=16383, var_1_9=500] [L74] RET assume_abort_if_not(var_1_8 <= 16383) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=115, var_1_5=65534, var_1_6=0, var_1_7=1, var_1_8=16383, var_1_9=500] [L75] var_1_9 = __VERIFIER_nondet_short() [L76] CALL assume_abort_if_not(var_1_9 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=115, var_1_5=65534, var_1_6=0, var_1_7=1, var_1_8=16383, var_1_9=-2558] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=115, var_1_5=65534, var_1_6=0, var_1_7=1, var_1_8=16383, var_1_9=-2558] [L76] RET assume_abort_if_not(var_1_9 >= -16383) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=115, var_1_5=65534, var_1_6=0, var_1_7=1, var_1_8=16383, var_1_9=-2558] [L77] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=115, var_1_5=65534, var_1_6=0, var_1_7=1, var_1_8=16383, var_1_9=-2558] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=115, var_1_5=65534, var_1_6=0, var_1_7=1, var_1_8=16383, var_1_9=-2558] [L77] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=115, var_1_5=65534, var_1_6=0, var_1_7=1, var_1_8=16383, var_1_9=-2558] [L78] var_1_11 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=101, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=115, var_1_5=65534, var_1_6=0, var_1_7=1, var_1_8=16383, var_1_9=-2558] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=101, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=115, var_1_5=65534, var_1_6=0, var_1_7=1, var_1_8=16383, var_1_9=-2558] [L79] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=101, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=115, var_1_5=65534, var_1_6=0, var_1_7=1, var_1_8=16383, var_1_9=-2558] [L80] CALL assume_abort_if_not(var_1_11 <= 128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=101, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=115, var_1_5=65534, var_1_6=0, var_1_7=1, var_1_8=16383, var_1_9=-2558] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=101, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=115, var_1_5=65534, var_1_6=0, var_1_7=1, var_1_8=16383, var_1_9=-2558] [L80] RET assume_abort_if_not(var_1_11 <= 128) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=101, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=115, var_1_5=65534, var_1_6=0, var_1_7=1, var_1_8=16383, var_1_9=-2558] [L81] var_1_12 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_12 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=101, var_1_12=115, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=115, var_1_5=65534, var_1_6=0, var_1_7=1, var_1_8=16383, var_1_9=-2558] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=101, var_1_12=115, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=115, var_1_5=65534, var_1_6=0, var_1_7=1, var_1_8=16383, var_1_9=-2558] [L82] RET assume_abort_if_not(var_1_12 >= 1) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=101, var_1_12=115, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=115, var_1_5=65534, var_1_6=0, var_1_7=1, var_1_8=16383, var_1_9=-2558] [L83] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=101, var_1_12=115, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=115, var_1_5=65534, var_1_6=0, var_1_7=1, var_1_8=16383, var_1_9=-2558] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=101, var_1_12=115, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=115, var_1_5=65534, var_1_6=0, var_1_7=1, var_1_8=16383, var_1_9=-2558] [L83] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=101, var_1_12=115, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=115, var_1_5=65534, var_1_6=0, var_1_7=1, var_1_8=16383, var_1_9=-2558] [L99] RET updateVariables() [L100] CALL step() [L39] COND FALSE !(last_1_var_1_13 >= -50) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=101, var_1_12=115, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=115, var_1_5=65534, var_1_6=0, var_1_7=1, var_1_8=16383, var_1_9=-2558] [L42] EXPR var_1_11 & var_1_12 [L42] signed long int stepLocal_0 = var_1_11 & var_1_12; [L43] COND TRUE \read(var_1_7) [L44] var_1_13 = ((((var_1_11) > (var_1_1)) ? (var_1_11) : (var_1_1))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=-2147483648, var_1_10=10, var_1_11=101, var_1_12=115, var_1_13=101, var_1_1=0, var_1_3=0, var_1_4=115, var_1_5=65534, var_1_6=0, var_1_7=1, var_1_8=16383, var_1_9=-2558] [L50] COND TRUE \read(var_1_7) [L51] var_1_6 = (var_1_8 + var_1_9) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=-2147483648, var_1_10=10, var_1_11=101, var_1_12=115, var_1_13=101, var_1_1=0, var_1_3=0, var_1_4=115, var_1_5=65534, var_1_6=13825, var_1_7=1, var_1_8=16383, var_1_9=-2558] [L53] EXPR var_1_8 << var_1_5 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=-2147483648, var_1_10=10, var_1_11=101, var_1_12=115, var_1_13=101, var_1_1=0, var_1_3=0, var_1_4=115, var_1_5=65534, var_1_6=13825, var_1_7=1, var_1_8=16383, var_1_9=-2558] [L53] COND TRUE (var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5)) [L54] var_1_10 = ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=-2147483648, var_1_10=115, var_1_11=101, var_1_12=115, var_1_13=101, var_1_1=0, var_1_3=0, var_1_4=115, var_1_5=65534, var_1_6=13825, var_1_7=1, var_1_8=16383, var_1_9=-2558] [L100] RET step() [L101] CALL, EXPR property() [L90] EXPR (((last_1_var_1_13 >= -50) ? (var_1_1 == ((unsigned short int) (((((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) > (var_1_5)) ? ((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5))))) : 1) && (var_1_7 ? (var_1_6 == ((signed short int) (var_1_8 + var_1_9))) : 1)) && (((var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5))) ? (var_1_10 == ((unsigned long int) ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))))) : (var_1_10 == ((unsigned long int) var_1_11))) [L90] EXPR var_1_8 << var_1_5 [L90] EXPR (((last_1_var_1_13 >= -50) ? (var_1_1 == ((unsigned short int) (((((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) > (var_1_5)) ? ((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5))))) : 1) && (var_1_7 ? (var_1_6 == ((signed short int) (var_1_8 + var_1_9))) : 1)) && (((var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5))) ? (var_1_10 == ((unsigned long int) ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))))) : (var_1_10 == ((unsigned long int) var_1_11))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=115, var_1_11=101, var_1_12=115, var_1_13=101, var_1_1=0, var_1_3=0, var_1_4=115, var_1_5=65534, var_1_6=13825, var_1_7=1, var_1_8=16383, var_1_9=-2558] [L90] EXPR ((((last_1_var_1_13 >= -50) ? (var_1_1 == ((unsigned short int) (((((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) > (var_1_5)) ? ((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5))))) : 1) && (var_1_7 ? (var_1_6 == ((signed short int) (var_1_8 + var_1_9))) : 1)) && (((var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5))) ? (var_1_10 == ((unsigned long int) ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))))) : (var_1_10 == ((unsigned long int) var_1_11)))) && (var_1_7 ? (var_1_13 == ((unsigned long int) ((((var_1_11) > (var_1_1)) ? (var_1_11) : (var_1_1))))) : (((var_1_11 & var_1_12) != var_1_1) ? (var_1_13 == ((unsigned long int) var_1_12)) : 1)) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=115, var_1_11=101, var_1_12=115, var_1_13=101, var_1_1=0, var_1_3=0, var_1_4=115, var_1_5=65534, var_1_6=13825, var_1_7=1, var_1_8=16383, var_1_9=-2558] [L90-L91] return ((((last_1_var_1_13 >= -50) ? (var_1_1 == ((unsigned short int) (((((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) > (var_1_5)) ? ((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5))))) : 1) && (var_1_7 ? (var_1_6 == ((signed short int) (var_1_8 + var_1_9))) : 1)) && (((var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5))) ? (var_1_10 == ((unsigned long int) ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))))) : (var_1_10 == ((unsigned long int) var_1_11)))) && (var_1_7 ? (var_1_13 == ((unsigned long int) ((((var_1_11) > (var_1_1)) ? (var_1_11) : (var_1_1))))) : (((var_1_11 & var_1_12) != var_1_1) ? (var_1_13 == ((unsigned long int) var_1_12)) : 1)) ; [L101] RET, EXPR property() [L101] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=115, var_1_11=101, var_1_12=115, var_1_13=101, var_1_1=0, var_1_3=0, var_1_4=115, var_1_5=65534, var_1_6=13825, var_1_7=1, var_1_8=16383, var_1_9=-2558] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=115, var_1_11=101, var_1_12=115, var_1_13=101, var_1_1=0, var_1_3=0, var_1_4=115, var_1_5=65534, var_1_6=13825, var_1_7=1, var_1_8=16383, var_1_9=-2558] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 3, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 60 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 60 mSDsluCounter, 273 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 126 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 30 IncrementalHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 147 mSDtfsCounter, 30 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 205 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=2, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 17 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 412 NumberOfCodeBlocks, 412 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 204 ConstructedInterpolants, 0 QuantifiedInterpolants, 384 SizeOfPredicates, 1 NumberOfNonLiveVariables, 500 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 960/960 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-20 22:55:35,186 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...