/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 true -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-19 14:56:15,898 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 14:56:15,974 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-19 14:56:15,977 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 14:56:15,978 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 14:56:16,019 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 14:56:16,019 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 14:56:16,020 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 14:56:16,020 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 14:56:16,021 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 14:56:16,021 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 14:56:16,022 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 14:56:16,022 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 14:56:16,022 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 14:56:16,023 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 14:56:16,023 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 14:56:16,023 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 14:56:16,024 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 14:56:16,024 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 14:56:16,024 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 14:56:16,025 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 14:56:16,044 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 14:56:16,045 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 14:56:16,045 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 14:56:16,045 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 14:56:16,045 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 14:56:16,045 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 14:56:16,045 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 14:56:16,046 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 14:56:16,046 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 14:56:16,046 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 14:56:16,046 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 14:56:16,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 14:56:16,047 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 14:56:16,047 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 14:56:16,047 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 14:56:16,047 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 14:56:16,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 14:56:16,047 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 14:56:16,048 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 14:56:16,048 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 14:56:16,048 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 14:56:16,048 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 14:56:16,048 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 -> true [2023-12-19 14:56:16,291 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 14:56:16,309 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 14:56:16,311 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 14:56:16,312 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 14:56:16,314 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 14:56:16,315 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-19 14:56:17,491 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 14:56:17,638 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 14:56:17,639 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_normal_file-97.i [2023-12-19 14:56:17,644 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ad62cbcb/7e369f64dbf048d0ad6b6a4afd919397/FLAG85b3ab180 [2023-12-19 14:56:17,662 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ad62cbcb/7e369f64dbf048d0ad6b6a4afd919397 [2023-12-19 14:56:17,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 14:56:17,665 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 14:56:17,667 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 14:56:17,667 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 14:56:17,673 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 14:56:17,674 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 02:56:17" (1/1) ... [2023-12-19 14:56:17,674 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@439cec1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:56:17, skipping insertion in model container [2023-12-19 14:56:17,674 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 02:56:17" (1/1) ... [2023-12-19 14:56:17,695 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 14:56:17,804 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-19 14:56:17,849 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 14:56:17,857 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 14:56:17,865 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-19 14:56:17,882 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 14:56:17,893 INFO L206 MainTranslator]: Completed translation [2023-12-19 14:56:17,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:56:17 WrapperNode [2023-12-19 14:56:17,893 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 14:56:17,894 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 14:56:17,894 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 14:56:17,894 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 14:56:17,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:56:17" (1/1) ... [2023-12-19 14:56:17,912 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:56:17" (1/1) ... [2023-12-19 14:56:17,941 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 147 [2023-12-19 14:56:17,941 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 14:56:17,942 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 14:56:17,942 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 14:56:17,942 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 14:56:17,951 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:56:17" (1/1) ... [2023-12-19 14:56:17,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:56:17" (1/1) ... [2023-12-19 14:56:17,953 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:56:17" (1/1) ... [2023-12-19 14:56:17,971 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-19 14:56:17,971 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:56:17" (1/1) ... [2023-12-19 14:56:17,971 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:56:17" (1/1) ... [2023-12-19 14:56:17,976 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:56:17" (1/1) ... [2023-12-19 14:56:17,978 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:56:17" (1/1) ... [2023-12-19 14:56:17,979 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:56:17" (1/1) ... [2023-12-19 14:56:17,980 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:56:17" (1/1) ... [2023-12-19 14:56:17,981 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 14:56:17,982 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 14:56:17,982 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 14:56:17,982 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 14:56:17,983 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:56:17" (1/1) ... [2023-12-19 14:56:17,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 14:56:17,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 14:56:18,033 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-19 14:56:18,090 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-19 14:56:18,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 14:56:18,091 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 14:56:18,092 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 14:56:18,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 14:56:18,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 14:56:18,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 14:56:18,176 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 14:56:18,182 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 14:56:18,398 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 14:56:18,520 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 14:56:18,521 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 14:56:18,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 02:56:18 BoogieIcfgContainer [2023-12-19 14:56:18,521 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 14:56:18,523 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 14:56:18,523 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 14:56:18,526 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 14:56:18,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 02:56:17" (1/3) ... [2023-12-19 14:56:18,526 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44cec13a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 02:56:18, skipping insertion in model container [2023-12-19 14:56:18,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:56:17" (2/3) ... [2023-12-19 14:56:18,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44cec13a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 02:56:18, skipping insertion in model container [2023-12-19 14:56:18,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 02:56:18" (3/3) ... [2023-12-19 14:56:18,527 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-97.i [2023-12-19 14:56:18,543 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 14:56:18,544 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 14:56:18,602 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 14:56:18,608 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;@3cf95c61, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 14:56:18,608 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 14:56:18,616 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 36 states have internal predecessors, (53), 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-19 14:56:18,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-19 14:56:18,645 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:56:18,646 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-19 14:56:18,646 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:56:18,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:56:18,651 INFO L85 PathProgramCache]: Analyzing trace with hash 139205515, now seen corresponding path program 1 times [2023-12-19 14:56:18,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:56:18,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082514205] [2023-12-19 14:56:18,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:56:18,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:56:18,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:18,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:56:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:18,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 14:56:18,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:18,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 14:56:18,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:18,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 14:56:18,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:18,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 14:56:18,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:18,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:56:18,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:18,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 14:56:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:18,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 14:56:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:18,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 14:56:18,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:18,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 14:56:18,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:18,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 14:56:18,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:18,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:56:18,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:18,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 14:56:18,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:18,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 14:56:18,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:18,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 14:56:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:18,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-19 14:56:18,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:18,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-19 14:56:18,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:18,981 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-19 14:56:18,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:56:18,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082514205] [2023-12-19 14:56:18,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082514205] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:56:18,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:56:18,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 14:56:18,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671536030] [2023-12-19 14:56:18,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:56:18,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 14:56:18,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:56:19,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 14:56:19,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 14:56:19,033 INFO L87 Difference]: Start difference. First operand has 55 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 36 states have internal predecessors, (53), 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-19 14:56:19,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:56:19,099 INFO L93 Difference]: Finished difference Result 107 states and 189 transitions. [2023-12-19 14:56:19,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 14:56:19,102 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-19 14:56:19,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:56:19,107 INFO L225 Difference]: With dead ends: 107 [2023-12-19 14:56:19,107 INFO L226 Difference]: Without dead ends: 53 [2023-12-19 14:56:19,125 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-19 14:56:19,129 INFO L413 NwaCegarLoop]: 79 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, 79 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-19 14:56:19,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 14:56:19,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-12-19 14:56:19,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-12-19 14:56:19,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 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-19 14:56:19,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 82 transitions. [2023-12-19 14:56:19,169 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 82 transitions. Word has length 104 [2023-12-19 14:56:19,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:56:19,169 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 82 transitions. [2023-12-19 14:56:19,169 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-19 14:56:19,170 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 82 transitions. [2023-12-19 14:56:19,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-19 14:56:19,171 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:56:19,172 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-19 14:56:19,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 14:56:19,172 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:56:19,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:56:19,173 INFO L85 PathProgramCache]: Analyzing trace with hash 853837385, now seen corresponding path program 1 times [2023-12-19 14:56:19,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:56:19,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642725129] [2023-12-19 14:56:19,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:56:19,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:56:19,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:19,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:56:19,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:19,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 14:56:19,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:19,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 14:56:19,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:19,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 14:56:19,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:19,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 14:56:19,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:19,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:56:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:19,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 14:56:19,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:19,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 14:56:19,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:19,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 14:56:19,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:19,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 14:56:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:19,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 14:56:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:19,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:56:19,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:19,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 14:56:19,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:19,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 14:56:19,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:19,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 14:56:19,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:19,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-19 14:56:19,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:19,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-19 14:56:19,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:19,747 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-19 14:56:19,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:56:19,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642725129] [2023-12-19 14:56:19,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642725129] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:56:19,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:56:19,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 14:56:19,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368190409] [2023-12-19 14:56:19,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:56:19,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 14:56:19,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:56:19,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 14:56:19,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 14:56:19,750 INFO L87 Difference]: Start difference. First operand 53 states and 82 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-19 14:56:19,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:56:19,888 INFO L93 Difference]: Finished difference Result 150 states and 230 transitions. [2023-12-19 14:56:19,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 14:56:19,889 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-19 14:56:19,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:56:19,894 INFO L225 Difference]: With dead ends: 150 [2023-12-19 14:56:19,894 INFO L226 Difference]: Without dead ends: 98 [2023-12-19 14:56:19,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-19 14:56:19,897 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 77 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 439 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.1s IncrementalHoareTripleChecker+Time [2023-12-19 14:56:19,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 439 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 14:56:19,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-19 14:56:19,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 56. [2023-12-19 14:56:19,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 37 states have internal predecessors, (51), 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-19 14:56:19,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 85 transitions. [2023-12-19 14:56:19,912 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 85 transitions. Word has length 104 [2023-12-19 14:56:19,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:56:19,914 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 85 transitions. [2023-12-19 14:56:19,914 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-19 14:56:19,914 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 85 transitions. [2023-12-19 14:56:19,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-19 14:56:19,915 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:56:19,915 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-19 14:56:19,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 14:56:19,916 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:56:19,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:56:19,916 INFO L85 PathProgramCache]: Analyzing trace with hash 991670493, now seen corresponding path program 1 times [2023-12-19 14:56:19,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:56:19,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393906068] [2023-12-19 14:56:19,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:56:19,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:56:19,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:20,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:56:20,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:20,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 14:56:20,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:20,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 14:56:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:20,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 14:56:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:20,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 14:56:20,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:20,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:56:20,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:20,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 14:56:20,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:20,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 14:56:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:20,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 14:56:20,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:20,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 14:56:20,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:20,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 14:56:20,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:20,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:56:20,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:20,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 14:56:20,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:20,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 14:56:20,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:20,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 14:56:20,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:20,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-19 14:56:20,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:20,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-19 14:56:20,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:20,274 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-19 14:56:20,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:56:20,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393906068] [2023-12-19 14:56:20,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393906068] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:56:20,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:56:20,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 14:56:20,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351615281] [2023-12-19 14:56:20,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:56:20,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 14:56:20,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:56:20,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 14:56:20,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-19 14:56:20,281 INFO L87 Difference]: Start difference. First operand 56 states and 85 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-19 14:56:20,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:56:20,522 INFO L93 Difference]: Finished difference Result 197 states and 296 transitions. [2023-12-19 14:56:20,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 14:56:20,523 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-19 14:56:20,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:56:20,524 INFO L225 Difference]: With dead ends: 197 [2023-12-19 14:56:20,524 INFO L226 Difference]: Without dead ends: 142 [2023-12-19 14:56:20,525 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-19 14:56:20,526 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 133 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 14:56:20,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 472 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 14:56:20,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-12-19 14:56:20,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 57. [2023-12-19 14:56:20,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 38 states have internal predecessors, (51), 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-19 14:56:20,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 85 transitions. [2023-12-19 14:56:20,533 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 85 transitions. Word has length 105 [2023-12-19 14:56:20,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:56:20,533 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 85 transitions. [2023-12-19 14:56:20,534 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-19 14:56:20,534 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 85 transitions. [2023-12-19 14:56:20,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-19 14:56:20,535 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:56:20,535 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-19 14:56:20,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 14:56:20,535 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:56:20,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:56:20,536 INFO L85 PathProgramCache]: Analyzing trace with hash -483714034, now seen corresponding path program 1 times [2023-12-19 14:56:20,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:56:20,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405418859] [2023-12-19 14:56:20,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:56:20,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:56:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:20,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:56:20,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:20,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 14:56:20,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:20,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 14:56:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:20,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 14:56:20,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:20,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 14:56:20,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:20,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:56:20,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:20,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 14:56:20,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:20,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 14:56:20,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:20,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 14:56:20,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:20,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 14:56:20,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:20,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 14:56:20,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:20,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:56:20,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:20,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 14:56:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:20,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 14:56:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:20,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 14:56:20,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:20,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-19 14:56:20,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:20,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-19 14:56:20,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:20,931 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-19 14:56:20,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:56:20,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405418859] [2023-12-19 14:56:20,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405418859] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 14:56:20,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259848729] [2023-12-19 14:56:20,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:56:20,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 14:56:20,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 14:56:20,954 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-19 14:56:20,998 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-19 14:56:21,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:21,091 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-19 14:56:21,102 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 14:56:21,343 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-19 14:56:21,343 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 14:56:21,600 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-19 14:56:21,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259848729] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 14:56:21,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 14:56:21,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2023-12-19 14:56:21,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225259041] [2023-12-19 14:56:21,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 14:56:21,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-19 14:56:21,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:56:21,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-19 14:56:21,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-12-19 14:56:21,606 INFO L87 Difference]: Start difference. First operand 57 states and 85 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-19 14:56:21,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:56:21,969 INFO L93 Difference]: Finished difference Result 143 states and 209 transitions. [2023-12-19 14:56:21,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-19 14:56:21,970 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-19 14:56:21,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:56:21,971 INFO L225 Difference]: With dead ends: 143 [2023-12-19 14:56:21,971 INFO L226 Difference]: Without dead ends: 87 [2023-12-19 14:56:21,972 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-19 14:56:21,972 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 81 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 14:56:21,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 158 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 14:56:21,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-12-19 14:56:22,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 78. [2023-12-19 14:56:22,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 48 states have internal predecessors, (58), 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-19 14:56:22,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 112 transitions. [2023-12-19 14:56:22,017 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 112 transitions. Word has length 106 [2023-12-19 14:56:22,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:56:22,017 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 112 transitions. [2023-12-19 14:56:22,018 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-19 14:56:22,018 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 112 transitions. [2023-12-19 14:56:22,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-19 14:56:22,019 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:56:22,019 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-19 14:56:22,039 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-19 14:56:22,220 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-19 14:56:22,221 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:56:22,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:56:22,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1856438580, now seen corresponding path program 1 times [2023-12-19 14:56:22,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:56:22,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917513294] [2023-12-19 14:56:22,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:56:22,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:56:22,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:22,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:56:22,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:22,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 14:56:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:22,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 14:56:22,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:22,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 14:56:22,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:22,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 14:56:22,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:22,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:56:22,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:22,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 14:56:22,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:22,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 14:56:22,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:22,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 14:56:22,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:22,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 14:56:22,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:22,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 14:56:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:22,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:56:22,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:22,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 14:56:22,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:22,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 14:56:22,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:22,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 14:56:22,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:22,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-19 14:56:22,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:22,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-19 14:56:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:56:22,450 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-19 14:56:22,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:56:22,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917513294] [2023-12-19 14:56:22,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917513294] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:56:22,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:56:22,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 14:56:22,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085356603] [2023-12-19 14:56:22,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:56:22,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 14:56:22,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:56:22,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 14:56:22,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-19 14:56:22,453 INFO L87 Difference]: Start difference. First operand 78 states and 112 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-19 14:56:22,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:56:22,720 INFO L93 Difference]: Finished difference Result 190 states and 265 transitions. [2023-12-19 14:56:22,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-19 14:56:22,721 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-19 14:56:22,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:56:22,723 INFO L225 Difference]: With dead ends: 190 [2023-12-19 14:56:22,723 INFO L226 Difference]: Without dead ends: 128 [2023-12-19 14:56:22,724 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-19 14:56:22,726 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 146 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 14:56:22,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 392 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 14:56:22,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-12-19 14:56:22,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 124. [2023-12-19 14:56:22,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 73 states have (on average 1.1917808219178083) internal successors, (87), 75 states have internal predecessors, (87), 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-19 14:56:22,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 175 transitions. [2023-12-19 14:56:22,762 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 175 transitions. Word has length 106 [2023-12-19 14:56:22,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:56:22,763 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 175 transitions. [2023-12-19 14:56:22,763 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-19 14:56:22,763 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 175 transitions. [2023-12-19 14:56:22,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-19 14:56:22,765 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:56:22,765 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-19 14:56:22,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-19 14:56:22,765 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:56:22,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:56:22,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1170083422, now seen corresponding path program 1 times [2023-12-19 14:56:22,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:56:22,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425002353] [2023-12-19 14:56:22,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:56:22,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:56:22,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 14:56:22,817 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 14:56:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 14:56:22,894 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 14:56:22,895 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 14:56:22,895 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 14:56:22,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 14:56:22,925 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-19 14:56:22,928 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 14:56:23,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 02:56:23 BoogieIcfgContainer [2023-12-19 14:56:23,046 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 14:56:23,046 INFO L158 Benchmark]: Toolchain (without parser) took 5381.05ms. Allocated memory was 191.9MB in the beginning and 493.9MB in the end (delta: 302.0MB). Free memory was 128.4MB in the beginning and 451.7MB in the end (delta: -323.3MB). Peak memory consumption was 126.0MB. Max. memory is 8.0GB. [2023-12-19 14:56:23,046 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 191.9MB. Free memory was 141.5MB in the beginning and 141.4MB in the end (delta: 133.0kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 14:56:23,047 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.59ms. Allocated memory is still 191.9MB. Free memory was 128.1MB in the beginning and 115.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-19 14:56:23,047 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.25ms. Allocated memory is still 191.9MB. Free memory was 115.6MB in the beginning and 113.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-19 14:56:23,047 INFO L158 Benchmark]: Boogie Preprocessor took 39.92ms. Allocated memory is still 191.9MB. Free memory was 113.2MB in the beginning and 110.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-19 14:56:23,048 INFO L158 Benchmark]: RCFGBuilder took 539.06ms. Allocated memory was 191.9MB in the beginning and 383.8MB in the end (delta: 191.9MB). Free memory was 110.6MB in the beginning and 346.7MB in the end (delta: -236.1MB). Peak memory consumption was 12.7MB. Max. memory is 8.0GB. [2023-12-19 14:56:23,048 INFO L158 Benchmark]: TraceAbstraction took 4523.00ms. Allocated memory was 383.8MB in the beginning and 493.9MB in the end (delta: 110.1MB). Free memory was 345.8MB in the beginning and 451.7MB in the end (delta: -105.9MB). Peak memory consumption was 149.9MB. Max. memory is 8.0GB. [2023-12-19 14:56:23,049 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.11ms. Allocated memory is still 191.9MB. Free memory was 141.5MB in the beginning and 141.4MB in the end (delta: 133.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 226.59ms. Allocated memory is still 191.9MB. Free memory was 128.1MB in the beginning and 115.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.25ms. Allocated memory is still 191.9MB. Free memory was 115.6MB in the beginning and 113.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.92ms. Allocated memory is still 191.9MB. Free memory was 113.2MB in the beginning and 110.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 539.06ms. Allocated memory was 191.9MB in the beginning and 383.8MB in the end (delta: 191.9MB). Free memory was 110.6MB in the beginning and 346.7MB in the end (delta: -236.1MB). Peak memory consumption was 12.7MB. Max. memory is 8.0GB. * TraceAbstraction took 4523.00ms. Allocated memory was 383.8MB in the beginning and 493.9MB in the end (delta: 110.1MB). Free memory was 345.8MB in the beginning and 451.7MB in the end (delta: -105.9MB). Peak memory consumption was 149.9MB. 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. 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, var_1_8=16383, 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=0, var_1_8=16383, 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=0, var_1_8=16383, 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=0, var_1_8=16383, 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=0, var_1_8=16383, 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=0, var_1_8=16383, 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=0, var_1_8=16383, var_1_9=16382] [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=0, var_1_8=16383, var_1_9=16382] [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=0, var_1_8=16383, var_1_9=16382] [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=0, var_1_8=16383, var_1_9=16382] [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=0, var_1_8=16383, var_1_9=16382] [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=0, var_1_8=16383, var_1_9=16382] [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=-63, 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=0, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-63, 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=0, var_1_8=16383, var_1_9=16382] [L80] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, var_1_10=100, var_1_11=-63, 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=0, var_1_8=16383, var_1_9=16382] [L81] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-63, 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=0, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-63, 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=0, var_1_8=16383, var_1_9=16382] [L81] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, var_1_10=100, var_1_11=-63, 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=0, var_1_8=16383, var_1_9=16382] [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=-63, 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=0, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-63, 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=0, var_1_8=16383, var_1_9=16382] [L83] RET assume_abort_if_not(var_1_12 >= -31) VAL [isInitial=1, var_1_10=100, var_1_11=-63, 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=0, var_1_8=16383, var_1_9=16382] [L84] CALL assume_abort_if_not(var_1_12 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-63, 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=0, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-63, 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=0, var_1_8=16383, var_1_9=16382] [L84] RET assume_abort_if_not(var_1_12 <= 32) VAL [isInitial=1, var_1_10=100, var_1_11=-63, 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=0, var_1_8=16383, var_1_9=16382] [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=-63, 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=0, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-63, 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=0, var_1_8=16383, var_1_9=16382] [L86] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=100, var_1_11=-63, 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=0, var_1_8=16383, var_1_9=16382] [L87] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-63, 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=0, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-63, 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=0, var_1_8=16383, var_1_9=16382] [L87] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=100, var_1_11=-63, 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=0, var_1_8=16383, var_1_9=16382] [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=-63, 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=0, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-63, 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=0, var_1_8=16383, var_1_9=16382] [L89] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_10=100, var_1_11=-63, 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=0, var_1_8=16383, var_1_9=16382] [L90] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-63, 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=0, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-63, 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=0, var_1_8=16383, var_1_9=16382] [L90] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_10=100, var_1_11=-63, 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=0, var_1_8=16383, var_1_9=16382] [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=-63, 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=0, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-63, 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=0, var_1_8=16383, var_1_9=16382] [L92] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=100, var_1_11=-63, 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=0, var_1_8=16383, var_1_9=16382] [L93] CALL assume_abort_if_not(var_1_19 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=0, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=0, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L93] RET assume_abort_if_not(var_1_19 <= 65534) VAL [isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=0, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [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=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=0, var_1_1=16, var_1_20=65/2, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=0, var_1_1=16, var_1_20=65/2, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [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=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=0, var_1_1=16, var_1_20=65/2, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [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=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=20118, var_1_21=20118, var_1_22=-31, var_1_7=0, var_1_8=16383, var_1_9=16382] [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=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=20118, var_1_21=20118, var_1_22=-31, var_1_7=0, var_1_8=16383, var_1_9=16382] [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=-119, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=20118, var_1_21=20118, var_1_22=-31, var_1_7=0, var_1_8=16383, var_1_9=16382] [L57] COND TRUE \read(var_1_13) VAL [isInitial=1, var_1_10=-119, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=20118, var_1_21=20118, var_1_22=-31, var_1_7=0, var_1_8=16383, var_1_9=16382] [L58] COND FALSE !(var_1_10 > var_1_22) [L65] var_1_1 = 8 VAL [isInitial=1, var_1_10=-119, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=8, var_1_20=20118, var_1_21=20118, var_1_22=-31, var_1_7=0, var_1_8=16383, var_1_9=16382] [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=-119, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=8, var_1_20=20118, var_1_21=20118, var_1_22=-31, var_1_7=0, var_1_8=16383, var_1_9=16382] [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=-119, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=8, var_1_20=20118, var_1_21=20118, var_1_22=-31, var_1_7=0, var_1_8=16383, var_1_9=16382] [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=-119, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=8, var_1_20=20118, var_1_21=20118, var_1_22=-31, var_1_7=0, var_1_8=16383, var_1_9=16382] [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=-119, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=8, var_1_20=20118, var_1_21=20118, var_1_22=-31, var_1_7=0, var_1_8=16383, var_1_9=16382] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=-119, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=8, var_1_20=20118, var_1_21=20118, var_1_22=-31, var_1_7=0, var_1_8=16383, var_1_9=16382] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 6, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 452 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 437 mSDsluCounter, 1540 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1004 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 571 IncrementalHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 536 mSDtfsCounter, 571 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.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred 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, 140 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s 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-19 14:56:23,066 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...