/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_variablewrapping_normal_file-97.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 01:39:21,961 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 01:39:22,035 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-21 01:39:22,038 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 01:39:22,039 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 01:39:22,061 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 01:39:22,062 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 01:39:22,062 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 01:39:22,062 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 01:39:22,065 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 01:39:22,065 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 01:39:22,065 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 01:39:22,066 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 01:39:22,067 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 01:39:22,067 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 01:39:22,067 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 01:39:22,067 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 01:39:22,067 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 01:39:22,068 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 01:39:22,068 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 01:39:22,068 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 01:39:22,068 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 01:39:22,068 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 01:39:22,069 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 01:39:22,069 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 01:39:22,069 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 01:39:22,069 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 01:39:22,069 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 01:39:22,070 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 01:39:22,070 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 01:39:22,071 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 01:39:22,071 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 01:39:22,071 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 01:39:22,071 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 01:39:22,071 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 01:39:22,071 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 01:39:22,071 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 01:39:22,071 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 01:39:22,072 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 01:39:22,072 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 01:39:22,072 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 01:39:22,072 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 01:39:22,072 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 01:39:22,072 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-21 01:39:22,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 01:39:22,296 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 01:39:22,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 01:39:22,299 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 01:39:22,299 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 01:39:22,300 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_normal_file-97.i [2023-12-21 01:39:23,396 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 01:39:23,585 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 01:39:23,588 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_normal_file-97.i [2023-12-21 01:39:23,594 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c93b51e2/2daa983b6f9f418a92a668031b9fa044/FLAG6abbd8045 [2023-12-21 01:39:23,610 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c93b51e2/2daa983b6f9f418a92a668031b9fa044 [2023-12-21 01:39:23,612 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 01:39:23,613 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 01:39:23,614 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 01:39:23,614 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 01:39:23,617 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 01:39:23,617 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 01:39:23" (1/1) ... [2023-12-21 01:39:23,618 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@166991f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:39:23, skipping insertion in model container [2023-12-21 01:39:23,618 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 01:39:23" (1/1) ... [2023-12-21 01:39:23,633 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 01:39:23,718 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_variablewrapping_normal_file-97.i[913,926] [2023-12-21 01:39:23,739 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 01:39:23,747 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 01:39:23,755 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_variablewrapping_normal_file-97.i[913,926] [2023-12-21 01:39:23,779 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 01:39:23,790 INFO L206 MainTranslator]: Completed translation [2023-12-21 01:39:23,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:39:23 WrapperNode [2023-12-21 01:39:23,791 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 01:39:23,791 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 01:39:23,791 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 01:39:23,791 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 01:39:23,796 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:39:23" (1/1) ... [2023-12-21 01:39:23,803 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:39:23" (1/1) ... [2023-12-21 01:39:23,823 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 131 [2023-12-21 01:39:23,823 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 01:39:23,824 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 01:39:23,824 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 01:39:23,824 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 01:39:23,832 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:39:23" (1/1) ... [2023-12-21 01:39:23,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:39:23" (1/1) ... [2023-12-21 01:39:23,834 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:39:23" (1/1) ... [2023-12-21 01:39:23,847 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-21 01:39:23,848 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:39:23" (1/1) ... [2023-12-21 01:39:23,848 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:39:23" (1/1) ... [2023-12-21 01:39:23,852 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:39:23" (1/1) ... [2023-12-21 01:39:23,856 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:39:23" (1/1) ... [2023-12-21 01:39:23,857 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:39:23" (1/1) ... [2023-12-21 01:39:23,858 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:39:23" (1/1) ... [2023-12-21 01:39:23,861 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 01:39:23,884 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 01:39:23,885 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 01:39:23,885 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 01:39:23,886 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:39:23" (1/1) ... [2023-12-21 01:39:23,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 01:39:23,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 01:39:23,922 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-21 01:39:23,930 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-21 01:39:23,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 01:39:23,944 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 01:39:23,944 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 01:39:23,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 01:39:23,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 01:39:23,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 01:39:24,020 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 01:39:24,023 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 01:39:24,225 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 01:39:24,259 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 01:39:24,259 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-21 01:39:24,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 01:39:24 BoogieIcfgContainer [2023-12-21 01:39:24,259 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 01:39:24,261 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 01:39:24,261 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 01:39:24,263 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 01:39:24,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 01:39:23" (1/3) ... [2023-12-21 01:39:24,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73b1127e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 01:39:24, skipping insertion in model container [2023-12-21 01:39:24,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:39:23" (2/3) ... [2023-12-21 01:39:24,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73b1127e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 01:39:24, skipping insertion in model container [2023-12-21 01:39:24,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 01:39:24" (3/3) ... [2023-12-21 01:39:24,265 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-97.i [2023-12-21 01:39:24,277 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 01:39:24,277 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 01:39:24,319 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 01:39:24,324 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;@621b2781, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 01:39:24,325 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 01:39:24,330 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-21 01:39:24,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-21 01:39:24,352 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:39:24,352 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:39:24,353 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:39:24,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:39:24,357 INFO L85 PathProgramCache]: Analyzing trace with hash 762341890, now seen corresponding path program 1 times [2023-12-21 01:39:24,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:39:24,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520341859] [2023-12-21 01:39:24,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:39:24,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:39:24,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:24,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:39:24,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:24,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 01:39:24,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:24,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-21 01:39:24,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:24,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-21 01:39:24,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:24,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-21 01:39:24,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:24,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:39:24,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:24,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:39:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:24,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-21 01:39:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:24,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-21 01:39:24,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:24,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-21 01:39:24,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:24,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-21 01:39:24,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:24,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:39:24,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:24,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:39:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:24,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-21 01:39:24,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:24,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-21 01:39:24,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:24,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-21 01:39:24,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:24,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-21 01:39:24,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:24,627 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 01:39:24,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:39:24,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520341859] [2023-12-21 01:39:24,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520341859] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:39:24,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:39:24,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 01:39:24,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954974889] [2023-12-21 01:39:24,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:39:24,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 01:39:24,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:39:24,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 01:39:24,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 01:39:24,663 INFO L87 Difference]: Start difference. First operand has 50 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-21 01:39:24,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:39:24,716 INFO L93 Difference]: Finished difference Result 97 states and 171 transitions. [2023-12-21 01:39:24,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 01:39:24,719 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 104 [2023-12-21 01:39:24,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:39:24,725 INFO L225 Difference]: With dead ends: 97 [2023-12-21 01:39:24,725 INFO L226 Difference]: Without dead ends: 48 [2023-12-21 01:39:24,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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-21 01:39:24,732 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:39:24,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:39:24,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-12-21 01:39:24,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2023-12-21 01:39:24,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 29 states have internal predecessors, (39), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-21 01:39:24,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 73 transitions. [2023-12-21 01:39:24,770 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 73 transitions. Word has length 104 [2023-12-21 01:39:24,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:39:24,771 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 73 transitions. [2023-12-21 01:39:24,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-21 01:39:24,771 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 73 transitions. [2023-12-21 01:39:24,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-21 01:39:24,775 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:39:24,775 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:39:24,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 01:39:24,776 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:39:24,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:39:24,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1476973760, now seen corresponding path program 1 times [2023-12-21 01:39:24,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:39:24,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399494538] [2023-12-21 01:39:24,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:39:24,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:39:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:25,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:39:25,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:25,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 01:39:25,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:25,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-21 01:39:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:25,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-21 01:39:25,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:25,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-21 01:39:25,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:25,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:39:25,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:25,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:39:25,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:25,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-21 01:39:25,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:25,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-21 01:39:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:25,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-21 01:39:25,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:25,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-21 01:39:25,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:25,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:39:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:25,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:39:25,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:25,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-21 01:39:25,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:25,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-21 01:39:25,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:25,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-21 01:39:25,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:25,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-21 01:39:25,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:25,182 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 01:39:25,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:39:25,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399494538] [2023-12-21 01:39:25,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399494538] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:39:25,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:39:25,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 01:39:25,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206101440] [2023-12-21 01:39:25,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:39:25,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 01:39:25,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:39:25,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 01:39:25,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:39:25,191 INFO L87 Difference]: Start difference. First operand 48 states and 73 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 01:39:25,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:39:25,300 INFO L93 Difference]: Finished difference Result 137 states and 207 transitions. [2023-12-21 01:39:25,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 01:39:25,301 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 104 [2023-12-21 01:39:25,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:39:25,304 INFO L225 Difference]: With dead ends: 137 [2023-12-21 01:39:25,304 INFO L226 Difference]: Without dead ends: 90 [2023-12-21 01:39:25,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-21 01:39:25,307 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 62 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:39:25,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 408 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:39:25,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-12-21 01:39:25,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 51. [2023-12-21 01:39:25,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-21 01:39:25,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 76 transitions. [2023-12-21 01:39:25,324 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 76 transitions. Word has length 104 [2023-12-21 01:39:25,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:39:25,327 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 76 transitions. [2023-12-21 01:39:25,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 01:39:25,327 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 76 transitions. [2023-12-21 01:39:25,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-21 01:39:25,331 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:39:25,331 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:39:25,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 01:39:25,331 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:39:25,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:39:25,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1154856133, now seen corresponding path program 1 times [2023-12-21 01:39:25,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:39:25,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869296071] [2023-12-21 01:39:25,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:39:25,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:39:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:25,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:39:25,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:25,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 01:39:25,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:25,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-21 01:39:25,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:25,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-21 01:39:25,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:25,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-21 01:39:25,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:25,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:39:25,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:25,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:39:25,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:25,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-21 01:39:25,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:25,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-21 01:39:25,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:25,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-21 01:39:25,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:25,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-21 01:39:25,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:25,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:39:25,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:25,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:39:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:25,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-21 01:39:25,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:25,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-21 01:39:25,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:25,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-21 01:39:25,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:25,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-21 01:39:25,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:25,609 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 01:39:25,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:39:25,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869296071] [2023-12-21 01:39:25,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869296071] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:39:25,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:39:25,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 01:39:25,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021665217] [2023-12-21 01:39:25,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:39:25,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 01:39:25,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:39:25,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 01:39:25,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:39:25,615 INFO L87 Difference]: Start difference. First operand 51 states and 76 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 01:39:25,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:39:25,790 INFO L93 Difference]: Finished difference Result 181 states and 268 transitions. [2023-12-21 01:39:25,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 01:39:25,791 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 105 [2023-12-21 01:39:25,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:39:25,794 INFO L225 Difference]: With dead ends: 181 [2023-12-21 01:39:25,794 INFO L226 Difference]: Without dead ends: 131 [2023-12-21 01:39:25,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-21 01:39:25,797 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 123 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:39:25,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 428 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:39:25,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-12-21 01:39:25,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 52. [2023-12-21 01:39:25,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-21 01:39:25,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2023-12-21 01:39:25,811 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 105 [2023-12-21 01:39:25,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:39:25,812 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. [2023-12-21 01:39:25,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 01:39:25,813 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2023-12-21 01:39:25,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-21 01:39:25,815 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:39:25,815 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:39:25,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 01:39:25,815 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:39:25,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:39:25,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1704519525, now seen corresponding path program 1 times [2023-12-21 01:39:25,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:39:25,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635061437] [2023-12-21 01:39:25,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:39:25,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:39:25,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:26,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:39:26,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:26,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 01:39:26,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:26,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-21 01:39:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:26,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-21 01:39:26,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:26,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-21 01:39:26,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:26,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:39:26,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:26,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:39:26,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:26,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-21 01:39:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:26,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-21 01:39:26,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:26,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-21 01:39:26,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:26,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-21 01:39:26,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:26,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:39:26,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:26,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:39:26,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:26,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-21 01:39:26,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:26,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-21 01:39:26,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:26,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-21 01:39:26,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:26,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-21 01:39:26,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:26,214 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 63 proven. 27 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2023-12-21 01:39:26,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:39:26,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635061437] [2023-12-21 01:39:26,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635061437] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 01:39:26,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266386647] [2023-12-21 01:39:26,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:39:26,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:39:26,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 01:39:26,217 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-21 01:39:26,245 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-21 01:39:26,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:26,299 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-21 01:39:26,307 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 01:39:26,546 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 302 proven. 27 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2023-12-21 01:39:26,546 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 01:39:26,794 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 63 proven. 30 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2023-12-21 01:39:26,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266386647] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 01:39:26,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 01:39:26,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2023-12-21 01:39:26,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179526030] [2023-12-21 01:39:26,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 01:39:26,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-21 01:39:26,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:39:26,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-21 01:39:26,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-12-21 01:39:26,796 INFO L87 Difference]: Start difference. First operand 52 states and 76 transitions. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 3 states have call successors, (23), 3 states have call predecessors, (23), 7 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2023-12-21 01:39:27,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:39:27,107 INFO L93 Difference]: Finished difference Result 133 states and 191 transitions. [2023-12-21 01:39:27,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-21 01:39:27,108 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 3 states have call successors, (23), 3 states have call predecessors, (23), 7 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 106 [2023-12-21 01:39:27,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:39:27,109 INFO L225 Difference]: With dead ends: 133 [2023-12-21 01:39:27,109 INFO L226 Difference]: Without dead ends: 82 [2023-12-21 01:39:27,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 236 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2023-12-21 01:39:27,110 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 118 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 01:39:27,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 148 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 01:39:27,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-12-21 01:39:27,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 73. [2023-12-21 01:39:27,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 43 states have internal predecessors, (49), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-21 01:39:27,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 103 transitions. [2023-12-21 01:39:27,122 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 103 transitions. Word has length 106 [2023-12-21 01:39:27,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:39:27,122 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 103 transitions. [2023-12-21 01:39:27,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 3 states have call successors, (23), 3 states have call predecessors, (23), 7 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2023-12-21 01:39:27,123 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 103 transitions. [2023-12-21 01:39:27,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-21 01:39:27,123 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:39:27,123 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:39:27,129 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-21 01:39:27,329 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-21 01:39:27,329 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:39:27,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:39:27,330 INFO L85 PathProgramCache]: Analyzing trace with hash -250295157, now seen corresponding path program 1 times [2023-12-21 01:39:27,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:39:27,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530472265] [2023-12-21 01:39:27,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:39:27,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:39:27,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:27,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:39:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:27,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 01:39:27,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:27,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-21 01:39:27,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:27,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-21 01:39:27,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:27,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-21 01:39:27,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:27,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:39:27,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:27,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:39:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:27,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-21 01:39:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:27,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-21 01:39:27,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:27,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-21 01:39:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:27,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-21 01:39:27,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:27,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:39:27,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:27,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:39:27,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:27,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-21 01:39:27,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:27,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-21 01:39:27,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:27,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-21 01:39:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:27,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-21 01:39:27,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:27,544 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 01:39:27,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:39:27,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530472265] [2023-12-21 01:39:27,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530472265] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:39:27,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:39:27,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 01:39:27,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813795797] [2023-12-21 01:39:27,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:39:27,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 01:39:27,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:39:27,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 01:39:27,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-21 01:39:27,547 INFO L87 Difference]: Start difference. First operand 73 states and 103 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 01:39:27,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:39:27,771 INFO L93 Difference]: Finished difference Result 177 states and 242 transitions. [2023-12-21 01:39:27,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 01:39:27,771 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 106 [2023-12-21 01:39:27,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:39:27,774 INFO L225 Difference]: With dead ends: 177 [2023-12-21 01:39:27,774 INFO L226 Difference]: Without dead ends: 120 [2023-12-21 01:39:27,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-12-21 01:39:27,775 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 126 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:39:27,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 365 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:39:27,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-12-21 01:39:27,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 116. [2023-12-21 01:39:27,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 65 states have (on average 1.123076923076923) internal successors, (73), 67 states have internal predecessors, (73), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2023-12-21 01:39:27,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 161 transitions. [2023-12-21 01:39:27,833 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 161 transitions. Word has length 106 [2023-12-21 01:39:27,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:39:27,833 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 161 transitions. [2023-12-21 01:39:27,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 01:39:27,834 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 161 transitions. [2023-12-21 01:39:27,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-21 01:39:27,834 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:39:27,834 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:39:27,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-21 01:39:27,835 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:39:27,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:39:27,835 INFO L85 PathProgramCache]: Analyzing trace with hash -2043237600, now seen corresponding path program 1 times [2023-12-21 01:39:27,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:39:27,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635827416] [2023-12-21 01:39:27,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:39:27,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:39:27,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 01:39:27,873 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 01:39:27,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 01:39:27,922 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-21 01:39:27,922 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 01:39:27,923 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 01:39:27,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-21 01:39:27,926 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-21 01:39:27,929 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 01:39:27,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 01:39:27 BoogieIcfgContainer [2023-12-21 01:39:27,972 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 01:39:27,973 INFO L158 Benchmark]: Toolchain (without parser) took 4359.72ms. Allocated memory was 280.0MB in the beginning and 336.6MB in the end (delta: 56.6MB). Free memory was 226.2MB in the beginning and 268.6MB in the end (delta: -42.4MB). Peak memory consumption was 15.1MB. Max. memory is 8.0GB. [2023-12-21 01:39:27,973 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 192.9MB. Free memory is still 142.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 01:39:27,974 INFO L158 Benchmark]: CACSL2BoogieTranslator took 176.94ms. Allocated memory is still 280.0MB. Free memory was 226.2MB in the beginning and 213.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-21 01:39:27,974 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.08ms. Allocated memory is still 280.0MB. Free memory was 213.5MB in the beginning and 211.1MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-21 01:39:27,974 INFO L158 Benchmark]: Boogie Preprocessor took 36.81ms. Allocated memory is still 280.0MB. Free memory was 211.1MB in the beginning and 208.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 01:39:27,974 INFO L158 Benchmark]: RCFGBuilder took 374.92ms. Allocated memory is still 280.0MB. Free memory was 208.4MB in the beginning and 191.1MB in the end (delta: 17.2MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-21 01:39:27,974 INFO L158 Benchmark]: TraceAbstraction took 3711.28ms. Allocated memory was 280.0MB in the beginning and 336.6MB in the end (delta: 56.6MB). Free memory was 190.4MB in the beginning and 268.6MB in the end (delta: -78.2MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 01:39:27,975 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.10ms. Allocated memory is still 192.9MB. Free memory is still 142.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 176.94ms. Allocated memory is still 280.0MB. Free memory was 226.2MB in the beginning and 213.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.08ms. Allocated memory is still 280.0MB. Free memory was 213.5MB in the beginning and 211.1MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.81ms. Allocated memory is still 280.0MB. Free memory was 211.1MB in the beginning and 208.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 374.92ms. Allocated memory is still 280.0MB. Free memory was 208.4MB in the beginning and 191.1MB in the end (delta: 17.2MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 3711.28ms. Allocated memory was 280.0MB in the beginning and 336.6MB in the end (delta: 56.6MB). Free memory was 190.4MB in the beginning and 268.6MB in the end (delta: -78.2MB). There was no memory consumed. 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 someBinaryFLOATComparisonOperation at line 100, overapproximation of bitwise operation at line 100. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed short int var_1_7 = 32; [L24] signed short int var_1_8 = 20113; [L25] signed short int var_1_9 = 100; [L26] signed char var_1_10 = 100; [L27] signed char var_1_11 = -1; [L28] signed char var_1_12 = 16; [L29] unsigned char var_1_13 = 1; [L30] unsigned char var_1_15 = 0; [L31] unsigned char var_1_16 = 1; [L32] unsigned short int var_1_18 = 10; [L33] unsigned short int var_1_19 = 256; [L34] float var_1_20 = 32.5; [L35] float var_1_21 = 127.4; [L36] signed short int var_1_22 = 128; [L104] isInitial = 1 [L105] FCALL initially() [L106] COND TRUE 1 [L107] FCALL updateLastVariables() [L108] CALL updateVariables() [L70] var_1_7 = __VERIFIER_nondet_short() [L71] CALL assume_abort_if_not(var_1_7 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=20113, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=20113, var_1_9=100] [L71] RET assume_abort_if_not(var_1_7 >= -1) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=20113, var_1_9=100] [L72] CALL assume_abort_if_not(var_1_7 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=20113, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=20113, var_1_9=100] [L72] RET assume_abort_if_not(var_1_7 <= 32766) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=20113, var_1_9=100] [L73] var_1_8 = __VERIFIER_nondet_short() [L74] CALL assume_abort_if_not(var_1_8 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=100] [L74] RET assume_abort_if_not(var_1_8 >= 16383) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=100] [L75] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=100] [L75] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=100] [L76] var_1_9 = __VERIFIER_nondet_short() [L77] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L77] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L78] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L78] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L79] var_1_11 = __VERIFIER_nondet_char() [L80] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=25, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=25, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L80] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, var_1_10=100, var_1_11=25, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L81] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=25, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=25, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L81] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, var_1_10=100, var_1_11=25, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L82] var_1_12 = __VERIFIER_nondet_char() [L83] CALL assume_abort_if_not(var_1_12 >= -31) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=25, var_1_12=-31, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=25, var_1_12=-31, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L83] RET assume_abort_if_not(var_1_12 >= -31) VAL [isInitial=1, var_1_10=100, var_1_11=25, var_1_12=-31, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L84] CALL assume_abort_if_not(var_1_12 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=25, var_1_12=-31, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=25, var_1_12=-31, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L84] RET assume_abort_if_not(var_1_12 <= 32) VAL [isInitial=1, var_1_10=100, var_1_11=25, var_1_12=-31, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L85] var_1_15 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=25, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=25, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L86] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=100, var_1_11=25, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L87] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=25, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=25, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L87] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=100, var_1_11=25, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L88] var_1_16 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=25, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=25, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L89] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_10=100, var_1_11=25, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L90] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=25, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=25, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L90] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_10=100, var_1_11=25, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L91] var_1_19 = __VERIFIER_nondet_ushort() [L92] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=25, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=25, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L92] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=100, var_1_11=25, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L93] CALL assume_abort_if_not(var_1_19 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=25, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=32765, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=25, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=32765, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L93] RET assume_abort_if_not(var_1_19 <= 65534) VAL [isInitial=1, var_1_10=100, var_1_11=25, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=32765, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L94] var_1_21 = __VERIFIER_nondet_float() [L95] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=25, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=32765, var_1_1=16, var_1_20=65/2, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=25, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=32765, var_1_1=16, var_1_20=65/2, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L95] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=100, var_1_11=25, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=32765, var_1_1=16, var_1_20=65/2, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L108] RET updateVariables() [L109] CALL step() [L40] var_1_18 = var_1_19 [L41] var_1_20 = var_1_21 [L42] var_1_22 = var_1_12 VAL [isInitial=1, var_1_10=100, var_1_11=25, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=32765, var_1_19=32765, var_1_1=16, var_1_20=32771, var_1_21=32771, var_1_22=-31, var_1_7=32765, var_1_8=32766, var_1_9=0] [L43] COND TRUE 127.5f > var_1_20 [L44] var_1_13 = (var_1_15 && var_1_16) VAL [isInitial=1, var_1_10=100, var_1_11=25, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=32765, var_1_19=32765, var_1_1=16, var_1_20=32771, var_1_21=32771, var_1_22=-31, var_1_7=32765, var_1_8=32766, var_1_9=0] [L48] COND TRUE var_1_18 == var_1_7 [L49] var_1_10 = (var_1_11 + (var_1_12 + -25)) VAL [isInitial=1, var_1_10=-31, var_1_11=25, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=32765, var_1_19=32765, var_1_1=16, var_1_20=32771, var_1_21=32771, var_1_22=-31, var_1_7=32765, var_1_8=32766, var_1_9=0] [L57] COND TRUE \read(var_1_13) VAL [isInitial=1, var_1_10=-31, var_1_11=25, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=32765, var_1_19=32765, var_1_1=16, var_1_20=32771, var_1_21=32771, var_1_22=-31, var_1_7=32765, var_1_8=32766, var_1_9=0] [L58] COND FALSE !(var_1_10 > var_1_22) [L65] var_1_1 = 8 VAL [isInitial=1, var_1_10=-31, var_1_11=25, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=32765, var_1_19=32765, var_1_1=8, var_1_20=32771, var_1_21=32771, var_1_22=-31, var_1_7=32765, var_1_8=32766, var_1_9=0] [L109] RET step() [L110] CALL, EXPR property() [L100] EXPR (var_1_13 ? ((var_1_10 > var_1_22) ? (var_1_13 ? (var_1_1 == ((signed short int) (var_1_7 - (var_1_8 - var_1_9)))) : (var_1_1 == ((signed short int) var_1_18))) : (var_1_1 == ((signed short int) 8))) : 1) && ((var_1_18 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : ((((32 * -25) | var_1_22) >= var_1_11) ? (var_1_13 ? (var_1_10 == ((signed char) var_1_12)) : 1) : 1)) VAL [isInitial=1, var_1_10=-31, var_1_11=25, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=32765, var_1_19=32765, var_1_1=8, var_1_20=32771, var_1_21=32771, var_1_22=-31, var_1_7=32765, var_1_8=32766, var_1_9=0] [L100] EXPR (var_1_18 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : ((((32 * -25) | var_1_22) >= var_1_11) ? (var_1_13 ? (var_1_10 == ((signed char) var_1_12)) : 1) : 1) VAL [isInitial=1, var_1_10=-31, var_1_11=25, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=32765, var_1_19=32765, var_1_1=8, var_1_20=32771, var_1_21=32771, var_1_22=-31, var_1_7=32765, var_1_8=32766, var_1_9=0] [L100] EXPR (var_1_13 ? ((var_1_10 > var_1_22) ? (var_1_13 ? (var_1_1 == ((signed short int) (var_1_7 - (var_1_8 - var_1_9)))) : (var_1_1 == ((signed short int) var_1_18))) : (var_1_1 == ((signed short int) 8))) : 1) && ((var_1_18 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : ((((32 * -25) | var_1_22) >= var_1_11) ? (var_1_13 ? (var_1_10 == ((signed char) var_1_12)) : 1) : 1)) VAL [isInitial=1, var_1_10=-31, var_1_11=25, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=32765, var_1_19=32765, var_1_1=8, var_1_20=32771, var_1_21=32771, var_1_22=-31, var_1_7=32765, var_1_8=32766, var_1_9=0] [L100-L101] return (((((var_1_13 ? ((var_1_10 > var_1_22) ? (var_1_13 ? (var_1_1 == ((signed short int) (var_1_7 - (var_1_8 - var_1_9)))) : (var_1_1 == ((signed short int) var_1_18))) : (var_1_1 == ((signed short int) 8))) : 1) && ((var_1_18 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : ((((32 * -25) | var_1_22) >= var_1_11) ? (var_1_13 ? (var_1_10 == ((signed char) var_1_12)) : 1) : 1))) && ((127.5f > var_1_20) ? (var_1_13 == ((unsigned char) (var_1_15 && var_1_16))) : (var_1_13 == ((unsigned char) ((var_1_20 >= var_1_20) || var_1_15))))) && (var_1_18 == ((unsigned short int) var_1_19))) && (var_1_20 == ((float) var_1_21))) && (var_1_22 == ((signed short int) var_1_12)) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=-31, var_1_11=25, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=32765, var_1_19=32765, var_1_1=8, var_1_20=32771, var_1_21=32771, var_1_22=-31, var_1_7=32765, var_1_8=32766, var_1_9=0] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=-31, var_1_11=25, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=32765, var_1_19=32765, var_1_1=8, var_1_20=32771, var_1_21=32771, var_1_22=-31, var_1_7=32765, var_1_8=32766, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 6, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 444 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 429 mSDsluCounter, 1419 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 929 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 559 IncrementalHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 490 mSDtfsCounter, 559 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 450 GetRequests, 400 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=5, InterpolantAutomatonStates: 43, 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, 131 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 738 NumberOfCodeBlocks, 738 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 730 ConstructedInterpolants, 0 QuantifiedInterpolants, 1924 SizeOfPredicates, 6 NumberOfNonLiveVariables, 255 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 3724/3808 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-21 01:39:27,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...