/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-81.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 22:59:21,076 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 22:59:21,136 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:59:21,139 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 22:59:21,140 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 22:59:21,163 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 22:59:21,163 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 22:59:21,163 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 22:59:21,164 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 22:59:21,167 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 22:59:21,167 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 22:59:21,167 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 22:59:21,167 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 22:59:21,168 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 22:59:21,168 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 22:59:21,168 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 22:59:21,168 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 22:59:21,169 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 22:59:21,169 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 22:59:21,169 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 22:59:21,169 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 22:59:21,169 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 22:59:21,170 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 22:59:21,170 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 22:59:21,170 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 22:59:21,170 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 22:59:21,170 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 22:59:21,170 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 22:59:21,171 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 22:59:21,171 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 22:59:21,172 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 22:59:21,172 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 22:59:21,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 22:59:21,172 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 22:59:21,172 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 22:59:21,172 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 22:59:21,172 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 22:59:21,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 22:59:21,172 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 22:59:21,173 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 22:59:21,173 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 22:59:21,173 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 22:59:21,173 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 22:59:21,173 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:59:21,363 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 22:59:21,376 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 22:59:21,378 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 22:59:21,378 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 22:59:21,380 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 22:59:21,381 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-81.i [2023-12-20 22:59:22,455 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 22:59:22,636 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 22:59:22,637 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-81.i [2023-12-20 22:59:22,644 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a8579d66/1f156a3c56df48be948f84c56228713b/FLAG3b7bdd1c2 [2023-12-20 22:59:22,657 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a8579d66/1f156a3c56df48be948f84c56228713b [2023-12-20 22:59:22,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 22:59:22,660 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 22:59:22,662 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 22:59:22,662 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 22:59:22,665 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 22:59:22,665 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 10:59:22" (1/1) ... [2023-12-20 22:59:22,666 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@981407d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:59:22, skipping insertion in model container [2023-12-20 22:59:22,666 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 10:59:22" (1/1) ... [2023-12-20 22:59:22,691 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 22:59:22,792 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-81.i[915,928] [2023-12-20 22:59:22,821 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 22:59:22,828 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 22:59:22,836 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-81.i[915,928] [2023-12-20 22:59:22,853 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 22:59:22,864 INFO L206 MainTranslator]: Completed translation [2023-12-20 22:59:22,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:59:22 WrapperNode [2023-12-20 22:59:22,865 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 22:59:22,866 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 22:59:22,866 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 22:59:22,866 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 22:59:22,870 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:59:22" (1/1) ... [2023-12-20 22:59:22,880 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:59:22" (1/1) ... [2023-12-20 22:59:22,906 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 132 [2023-12-20 22:59:22,907 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 22:59:22,907 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 22:59:22,907 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 22:59:22,907 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 22:59:22,916 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:59:22" (1/1) ... [2023-12-20 22:59:22,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:59:22" (1/1) ... [2023-12-20 22:59:22,918 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:59:22" (1/1) ... [2023-12-20 22:59:22,926 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:59:22,926 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:59:22" (1/1) ... [2023-12-20 22:59:22,927 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:59:22" (1/1) ... [2023-12-20 22:59:22,930 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:59:22" (1/1) ... [2023-12-20 22:59:22,932 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:59:22" (1/1) ... [2023-12-20 22:59:22,933 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:59:22" (1/1) ... [2023-12-20 22:59:22,934 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:59:22" (1/1) ... [2023-12-20 22:59:22,935 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 22:59:22,936 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 22:59:22,936 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 22:59:22,936 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 22:59:22,936 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:59:22" (1/1) ... [2023-12-20 22:59:22,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 22:59:22,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 22:59:22,975 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:59:22,986 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:59:23,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 22:59:23,013 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-20 22:59:23,013 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-20 22:59:23,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 22:59:23,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 22:59:23,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 22:59:23,099 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 22:59:23,103 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 22:59:23,316 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 22:59:23,337 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 22:59:23,337 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-20 22:59:23,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 10:59:23 BoogieIcfgContainer [2023-12-20 22:59:23,337 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 22:59:23,339 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 22:59:23,339 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 22:59:23,341 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 22:59:23,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 10:59:22" (1/3) ... [2023-12-20 22:59:23,341 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dac58e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 10:59:23, skipping insertion in model container [2023-12-20 22:59:23,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:59:22" (2/3) ... [2023-12-20 22:59:23,341 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dac58e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 10:59:23, skipping insertion in model container [2023-12-20 22:59:23,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 10:59:23" (3/3) ... [2023-12-20 22:59:23,342 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-81.i [2023-12-20 22:59:23,353 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 22:59:23,353 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-20 22:59:23,382 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 22:59:23,386 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;@128a726e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 22:59:23,387 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-20 22:59:23,390 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:59:23,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-20 22:59:23,403 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:59:23,404 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:59:23,404 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:59:23,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:59:23,408 INFO L85 PathProgramCache]: Analyzing trace with hash -932183395, now seen corresponding path program 1 times [2023-12-20 22:59:23,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:59:23,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430758336] [2023-12-20 22:59:23,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:59:23,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:59:23,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:23,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:59:23,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:23,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:59:23,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:23,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:59:23,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:23,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 22:59:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:23,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 22:59:23,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:23,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-20 22:59:23,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:23,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 22:59:23,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:23,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 22:59:23,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:23,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 22:59:23,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:23,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-20 22:59:23,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:23,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-20 22:59:23,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:23,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-20 22:59:23,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:23,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-20 22:59:23,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:23,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-20 22:59:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:23,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-20 22:59:23,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:23,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-20 22:59:23,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:23,632 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:59:23,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:59:23,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430758336] [2023-12-20 22:59:23,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430758336] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:59:23,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:59:23,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-20 22:59:23,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806161825] [2023-12-20 22:59:23,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:59:23,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-20 22:59:23,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:59:23,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-20 22:59:23,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-20 22:59:23,658 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 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (16), 1 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:59:23,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:59:23,695 INFO L93 Difference]: Finished difference Result 99 states and 167 transitions. [2023-12-20 22:59:23,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-20 22:59:23,698 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (16), 1 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:59:23,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:59:23,703 INFO L225 Difference]: With dead ends: 99 [2023-12-20 22:59:23,704 INFO L226 Difference]: Without dead ends: 48 [2023-12-20 22:59:23,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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:59:23,710 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:59:23,711 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:59:23,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-12-20 22:59:23,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2023-12-20 22:59:23,736 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:59:23,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2023-12-20 22:59:23,738 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 103 [2023-12-20 22:59:23,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:59:23,738 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2023-12-20 22:59:23,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (16), 1 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:59:23,738 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2023-12-20 22:59:23,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-20 22:59:23,741 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:59:23,741 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:59:23,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 22:59:23,741 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:59:23,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:59:23,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1346242709, now seen corresponding path program 1 times [2023-12-20 22:59:23,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:59:23,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725767875] [2023-12-20 22:59:23,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:59:23,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:59:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:23,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:59:23,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:23,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:59:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:23,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:59:23,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:23,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 22:59:23,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:23,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 22:59:23,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:23,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-20 22:59:23,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:23,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 22:59:23,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:23,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 22:59:23,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:23,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 22:59:23,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:23,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-20 22:59:23,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:23,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-20 22:59:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:23,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-20 22:59:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:24,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-20 22:59:24,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:24,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-20 22:59:24,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:24,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-20 22:59:24,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:24,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-20 22:59:24,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:24,041 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:59:24,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:59:24,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725767875] [2023-12-20 22:59:24,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725767875] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:59:24,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:59:24,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 22:59:24,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157114839] [2023-12-20 22:59:24,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:59:24,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 22:59:24,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:59:24,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 22:59:24,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-20 22:59:24,044 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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:59:24,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:59:24,225 INFO L93 Difference]: Finished difference Result 151 states and 222 transitions. [2023-12-20 22:59:24,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-20 22:59:24,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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:59:24,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:59:24,227 INFO L225 Difference]: With dead ends: 151 [2023-12-20 22:59:24,227 INFO L226 Difference]: Without dead ends: 104 [2023-12-20 22:59:24,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-20 22:59:24,229 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 77 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 22:59:24,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 235 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 22:59:24,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-12-20 22:59:24,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 93. [2023-12-20 22:59:24,244 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:59:24,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 139 transitions. [2023-12-20 22:59:24,245 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 139 transitions. Word has length 103 [2023-12-20 22:59:24,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:59:24,246 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 139 transitions. [2023-12-20 22:59:24,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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:59:24,246 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 139 transitions. [2023-12-20 22:59:24,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-20 22:59:24,248 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:59:24,248 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:59:24,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-20 22:59:24,249 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:59:24,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:59:24,249 INFO L85 PathProgramCache]: Analyzing trace with hash 2047307287, now seen corresponding path program 1 times [2023-12-20 22:59:24,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:59:24,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257901004] [2023-12-20 22:59:24,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:59:24,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:59:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:25,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:59:25,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:25,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:59:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:25,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:59:25,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:25,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 22:59:25,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:25,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 22:59:25,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:25,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-20 22:59:25,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:25,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 22:59:25,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:25,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 22:59:25,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:25,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 22:59:25,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:25,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-20 22:59:25,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:25,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-20 22:59:25,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:25,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-20 22:59:25,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:25,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-20 22:59:25,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:25,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-20 22:59:25,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:25,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-20 22:59:25,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:25,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-20 22:59:25,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:25,888 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:59:25,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:59:25,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257901004] [2023-12-20 22:59:25,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257901004] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:59:25,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:59:25,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-20 22:59:25,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297868191] [2023-12-20 22:59:25,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:59:25,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-20 22:59:25,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:59:25,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-20 22:59:25,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-12-20 22:59:25,895 INFO L87 Difference]: Start difference. First operand 93 states and 139 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 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:59:26,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:59:26,525 INFO L93 Difference]: Finished difference Result 203 states and 288 transitions. [2023-12-20 22:59:26,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-20 22:59:26,525 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 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:59:26,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:59:26,528 INFO L225 Difference]: With dead ends: 203 [2023-12-20 22:59:26,528 INFO L226 Difference]: Without dead ends: 156 [2023-12-20 22:59:26,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2023-12-20 22:59:26,530 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 230 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-20 22:59:26,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 342 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-20 22:59:26,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-12-20 22:59:26,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 117. [2023-12-20 22:59:26,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 75 states have (on average 1.28) internal successors, (96), 76 states have internal predecessors, (96), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-20 22:59:26,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 172 transitions. [2023-12-20 22:59:26,542 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 172 transitions. Word has length 103 [2023-12-20 22:59:26,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:59:26,542 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 172 transitions. [2023-12-20 22:59:26,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 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:59:26,543 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 172 transitions. [2023-12-20 22:59:26,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-20 22:59:26,544 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:59:26,544 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:59:26,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-20 22:59:26,544 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:59:26,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:59:26,544 INFO L85 PathProgramCache]: Analyzing trace with hash 2047366869, now seen corresponding path program 1 times [2023-12-20 22:59:26,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:59:26,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566129390] [2023-12-20 22:59:26,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:59:26,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:59:26,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:26,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:59:26,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:26,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:59:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:26,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:59:26,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:26,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 22:59:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:26,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 22:59:26,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:26,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-20 22:59:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:26,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 22:59:26,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:26,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 22:59:26,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:26,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 22:59:26,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:26,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-20 22:59:26,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:26,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-20 22:59:26,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:26,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-20 22:59:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:26,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-20 22:59:26,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:26,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-20 22:59:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:26,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-20 22:59:26,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:26,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-20 22:59:26,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:26,697 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 39 proven. 6 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-12-20 22:59:26,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:59:26,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566129390] [2023-12-20 22:59:26,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566129390] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 22:59:26,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356415713] [2023-12-20 22:59:26,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:59:26,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 22:59:26,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 22:59:26,700 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:59:26,724 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:59:26,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:26,806 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-20 22:59:26,810 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 22:59:26,867 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 145 proven. 6 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2023-12-20 22:59:26,867 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 22:59:26,970 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 39 proven. 6 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-12-20 22:59:26,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356415713] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 22:59:26,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 22:59:26,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2023-12-20 22:59:26,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487019617] [2023-12-20 22:59:26,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 22:59:26,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-20 22:59:26,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:59:26,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-20 22:59:26,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-20 22:59:26,977 INFO L87 Difference]: Start difference. First operand 117 states and 172 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-20 22:59:27,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:59:27,221 INFO L93 Difference]: Finished difference Result 297 states and 423 transitions. [2023-12-20 22:59:27,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-20 22:59:27,222 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 103 [2023-12-20 22:59:27,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:59:27,224 INFO L225 Difference]: With dead ends: 297 [2023-12-20 22:59:27,224 INFO L226 Difference]: Without dead ends: 192 [2023-12-20 22:59:27,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 233 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2023-12-20 22:59:27,226 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 186 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 22:59:27,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 136 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 22:59:27,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2023-12-20 22:59:27,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 174. [2023-12-20 22:59:27,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 112 states have (on average 1.2232142857142858) internal successors, (137), 113 states have internal predecessors, (137), 54 states have call successors, (54), 7 states have call predecessors, (54), 7 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-20 22:59:27,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 245 transitions. [2023-12-20 22:59:27,244 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 245 transitions. Word has length 103 [2023-12-20 22:59:27,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:59:27,244 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 245 transitions. [2023-12-20 22:59:27,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-20 22:59:27,245 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 245 transitions. [2023-12-20 22:59:27,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-20 22:59:27,246 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:59:27,246 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:59:27,256 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:59:27,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 22:59:27,453 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:59:27,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:59:27,453 INFO L85 PathProgramCache]: Analyzing trace with hash 2104625171, now seen corresponding path program 1 times [2023-12-20 22:59:27,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:59:27,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931826101] [2023-12-20 22:59:27,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:59:27,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:59:27,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:27,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:59:27,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:27,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:59:27,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:27,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:59:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:27,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 22:59:27,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:27,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 22:59:27,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:27,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-20 22:59:27,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:27,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 22:59:27,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:27,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 22:59:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:27,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 22:59:27,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:27,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-20 22:59:27,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:27,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-20 22:59:27,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:27,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-20 22:59:27,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:27,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-20 22:59:27,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:27,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-20 22:59:27,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:27,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-20 22:59:27,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:27,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-20 22:59:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:27,530 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:59:27,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:59:27,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931826101] [2023-12-20 22:59:27,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931826101] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:59:27,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:59:27,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 22:59:27,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159438373] [2023-12-20 22:59:27,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:59:27,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 22:59:27,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:59:27,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 22:59:27,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 22:59:27,531 INFO L87 Difference]: Start difference. First operand 174 states and 245 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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:59:27,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:59:27,570 INFO L93 Difference]: Finished difference Result 346 states and 484 transitions. [2023-12-20 22:59:27,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 22:59:27,571 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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:59:27,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:59:27,572 INFO L225 Difference]: With dead ends: 346 [2023-12-20 22:59:27,572 INFO L226 Difference]: Without dead ends: 184 [2023-12-20 22:59:27,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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:59:27,573 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 62 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 22:59:27,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 193 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 22:59:27,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2023-12-20 22:59:27,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 174. [2023-12-20 22:59:27,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 112 states have (on average 1.1964285714285714) internal successors, (134), 113 states have internal predecessors, (134), 54 states have call successors, (54), 7 states have call predecessors, (54), 7 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-20 22:59:27,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 242 transitions. [2023-12-20 22:59:27,590 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 242 transitions. Word has length 103 [2023-12-20 22:59:27,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:59:27,590 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 242 transitions. [2023-12-20 22:59:27,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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:59:27,591 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 242 transitions. [2023-12-20 22:59:27,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-20 22:59:27,591 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:59:27,591 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, 1] [2023-12-20 22:59:27,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-20 22:59:27,592 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:59:27,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:59:27,592 INFO L85 PathProgramCache]: Analyzing trace with hash 299731254, now seen corresponding path program 1 times [2023-12-20 22:59:27,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:59:27,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334703963] [2023-12-20 22:59:27,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:59:27,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:59:27,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 22:59:27,617 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-20 22:59:27,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 22:59:27,654 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-20 22:59:27,654 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-20 22:59:27,655 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-20 22:59:27,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-20 22:59:27,658 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-20 22:59:27,660 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 22:59:27,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 10:59:27 BoogieIcfgContainer [2023-12-20 22:59:27,700 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 22:59:27,700 INFO L158 Benchmark]: Toolchain (without parser) took 5040.39ms. Allocated memory was 305.1MB in the beginning and 373.3MB in the end (delta: 68.2MB). Free memory was 260.5MB in the beginning and 131.1MB in the end (delta: 129.4MB). Peak memory consumption was 198.3MB. Max. memory is 8.0GB. [2023-12-20 22:59:27,700 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 216.0MB. Free memory was 165.6MB in the beginning and 165.5MB in the end (delta: 132.9kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 22:59:27,700 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.31ms. Allocated memory is still 305.1MB. Free memory was 260.5MB in the beginning and 247.6MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-20 22:59:27,701 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.13ms. Allocated memory is still 305.1MB. Free memory was 247.6MB in the beginning and 245.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-20 22:59:27,701 INFO L158 Benchmark]: Boogie Preprocessor took 28.24ms. Allocated memory is still 305.1MB. Free memory was 245.2MB in the beginning and 242.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-20 22:59:27,701 INFO L158 Benchmark]: RCFGBuilder took 401.40ms. Allocated memory is still 305.1MB. Free memory was 242.7MB in the beginning and 225.6MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-20 22:59:27,701 INFO L158 Benchmark]: TraceAbstraction took 4361.03ms. Allocated memory was 305.1MB in the beginning and 373.3MB in the end (delta: 68.2MB). Free memory was 224.8MB in the beginning and 131.1MB in the end (delta: 93.7MB). Peak memory consumption was 162.7MB. Max. memory is 8.0GB. [2023-12-20 22:59:27,702 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 216.0MB. Free memory was 165.6MB in the beginning and 165.5MB in the end (delta: 132.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 203.31ms. Allocated memory is still 305.1MB. Free memory was 260.5MB in the beginning and 247.6MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.13ms. Allocated memory is still 305.1MB. Free memory was 247.6MB in the beginning and 245.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.24ms. Allocated memory is still 305.1MB. Free memory was 245.2MB in the beginning and 242.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 401.40ms. Allocated memory is still 305.1MB. Free memory was 242.7MB in the beginning and 225.6MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 4361.03ms. Allocated memory was 305.1MB in the beginning and 373.3MB in the end (delta: 68.2MB). Free memory was 224.8MB in the beginning and 131.1MB in the end (delta: 93.7MB). Peak memory consumption was 162.7MB. 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 someBinaryDOUBLEComparisonOperation at line 103, overapproximation of bitwise operation at line 59. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 9999.5; [L23] unsigned char var_1_2 = 1; [L24] double var_1_3 = 4.5; [L25] double var_1_4 = 2.5; [L26] double var_1_5 = 0.0; [L27] double var_1_6 = 999999999999.3; [L28] signed char var_1_7 = -128; [L29] signed char var_1_11 = -64; [L30] signed char var_1_12 = 5; [L31] signed char var_1_13 = 50; [L32] unsigned char var_1_14 = 0; [L33] unsigned char var_1_15 = 0; [L34] unsigned char var_1_16 = 0; [L35] unsigned char var_1_17 = 0; [L36] signed char last_1_var_1_7 = -128; [L107] isInitial = 1 [L108] FCALL initially() [L109] int k_loop; [L110] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=1, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L110] COND TRUE k_loop < 1 [L111] CALL updateLastVariables() [L100] last_1_var_1_7 = var_1_7 [L111] RET updateLastVariables() [L112] CALL updateVariables() [L72] var_1_2 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L73] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L74] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L74] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L75] var_1_3 = __VERIFIER_nondet_double() [L76] CALL assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L76] RET assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L77] var_1_4 = __VERIFIER_nondet_double() [L78] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L78] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L79] var_1_5 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_5 >= 4611686.018427382800e+12F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_6=9999999999993/10, var_1_7=-128] [L80] RET assume_abort_if_not((var_1_5 >= 4611686.018427382800e+12F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_6=9999999999993/10, var_1_7=-128] [L81] var_1_6 = __VERIFIER_nondet_double() [L82] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L82] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L83] var_1_11 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=126, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=126, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L84] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=126, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L85] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=126, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=126, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L85] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=126, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L86] var_1_13 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=126, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=126, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L87] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=126, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L88] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=126, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=126, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L88] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=126, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L89] var_1_15 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=126, var_1_12=5, var_1_13=126, var_1_14=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=126, var_1_12=5, var_1_13=126, var_1_14=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L90] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=126, var_1_12=5, var_1_13=126, var_1_14=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L91] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=126, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=126, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L91] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=126, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L92] var_1_16 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=126, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=126, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L93] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=126, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L94] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=126, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=126, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L94] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=126, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L95] var_1_17 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=126, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=126, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L96] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=126, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L97] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=126, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=126, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L97] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=126, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L112] RET updateVariables() [L113] CALL step() [L40] signed long int stepLocal_1 = ((((last_1_var_1_7) < (last_1_var_1_7)) ? (last_1_var_1_7) : (last_1_var_1_7))) + last_1_var_1_7; VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_1=-256, var_1_11=126, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L41] COND FALSE !(last_1_var_1_7 <= stepLocal_1) [L44] var_1_12 = var_1_11 VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_1=-256, var_1_11=126, var_1_12=126, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L46] unsigned char stepLocal_3 = var_1_2; [L47] unsigned long int stepLocal_2 = (((25u) > (var_1_12)) ? (25u) : (var_1_12)); VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_1=-256, stepLocal_2=126, stepLocal_3=0, var_1_11=126, var_1_12=126, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L48] COND FALSE !(stepLocal_3 || var_1_15) [L57] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_1=-256, stepLocal_2=126, stepLocal_3=0, var_1_11=126, var_1_12=126, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L59] EXPR var_1_12 ^ var_1_12 [L59] signed long int stepLocal_0 = var_1_12 ^ var_1_12; [L60] COND TRUE ((((-25) < (var_1_12)) ? (-25) : (var_1_12))) != stepLocal_0 VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_0=-1, stepLocal_1=-256, stepLocal_2=126, stepLocal_3=0, var_1_11=126, var_1_12=126, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L61] COND FALSE !(\read(var_1_14)) VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_0=-1, stepLocal_1=-256, stepLocal_2=126, stepLocal_3=0, var_1_11=126, var_1_12=126, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L67] COND FALSE !(\read(var_1_14)) VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_0=-1, stepLocal_1=-256, stepLocal_2=126, stepLocal_3=0, var_1_11=126, var_1_12=126, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L113] RET step() [L114] CALL, EXPR property() [L103] EXPR (var_1_14 ? (var_1_1 == ((double) ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))))) : 1) && ((((((-25) < (var_1_12)) ? (-25) : (var_1_12))) != (var_1_12 ^ var_1_12)) ? (var_1_14 ? (var_1_7 == ((signed char) var_1_11)) : 1) : (var_1_7 == ((signed char) var_1_11))) [L103] EXPR var_1_12 ^ var_1_12 [L103] EXPR (var_1_14 ? (var_1_1 == ((double) ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))))) : 1) && ((((((-25) < (var_1_12)) ? (-25) : (var_1_12))) != (var_1_12 ^ var_1_12)) ? (var_1_14 ? (var_1_7 == ((signed char) var_1_11)) : 1) : (var_1_7 == ((signed char) var_1_11))) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=126, var_1_12=126, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L103-L104] return (((var_1_14 ? (var_1_1 == ((double) ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))))) : 1) && ((((((-25) < (var_1_12)) ? (-25) : (var_1_12))) != (var_1_12 ^ var_1_12)) ? (var_1_14 ? (var_1_7 == ((signed char) var_1_11)) : 1) : (var_1_7 == ((signed char) var_1_11)))) && ((last_1_var_1_7 <= (((((last_1_var_1_7) < (last_1_var_1_7)) ? (last_1_var_1_7) : (last_1_var_1_7))) + last_1_var_1_7)) ? (var_1_12 == ((signed char) (var_1_13 - 1))) : (var_1_12 == ((signed char) var_1_11)))) && ((var_1_2 || var_1_15) ? ((((((25u) > (var_1_12)) ? (25u) : (var_1_12))) <= var_1_12) ? (var_1_2 ? (var_1_14 == ((unsigned char) var_1_16)) : (var_1_14 == ((unsigned char) var_1_17))) : 1) : (var_1_14 == ((unsigned char) var_1_16))) ; [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_7=-128, var_1_11=126, var_1_12=126, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_7=-128, var_1_11=126, var_1_12=126, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 6, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 569 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 555 mSDsluCounter, 974 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 650 mSDsCounter, 234 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 510 IncrementalHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 234 mSolverCounterUnsat, 324 mSDtfsCounter, 510 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 442 GetRequests, 388 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=174occurred in iteration=4, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 78 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 722 NumberOfCodeBlocks, 722 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 714 ConstructedInterpolants, 0 QuantifiedInterpolants, 1968 SizeOfPredicates, 4 NumberOfNonLiveVariables, 254 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 3342/3360 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:59:27,730 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...