/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-50.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 21:01:17,957 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 21:01:18,004 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-20 21:01:18,007 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 21:01:18,007 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 21:01:18,022 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 21:01:18,022 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 21:01:18,023 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 21:01:18,023 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 21:01:18,023 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 21:01:18,024 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 21:01:18,024 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 21:01:18,024 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 21:01:18,024 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 21:01:18,025 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 21:01:18,025 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 21:01:18,025 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 21:01:18,025 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 21:01:18,025 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 21:01:18,026 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 21:01:18,026 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 21:01:18,029 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 21:01:18,029 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 21:01:18,029 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 21:01:18,030 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 21:01:18,030 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 21:01:18,030 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 21:01:18,030 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 21:01:18,030 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 21:01:18,030 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 21:01:18,031 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 21:01:18,031 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 21:01:18,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 21:01:18,031 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 21:01:18,031 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 21:01:18,032 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 21:01:18,032 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 21:01:18,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 21:01:18,032 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 21:01:18,032 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 21:01:18,032 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 21:01:18,033 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 21:01:18,033 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 21:01:18,033 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-20 21:01:18,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 21:01:18,254 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 21:01:18,256 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 21:01:18,257 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 21:01:18,258 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 21:01:18,258 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-50.i [2023-12-20 21:01:19,270 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 21:01:19,455 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 21:01:19,455 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-50.i [2023-12-20 21:01:19,471 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f112c8d21/320b5e54a51d4aa7b7411fe83f2b6c06/FLAGcb6e0ac67 [2023-12-20 21:01:19,480 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f112c8d21/320b5e54a51d4aa7b7411fe83f2b6c06 [2023-12-20 21:01:19,482 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 21:01:19,483 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 21:01:19,484 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 21:01:19,484 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 21:01:19,487 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 21:01:19,488 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 09:01:19" (1/1) ... [2023-12-20 21:01:19,489 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1078c9e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:01:19, skipping insertion in model container [2023-12-20 21:01:19,489 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 09:01:19" (1/1) ... [2023-12-20 21:01:19,529 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 21:01:19,651 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_fillercode_fillercodestructure_filler-pr-ci_file-50.i[919,932] [2023-12-20 21:01:19,702 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 21:01:19,710 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 21:01:19,717 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_fillercode_fillercodestructure_filler-pr-ci_file-50.i[919,932] [2023-12-20 21:01:19,739 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 21:01:19,750 INFO L206 MainTranslator]: Completed translation [2023-12-20 21:01:19,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:01:19 WrapperNode [2023-12-20 21:01:19,751 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 21:01:19,752 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 21:01:19,752 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 21:01:19,752 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 21:01:19,756 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:01:19" (1/1) ... [2023-12-20 21:01:19,764 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:01:19" (1/1) ... [2023-12-20 21:01:19,801 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 195 [2023-12-20 21:01:19,802 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 21:01:19,802 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 21:01:19,802 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 21:01:19,802 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 21:01:19,810 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:01:19" (1/1) ... [2023-12-20 21:01:19,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:01:19" (1/1) ... [2023-12-20 21:01:19,813 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:01:19" (1/1) ... [2023-12-20 21:01:19,832 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-20 21:01:19,832 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:01:19" (1/1) ... [2023-12-20 21:01:19,832 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:01:19" (1/1) ... [2023-12-20 21:01:19,841 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:01:19" (1/1) ... [2023-12-20 21:01:19,847 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:01:19" (1/1) ... [2023-12-20 21:01:19,850 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:01:19" (1/1) ... [2023-12-20 21:01:19,852 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:01:19" (1/1) ... [2023-12-20 21:01:19,856 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 21:01:19,857 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 21:01:19,857 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 21:01:19,857 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 21:01:19,857 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:01:19" (1/1) ... [2023-12-20 21:01:19,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 21:01:19,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 21:01:19,891 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-20 21:01:19,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-20 21:01:19,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 21:01:19,919 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-20 21:01:19,919 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-20 21:01:19,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 21:01:19,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 21:01:19,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 21:01:19,979 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 21:01:19,981 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 21:01:20,251 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 21:01:20,277 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 21:01:20,277 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-20 21:01:20,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 09:01:20 BoogieIcfgContainer [2023-12-20 21:01:20,278 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 21:01:20,279 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 21:01:20,279 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 21:01:20,281 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 21:01:20,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 09:01:19" (1/3) ... [2023-12-20 21:01:20,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e544660 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 09:01:20, skipping insertion in model container [2023-12-20 21:01:20,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:01:19" (2/3) ... [2023-12-20 21:01:20,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e544660 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 09:01:20, skipping insertion in model container [2023-12-20 21:01:20,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 09:01:20" (3/3) ... [2023-12-20 21:01:20,283 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-50.i [2023-12-20 21:01:20,294 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 21:01:20,295 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-20 21:01:20,327 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 21:01:20,331 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;@7c22206c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 21:01:20,331 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-20 21:01:20,334 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 49 states have internal predecessors, (70), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-20 21:01:20,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-12-20 21:01:20,348 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 21:01:20,349 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 21:01:20,349 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 21:01:20,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 21:01:20,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1380049617, now seen corresponding path program 1 times [2023-12-20 21:01:20,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 21:01:20,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616312251] [2023-12-20 21:01:20,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:01:20,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 21:01:20,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:20,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 21:01:20,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:20,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 21:01:20,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:20,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 21:01:20,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:20,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 21:01:20,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:20,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 21:01:20,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:20,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 21:01:20,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:20,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 21:01:20,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:20,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 21:01:20,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:20,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-20 21:01:20,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:20,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-20 21:01:20,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:20,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 21:01:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:20,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 21:01:20,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:20,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 21:01:20,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:20,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-20 21:01:20,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:20,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-20 21:01:20,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:20,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-20 21:01:20,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:20,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 21:01:20,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:20,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-20 21:01:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:20,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-20 21:01:20,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:20,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 21:01:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:20,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 21:01:20,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:20,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-20 21:01:20,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:20,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-20 21:01:20,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:20,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-20 21:01:20,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:20,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-20 21:01:20,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 21:01:20,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616312251] [2023-12-20 21:01:20,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616312251] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 21:01:20,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 21:01:20,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-20 21:01:20,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551644395] [2023-12-20 21:01:20,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 21:01:20,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-20 21:01:20,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 21:01:20,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-20 21:01:20,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-20 21:01:20,763 INFO L87 Difference]: Start difference. First operand has 75 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 49 states have internal predecessors, (70), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2023-12-20 21:01:20,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 21:01:20,799 INFO L93 Difference]: Finished difference Result 147 states and 258 transitions. [2023-12-20 21:01:20,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-20 21:01:20,802 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 158 [2023-12-20 21:01:20,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 21:01:20,810 INFO L225 Difference]: With dead ends: 147 [2023-12-20 21:01:20,810 INFO L226 Difference]: Without dead ends: 73 [2023-12-20 21:01:20,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-20 21:01:20,816 INFO L413 NwaCegarLoop]: 110 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, 110 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-20 21:01:20,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 21:01:20,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-12-20 21:01:20,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-12-20 21:01:20,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 47 states have internal predecessors, (65), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-20 21:01:20,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 113 transitions. [2023-12-20 21:01:20,859 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 113 transitions. Word has length 158 [2023-12-20 21:01:20,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 21:01:20,859 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 113 transitions. [2023-12-20 21:01:20,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2023-12-20 21:01:20,859 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 113 transitions. [2023-12-20 21:01:20,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-12-20 21:01:20,863 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 21:01:20,863 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 21:01:20,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 21:01:20,863 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 21:01:20,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 21:01:20,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1902103821, now seen corresponding path program 1 times [2023-12-20 21:01:20,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 21:01:20,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832393395] [2023-12-20 21:01:20,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:01:20,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 21:01:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 21:01:21,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 21:01:21,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 21:01:21,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 21:01:21,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 21:01:21,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 21:01:21,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 21:01:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 21:01:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-20 21:01:21,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-20 21:01:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 21:01:21,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 21:01:21,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 21:01:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-20 21:01:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-20 21:01:21,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-20 21:01:21,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 21:01:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-20 21:01:21,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-20 21:01:21,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 21:01:21,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 21:01:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-20 21:01:21,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-20 21:01:21,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-20 21:01:21,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-20 21:01:21,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 21:01:21,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832393395] [2023-12-20 21:01:21,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832393395] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 21:01:21,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 21:01:21,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 21:01:21,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183293754] [2023-12-20 21:01:21,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 21:01:21,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 21:01:21,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 21:01:21,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 21:01:21,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 21:01:21,089 INFO L87 Difference]: Start difference. First operand 73 states and 113 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-20 21:01:21,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 21:01:21,158 INFO L93 Difference]: Finished difference Result 180 states and 277 transitions. [2023-12-20 21:01:21,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 21:01:21,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 158 [2023-12-20 21:01:21,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 21:01:21,162 INFO L225 Difference]: With dead ends: 180 [2023-12-20 21:01:21,162 INFO L226 Difference]: Without dead ends: 108 [2023-12-20 21:01:21,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 21:01:21,164 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 38 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 21:01:21,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 201 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 21:01:21,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-12-20 21:01:21,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 105. [2023-12-20 21:01:21,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 77 states have internal predecessors, (109), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-20 21:01:21,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 161 transitions. [2023-12-20 21:01:21,184 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 161 transitions. Word has length 158 [2023-12-20 21:01:21,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 21:01:21,185 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 161 transitions. [2023-12-20 21:01:21,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-20 21:01:21,185 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 161 transitions. [2023-12-20 21:01:21,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-12-20 21:01:21,194 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 21:01:21,194 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 21:01:21,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-20 21:01:21,194 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 21:01:21,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 21:01:21,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1222045451, now seen corresponding path program 1 times [2023-12-20 21:01:21,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 21:01:21,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162176509] [2023-12-20 21:01:21,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:01:21,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 21:01:21,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 21:01:21,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 21:01:21,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 21:01:21,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 21:01:21,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 21:01:21,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 21:01:21,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 21:01:21,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 21:01:21,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-20 21:01:21,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-20 21:01:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 21:01:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 21:01:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 21:01:21,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-20 21:01:21,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-20 21:01:21,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-20 21:01:21,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 21:01:21,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-20 21:01:21,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-20 21:01:21,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 21:01:21,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 21:01:21,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-20 21:01:21,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-20 21:01:21,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-20 21:01:21,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-20 21:01:21,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 21:01:21,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162176509] [2023-12-20 21:01:21,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162176509] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 21:01:21,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 21:01:21,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 21:01:21,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77424760] [2023-12-20 21:01:21,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 21:01:21,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 21:01:21,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 21:01:21,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 21:01:21,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 21:01:21,390 INFO L87 Difference]: Start difference. First operand 105 states and 161 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-20 21:01:21,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 21:01:21,418 INFO L93 Difference]: Finished difference Result 211 states and 325 transitions. [2023-12-20 21:01:21,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 21:01:21,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 158 [2023-12-20 21:01:21,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 21:01:21,421 INFO L225 Difference]: With dead ends: 211 [2023-12-20 21:01:21,421 INFO L226 Difference]: Without dead ends: 107 [2023-12-20 21:01:21,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 21:01:21,422 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 21:01:21,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 213 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 21:01:21,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-12-20 21:01:21,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-12-20 21:01:21,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 78 states have (on average 1.4230769230769231) internal successors, (111), 79 states have internal predecessors, (111), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-20 21:01:21,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 163 transitions. [2023-12-20 21:01:21,436 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 163 transitions. Word has length 158 [2023-12-20 21:01:21,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 21:01:21,437 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 163 transitions. [2023-12-20 21:01:21,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-20 21:01:21,438 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 163 transitions. [2023-12-20 21:01:21,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-12-20 21:01:21,439 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 21:01:21,439 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 21:01:21,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-20 21:01:21,440 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 21:01:21,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 21:01:21,440 INFO L85 PathProgramCache]: Analyzing trace with hash 552961911, now seen corresponding path program 1 times [2023-12-20 21:01:21,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 21:01:21,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523467715] [2023-12-20 21:01:21,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:01:21,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 21:01:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 21:01:21,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 21:01:21,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 21:01:21,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 21:01:21,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 21:01:21,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 21:01:21,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 21:01:21,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 21:01:21,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-20 21:01:21,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-20 21:01:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 21:01:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 21:01:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 21:01:21,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-20 21:01:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-20 21:01:21,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-20 21:01:21,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 21:01:21,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-20 21:01:21,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-20 21:01:21,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 21:01:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 21:01:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-20 21:01:21,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-20 21:01:21,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-20 21:01:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-20 21:01:21,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 21:01:21,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523467715] [2023-12-20 21:01:21,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523467715] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 21:01:21,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 21:01:21,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 21:01:21,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715249027] [2023-12-20 21:01:21,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 21:01:21,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 21:01:21,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 21:01:21,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 21:01:21,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 21:01:21,611 INFO L87 Difference]: Start difference. First operand 107 states and 163 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-20 21:01:21,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 21:01:21,678 INFO L93 Difference]: Finished difference Result 215 states and 325 transitions. [2023-12-20 21:01:21,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 21:01:21,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 158 [2023-12-20 21:01:21,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 21:01:21,682 INFO L225 Difference]: With dead ends: 215 [2023-12-20 21:01:21,682 INFO L226 Difference]: Without dead ends: 109 [2023-12-20 21:01:21,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-20 21:01:21,692 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 36 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 21:01:21,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 319 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 21:01:21,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-12-20 21:01:21,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2023-12-20 21:01:21,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 78 states have internal predecessors, (108), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-20 21:01:21,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 160 transitions. [2023-12-20 21:01:21,701 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 160 transitions. Word has length 158 [2023-12-20 21:01:21,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 21:01:21,701 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 160 transitions. [2023-12-20 21:01:21,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-20 21:01:21,702 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 160 transitions. [2023-12-20 21:01:21,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-12-20 21:01:21,703 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 21:01:21,703 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 21:01:21,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-20 21:01:21,703 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 21:01:21,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 21:01:21,704 INFO L85 PathProgramCache]: Analyzing trace with hash -522043083, now seen corresponding path program 1 times [2023-12-20 21:01:21,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 21:01:21,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539841068] [2023-12-20 21:01:21,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:01:21,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 21:01:21,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 21:01:21,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 21:01:21,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 21:01:21,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 21:01:21,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 21:01:21,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 21:01:21,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 21:01:21,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 21:01:21,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-20 21:01:21,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-20 21:01:21,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 21:01:21,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 21:01:21,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 21:01:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-20 21:01:21,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-20 21:01:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-20 21:01:21,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 21:01:21,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-20 21:01:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-20 21:01:21,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 21:01:21,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 21:01:21,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-20 21:01:21,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-20 21:01:21,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-20 21:01:21,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:21,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-20 21:01:21,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 21:01:21,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539841068] [2023-12-20 21:01:21,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539841068] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 21:01:21,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 21:01:21,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 21:01:21,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875673248] [2023-12-20 21:01:21,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 21:01:21,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 21:01:21,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 21:01:21,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 21:01:21,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 21:01:21,915 INFO L87 Difference]: Start difference. First operand 106 states and 160 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-20 21:01:22,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 21:01:22,052 INFO L93 Difference]: Finished difference Result 314 states and 474 transitions. [2023-12-20 21:01:22,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 21:01:22,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 158 [2023-12-20 21:01:22,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 21:01:22,054 INFO L225 Difference]: With dead ends: 314 [2023-12-20 21:01:22,054 INFO L226 Difference]: Without dead ends: 209 [2023-12-20 21:01:22,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-20 21:01:22,059 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 120 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 21:01:22,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 259 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 21:01:22,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2023-12-20 21:01:22,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 122. [2023-12-20 21:01:22,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 93 states have (on average 1.4193548387096775) internal successors, (132), 94 states have internal predecessors, (132), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-20 21:01:22,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 184 transitions. [2023-12-20 21:01:22,079 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 184 transitions. Word has length 158 [2023-12-20 21:01:22,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 21:01:22,079 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 184 transitions. [2023-12-20 21:01:22,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-20 21:01:22,079 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 184 transitions. [2023-12-20 21:01:22,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-12-20 21:01:22,080 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 21:01:22,080 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 21:01:22,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-20 21:01:22,081 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 21:01:22,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 21:01:22,081 INFO L85 PathProgramCache]: Analyzing trace with hash -915070093, now seen corresponding path program 1 times [2023-12-20 21:01:22,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 21:01:22,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042550853] [2023-12-20 21:01:22,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:01:22,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 21:01:22,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 21:01:22,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 21:01:22,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 21:01:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 21:01:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 21:01:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 21:01:22,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 21:01:22,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 21:01:22,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-20 21:01:22,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-20 21:01:22,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 21:01:22,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 21:01:22,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 21:01:22,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-20 21:01:22,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-20 21:01:22,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-20 21:01:22,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 21:01:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-20 21:01:22,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-20 21:01:22,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 21:01:22,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 21:01:22,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-20 21:01:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-20 21:01:22,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-20 21:01:22,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-20 21:01:22,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 21:01:22,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042550853] [2023-12-20 21:01:22,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042550853] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 21:01:22,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 21:01:22,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 21:01:22,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708316820] [2023-12-20 21:01:22,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 21:01:22,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 21:01:22,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 21:01:22,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 21:01:22,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 21:01:22,363 INFO L87 Difference]: Start difference. First operand 122 states and 184 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-20 21:01:22,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 21:01:22,427 INFO L93 Difference]: Finished difference Result 291 states and 436 transitions. [2023-12-20 21:01:22,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 21:01:22,427 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 158 [2023-12-20 21:01:22,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 21:01:22,429 INFO L225 Difference]: With dead ends: 291 [2023-12-20 21:01:22,429 INFO L226 Difference]: Without dead ends: 170 [2023-12-20 21:01:22,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-20 21:01:22,432 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 150 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 21:01:22,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 470 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 21:01:22,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2023-12-20 21:01:22,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 102. [2023-12-20 21:01:22,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 75 states have (on average 1.36) internal successors, (102), 75 states have internal predecessors, (102), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-20 21:01:22,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 150 transitions. [2023-12-20 21:01:22,450 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 150 transitions. Word has length 158 [2023-12-20 21:01:22,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 21:01:22,450 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 150 transitions. [2023-12-20 21:01:22,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-20 21:01:22,450 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 150 transitions. [2023-12-20 21:01:22,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-12-20 21:01:22,452 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 21:01:22,453 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 21:01:22,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-20 21:01:22,453 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 21:01:22,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 21:01:22,453 INFO L85 PathProgramCache]: Analyzing trace with hash -2110390985, now seen corresponding path program 1 times [2023-12-20 21:01:22,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 21:01:22,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31974809] [2023-12-20 21:01:22,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:01:22,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 21:01:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 21:01:22,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 21:01:22,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 21:01:22,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 21:01:22,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 21:01:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 21:01:22,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 21:01:22,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 21:01:22,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-20 21:01:22,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-20 21:01:22,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 21:01:22,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 21:01:22,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 21:01:22,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-20 21:01:22,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-20 21:01:22,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-20 21:01:22,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 21:01:22,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-20 21:01:22,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-20 21:01:22,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 21:01:22,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 21:01:22,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-20 21:01:22,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-20 21:01:22,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-20 21:01:22,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-20 21:01:22,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 21:01:22,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31974809] [2023-12-20 21:01:22,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31974809] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 21:01:22,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 21:01:22,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 21:01:22,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142275011] [2023-12-20 21:01:22,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 21:01:22,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 21:01:22,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 21:01:22,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 21:01:22,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 21:01:22,585 INFO L87 Difference]: Start difference. First operand 102 states and 150 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-20 21:01:22,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 21:01:22,669 INFO L93 Difference]: Finished difference Result 203 states and 299 transitions. [2023-12-20 21:01:22,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 21:01:22,669 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 158 [2023-12-20 21:01:22,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 21:01:22,671 INFO L225 Difference]: With dead ends: 203 [2023-12-20 21:01:22,671 INFO L226 Difference]: Without dead ends: 102 [2023-12-20 21:01:22,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-20 21:01:22,672 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 120 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 21:01:22,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 141 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 21:01:22,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-12-20 21:01:22,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 94. [2023-12-20 21:01:22,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 67 states have internal predecessors, (88), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-20 21:01:22,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 136 transitions. [2023-12-20 21:01:22,681 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 136 transitions. Word has length 158 [2023-12-20 21:01:22,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 21:01:22,683 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 136 transitions. [2023-12-20 21:01:22,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-20 21:01:22,684 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 136 transitions. [2023-12-20 21:01:22,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-12-20 21:01:22,684 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 21:01:22,685 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 21:01:22,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-20 21:01:22,685 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 21:01:22,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 21:01:22,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1791549301, now seen corresponding path program 1 times [2023-12-20 21:01:22,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 21:01:22,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549699993] [2023-12-20 21:01:22,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:01:22,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 21:01:22,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 21:01:22,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 21:01:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 21:01:22,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 21:01:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 21:01:22,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 21:01:22,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 21:01:22,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 21:01:22,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-20 21:01:22,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-20 21:01:22,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 21:01:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 21:01:22,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 21:01:22,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-20 21:01:22,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-20 21:01:22,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-20 21:01:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 21:01:22,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-20 21:01:22,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-20 21:01:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 21:01:22,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 21:01:22,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-20 21:01:22,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-20 21:01:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-20 21:01:22,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:22,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 6 proven. 63 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2023-12-20 21:01:22,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 21:01:22,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549699993] [2023-12-20 21:01:22,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549699993] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 21:01:22,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710312429] [2023-12-20 21:01:22,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:01:22,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 21:01:22,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 21:01:22,972 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 21:01:23,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-20 21:01:23,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:23,142 INFO L262 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-20 21:01:23,152 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 21:01:23,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 195 proven. 63 refuted. 0 times theorem prover too weak. 846 trivial. 0 not checked. [2023-12-20 21:01:23,357 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 21:01:23,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 6 proven. 63 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2023-12-20 21:01:23,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710312429] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 21:01:23,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 21:01:23,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2023-12-20 21:01:23,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060748756] [2023-12-20 21:01:23,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 21:01:23,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 21:01:23,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 21:01:23,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 21:01:23,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-20 21:01:23,548 INFO L87 Difference]: Start difference. First operand 94 states and 136 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2023-12-20 21:01:23,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 21:01:23,683 INFO L93 Difference]: Finished difference Result 176 states and 251 transitions. [2023-12-20 21:01:23,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-20 21:01:23,684 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) Word has length 158 [2023-12-20 21:01:23,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 21:01:23,684 INFO L225 Difference]: With dead ends: 176 [2023-12-20 21:01:23,684 INFO L226 Difference]: Without dead ends: 83 [2023-12-20 21:01:23,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 359 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2023-12-20 21:01:23,686 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 127 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 21:01:23,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 165 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 21:01:23,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-12-20 21:01:23,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2023-12-20 21:01:23,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 53 states have internal predecessors, (65), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-20 21:01:23,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 113 transitions. [2023-12-20 21:01:23,696 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 113 transitions. Word has length 158 [2023-12-20 21:01:23,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 21:01:23,697 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 113 transitions. [2023-12-20 21:01:23,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2023-12-20 21:01:23,697 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 113 transitions. [2023-12-20 21:01:23,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-12-20 21:01:23,698 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 21:01:23,698 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 21:01:23,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-20 21:01:23,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 21:01:23,904 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 21:01:23,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 21:01:23,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1551204313, now seen corresponding path program 1 times [2023-12-20 21:01:23,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 21:01:23,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829569427] [2023-12-20 21:01:23,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:01:23,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 21:01:23,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:24,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 21:01:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:24,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 21:01:24,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:24,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 21:01:24,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:24,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 21:01:24,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:24,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 21:01:24,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:24,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 21:01:24,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:24,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 21:01:24,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:24,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 21:01:24,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:24,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-20 21:01:24,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:24,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-20 21:01:24,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:24,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 21:01:24,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:24,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 21:01:24,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:24,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 21:01:24,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:24,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-20 21:01:24,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:24,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-20 21:01:24,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:24,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-20 21:01:24,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:24,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 21:01:24,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:24,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-20 21:01:24,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:24,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-20 21:01:24,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:24,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 21:01:24,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:24,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 21:01:24,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:24,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-20 21:01:24,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:24,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-20 21:01:24,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:24,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-20 21:01:24,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:24,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 21 proven. 48 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2023-12-20 21:01:24,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 21:01:24,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829569427] [2023-12-20 21:01:24,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829569427] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 21:01:24,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473378136] [2023-12-20 21:01:24,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:01:24,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 21:01:24,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 21:01:24,114 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 21:01:24,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-20 21:01:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:24,237 INFO L262 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-20 21:01:24,257 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 21:01:24,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 485 proven. 48 refuted. 0 times theorem prover too weak. 571 trivial. 0 not checked. [2023-12-20 21:01:24,352 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 21:01:24,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 21 proven. 48 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2023-12-20 21:01:24,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473378136] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 21:01:24,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 21:01:24,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-12-20 21:01:24,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947084438] [2023-12-20 21:01:24,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 21:01:24,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-20 21:01:24,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 21:01:24,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-20 21:01:24,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-20 21:01:24,485 INFO L87 Difference]: Start difference. First operand 81 states and 113 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 3 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (57), 3 states have call predecessors, (57), 3 states have call successors, (57) [2023-12-20 21:01:24,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 21:01:24,603 INFO L93 Difference]: Finished difference Result 167 states and 230 transitions. [2023-12-20 21:01:24,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-20 21:01:24,604 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 3 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (57), 3 states have call predecessors, (57), 3 states have call successors, (57) Word has length 159 [2023-12-20 21:01:24,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 21:01:24,605 INFO L225 Difference]: With dead ends: 167 [2023-12-20 21:01:24,605 INFO L226 Difference]: Without dead ends: 87 [2023-12-20 21:01:24,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2023-12-20 21:01:24,605 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 93 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 21:01:24,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 175 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 21:01:24,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-12-20 21:01:24,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2023-12-20 21:01:24,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 56 states have internal predecessors, (67), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-20 21:01:24,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 115 transitions. [2023-12-20 21:01:24,614 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 115 transitions. Word has length 159 [2023-12-20 21:01:24,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 21:01:24,614 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 115 transitions. [2023-12-20 21:01:24,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 3 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (57), 3 states have call predecessors, (57), 3 states have call successors, (57) [2023-12-20 21:01:24,614 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 115 transitions. [2023-12-20 21:01:24,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-12-20 21:01:24,615 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 21:01:24,615 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 21:01:24,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-20 21:01:24,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-12-20 21:01:24,821 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 21:01:24,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 21:01:24,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1493946011, now seen corresponding path program 1 times [2023-12-20 21:01:24,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 21:01:24,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636872941] [2023-12-20 21:01:24,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:01:24,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 21:01:24,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:25,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 21:01:25,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:25,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 21:01:25,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:25,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 21:01:25,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:25,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 21:01:25,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:25,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 21:01:25,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:25,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 21:01:25,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:25,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 21:01:25,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:25,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 21:01:25,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:25,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-20 21:01:25,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:25,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-20 21:01:25,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:25,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 21:01:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:25,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 21:01:25,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:25,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 21:01:25,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:25,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-20 21:01:25,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:25,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-20 21:01:25,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:25,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-20 21:01:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:25,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 21:01:25,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:25,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-20 21:01:25,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:25,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-20 21:01:25,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:25,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 21:01:25,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:25,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 21:01:25,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:25,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-20 21:01:25,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:25,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-20 21:01:25,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:25,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-20 21:01:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:25,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 105 proven. 27 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2023-12-20 21:01:25,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 21:01:25,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636872941] [2023-12-20 21:01:25,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636872941] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 21:01:25,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309610983] [2023-12-20 21:01:25,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:01:25,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 21:01:25,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 21:01:25,335 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 21:01:25,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-20 21:01:25,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:01:25,571 INFO L262 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-20 21:01:25,574 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 21:01:25,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 491 proven. 27 refuted. 0 times theorem prover too weak. 586 trivial. 0 not checked. [2023-12-20 21:01:25,826 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 21:01:26,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 105 proven. 30 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2023-12-20 21:01:26,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309610983] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 21:01:26,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 21:01:26,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 12] total 23 [2023-12-20 21:01:26,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960463324] [2023-12-20 21:01:26,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 21:01:26,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-20 21:01:26,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 21:01:26,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-20 21:01:26,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2023-12-20 21:01:26,380 INFO L87 Difference]: Start difference. First operand 85 states and 115 transitions. Second operand has 23 states, 23 states have (on average 4.130434782608695) internal successors, (95), 23 states have internal predecessors, (95), 6 states have call successors, (36), 3 states have call predecessors, (36), 7 states have return successors, (37), 6 states have call predecessors, (37), 6 states have call successors, (37) [2023-12-20 21:01:27,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 21:01:27,630 INFO L93 Difference]: Finished difference Result 265 states and 339 transitions. [2023-12-20 21:01:27,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-12-20 21:01:27,630 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.130434782608695) internal successors, (95), 23 states have internal predecessors, (95), 6 states have call successors, (36), 3 states have call predecessors, (36), 7 states have return successors, (37), 6 states have call predecessors, (37), 6 states have call successors, (37) Word has length 159 [2023-12-20 21:01:27,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 21:01:27,631 INFO L225 Difference]: With dead ends: 265 [2023-12-20 21:01:27,631 INFO L226 Difference]: Without dead ends: 181 [2023-12-20 21:01:27,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 357 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=588, Invalid=1862, Unknown=0, NotChecked=0, Total=2450 [2023-12-20 21:01:27,633 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 471 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 353 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 353 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-20 21:01:27,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 503 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [353 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-20 21:01:27,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-12-20 21:01:27,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 97. [2023-12-20 21:01:27,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 65 states have (on average 1.1538461538461537) internal successors, (75), 65 states have internal predecessors, (75), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-20 21:01:27,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 123 transitions. [2023-12-20 21:01:27,653 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 123 transitions. Word has length 159 [2023-12-20 21:01:27,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 21:01:27,654 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 123 transitions. [2023-12-20 21:01:27,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.130434782608695) internal successors, (95), 23 states have internal predecessors, (95), 6 states have call successors, (36), 3 states have call predecessors, (36), 7 states have return successors, (37), 6 states have call predecessors, (37), 6 states have call successors, (37) [2023-12-20 21:01:27,654 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 123 transitions. [2023-12-20 21:01:27,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-12-20 21:01:27,655 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 21:01:27,674 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 21:01:27,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-20 21:01:27,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 21:01:27,883 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 21:01:27,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 21:01:27,884 INFO L85 PathProgramCache]: Analyzing trace with hash 806876579, now seen corresponding path program 1 times [2023-12-20 21:01:27,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 21:01:27,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332915250] [2023-12-20 21:01:27,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:01:27,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 21:01:27,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 21:01:27,956 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-20 21:01:28,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 21:01:28,073 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-20 21:01:28,074 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-20 21:01:28,074 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-20 21:01:28,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-20 21:01:28,077 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 21:01:28,080 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 21:01:28,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 09:01:28 BoogieIcfgContainer [2023-12-20 21:01:28,169 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 21:01:28,169 INFO L158 Benchmark]: Toolchain (without parser) took 8686.52ms. Allocated memory was 207.6MB in the beginning and 377.5MB in the end (delta: 169.9MB). Free memory was 171.1MB in the beginning and 285.5MB in the end (delta: -114.4MB). Peak memory consumption was 56.0MB. Max. memory is 8.0GB. [2023-12-20 21:01:28,169 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 207.6MB. Free memory is still 165.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 21:01:28,170 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.56ms. Allocated memory is still 207.6MB. Free memory was 171.1MB in the beginning and 154.9MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-20 21:01:28,170 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.24ms. Allocated memory is still 207.6MB. Free memory was 154.9MB in the beginning and 150.2MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-20 21:01:28,170 INFO L158 Benchmark]: Boogie Preprocessor took 53.95ms. Allocated memory is still 207.6MB. Free memory was 150.2MB in the beginning and 142.8MB in the end (delta: 7.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2023-12-20 21:01:28,170 INFO L158 Benchmark]: RCFGBuilder took 420.83ms. Allocated memory is still 207.6MB. Free memory was 142.3MB in the beginning and 115.0MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2023-12-20 21:01:28,171 INFO L158 Benchmark]: TraceAbstraction took 7889.97ms. Allocated memory was 207.6MB in the beginning and 377.5MB in the end (delta: 169.9MB). Free memory was 114.5MB in the beginning and 285.5MB in the end (delta: -171.0MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 21:01:28,172 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.46ms. Allocated memory is still 207.6MB. Free memory is still 165.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 267.56ms. Allocated memory is still 207.6MB. Free memory was 171.1MB in the beginning and 154.9MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.24ms. Allocated memory is still 207.6MB. Free memory was 154.9MB in the beginning and 150.2MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.95ms. Allocated memory is still 207.6MB. Free memory was 150.2MB in the beginning and 142.8MB in the end (delta: 7.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * RCFGBuilder took 420.83ms. Allocated memory is still 207.6MB. Free memory was 142.3MB in the beginning and 115.0MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * TraceAbstraction took 7889.97ms. Allocated memory was 207.6MB in the beginning and 377.5MB in the end (delta: 169.9MB). Free memory was 114.5MB in the beginning and 285.5MB in the end (delta: -171.0MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 169, overapproximation of someUnaryDOUBLEoperation at line 67, overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of bitwise operation at line 104, overapproximation of someBinaryArithmeticFLOAToperation at line 57, overapproximation of someUnaryFLOAToperation at line 57. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_7 = 0; [L24] unsigned char var_1_8 = 1; [L25] signed short int var_1_9 = -2; [L26] float var_1_13 = 999.4; [L27] float var_1_14 = 100.425; [L28] float var_1_15 = 3.375; [L29] float var_1_16 = 15.9; [L30] signed short int var_1_17 = -10; [L31] signed short int var_1_18 = 18060; [L32] unsigned char var_1_20 = 0; [L33] unsigned long int var_1_21 = 4; [L34] unsigned char var_1_23 = 0; [L35] unsigned char var_1_24 = 0; [L36] unsigned char var_1_25 = 100; [L37] unsigned char var_1_26 = 32; [L38] unsigned char var_1_27 = 10; [L39] unsigned char var_1_28 = 1; [L40] unsigned short int var_1_29 = 256; [L41] unsigned char var_1_30 = 1; [L42] unsigned char var_1_31 = 4; [L43] double var_1_33 = 31.625; [L44] double var_1_36 = 15.75; [L45] double var_1_37 = 15.375; [L46] unsigned short int var_1_38 = 16; [L47] unsigned char var_1_39 = 0; [L48] double var_1_44 = 128.5; [L49] float var_1_45 = 1.85; [L50] double var_1_46 = 1.5; [L51] double var_1_47 = 99999999999.4; [L52] unsigned char var_1_49 = 128; [L173] isInitial = 1 [L174] FCALL initially() [L175] COND TRUE 1 [L176] FCALL updateLastVariables() [L177] CALL updateVariables() [L126] var_1_7 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L127] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L128] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L128] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L129] var_1_8 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L130] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L131] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L131] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L132] var_1_14 = __VERIFIER_nondet_float() [L133] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L133] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L134] var_1_15 = __VERIFIER_nondet_float() [L135] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L135] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L136] var_1_16 = __VERIFIER_nondet_float() [L137] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L137] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L138] var_1_18 = __VERIFIER_nondet_short() [L139] CALL assume_abort_if_not(var_1_18 >= 16382) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L139] RET assume_abort_if_not(var_1_18 >= 16382) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L140] CALL assume_abort_if_not(var_1_18 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L140] RET assume_abort_if_not(var_1_18 <= 32766) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L141] var_1_21 = __VERIFIER_nondet_ulong() [L142] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L142] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L143] CALL assume_abort_if_not(var_1_21 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L143] RET assume_abort_if_not(var_1_21 <= 4294967295) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L144] CALL assume_abort_if_not(var_1_21 != 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L144] RET assume_abort_if_not(var_1_21 != 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L145] var_1_23 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L146] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L147] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L147] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L148] var_1_24 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L149] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L150] CALL assume_abort_if_not(var_1_24 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L150] RET assume_abort_if_not(var_1_24 <= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L151] var_1_26 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L152] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L153] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=4, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=4, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L153] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=4, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L154] var_1_27 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=4, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=4, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L155] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=4, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L156] CALL assume_abort_if_not(var_1_27 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=4, var_1_27=4, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=4, var_1_27=4, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L156] RET assume_abort_if_not(var_1_27 <= 127) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=4, var_1_27=4, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L157] var_1_36 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=4, var_1_27=4, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=4, var_1_27=4, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L158] RET assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=4, var_1_27=4, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L159] var_1_37 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854765600e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=4, var_1_27=4, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=4, var_1_27=4, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L160] RET assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854765600e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=4, var_1_27=4, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L161] var_1_46 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_46 >= 0.0F && var_1_46 <= -1.0e-20F) || (var_1_46 <= 9223372.036854776000e+12F && var_1_46 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=4, var_1_27=4, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=4, var_1_27=4, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L162] RET assume_abort_if_not((var_1_46 >= 0.0F && var_1_46 <= -1.0e-20F) || (var_1_46 <= 9223372.036854776000e+12F && var_1_46 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=4, var_1_27=4, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L163] var_1_47 = __VERIFIER_nondet_double() [L164] CALL assume_abort_if_not((var_1_47 >= 0.0F && var_1_47 <= -1.0e-20F) || (var_1_47 <= 9223372.036854776000e+12F && var_1_47 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=4, var_1_27=4, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=4, var_1_27=4, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L164] RET assume_abort_if_not((var_1_47 >= 0.0F && var_1_47 <= -1.0e-20F) || (var_1_47 <= 9223372.036854776000e+12F && var_1_47 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=4, var_1_27=4, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L177] RET updateVariables() [L178] CALL step() [L56] COND TRUE \read(var_1_8) [L57] var_1_13 = (((((var_1_14 + var_1_15)) < (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16))))) ? ((var_1_14 + var_1_15)) : (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16)))))) VAL [isInitial=1, var_1_13=100000000004, var_1_16=100000000004, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=4, var_1_27=4, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L59] COND TRUE \read(var_1_8) [L60] var_1_25 = (var_1_26 + var_1_27) VAL [isInitial=1, var_1_13=100000000004, var_1_16=100000000004, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=8, var_1_26=4, var_1_27=4, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L62] COND FALSE !((var_1_16 * (var_1_46 - var_1_47)) < var_1_15) [L67] var_1_45 = (((((((((((var_1_15) > (var_1_36)) ? (var_1_15) : (var_1_36)))) < (var_1_37)) ? (((((var_1_15) > (var_1_36)) ? (var_1_15) : (var_1_36)))) : (var_1_37))) < 0 ) ? -((((((((var_1_15) > (var_1_36)) ? (var_1_15) : (var_1_36)))) < (var_1_37)) ? (((((var_1_15) > (var_1_36)) ? (var_1_15) : (var_1_36)))) : (var_1_37))) : ((((((((var_1_15) > (var_1_36)) ? (var_1_15) : (var_1_36)))) < (var_1_37)) ? (((((var_1_15) > (var_1_36)) ? (var_1_15) : (var_1_36)))) : (var_1_37))))) VAL [isInitial=1, var_1_13=100000000004, var_1_15=100000000005, var_1_16=100000000004, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=8, var_1_26=4, var_1_27=4, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=100000000005, var_1_37=100000000005, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=100000000005, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L69] var_1_29 = var_1_27 [L70] var_1_38 = ((((var_1_26) > (var_1_27)) ? (var_1_26) : (var_1_27))) [L71] var_1_30 = var_1_8 VAL [isInitial=1, var_1_13=100000000004, var_1_15=100000000005, var_1_16=100000000004, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=8, var_1_26=4, var_1_27=4, var_1_28=1, var_1_29=4, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=100000000005, var_1_37=100000000005, var_1_38=4, var_1_39=0, var_1_44=257/2, var_1_45=100000000005, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L72] COND FALSE !((var_1_29 > var_1_25) && var_1_30) [L75] var_1_9 = ((((var_1_25) > ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25))))) ? (var_1_25) : ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25)))))) VAL [isInitial=1, var_1_13=100000000004, var_1_15=100000000005, var_1_16=100000000004, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=8, var_1_26=4, var_1_27=4, var_1_28=1, var_1_29=4, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=100000000005, var_1_37=100000000005, var_1_38=4, var_1_39=0, var_1_44=257/2, var_1_45=100000000005, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=8] [L77] var_1_31 = var_1_26 [L78] var_1_17 = ((var_1_18 - 25) - var_1_25) VAL [isInitial=1, var_1_13=100000000004, var_1_15=100000000005, var_1_16=100000000004, var_1_17=16349, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=8, var_1_26=4, var_1_27=4, var_1_28=1, var_1_29=4, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=100000000005, var_1_37=100000000005, var_1_38=4, var_1_39=0, var_1_44=257/2, var_1_45=100000000005, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=8] [L79] COND FALSE !(var_1_36 <= var_1_14) [L84] var_1_44 = var_1_36 VAL [isInitial=1, var_1_13=100000000004, var_1_15=100000000005, var_1_16=100000000004, var_1_17=16349, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=8, var_1_26=4, var_1_27=4, var_1_28=1, var_1_29=4, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=100000000005, var_1_37=100000000005, var_1_38=4, var_1_39=0, var_1_44=100000000005, var_1_45=100000000005, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=8] [L86] signed long int stepLocal_2 = var_1_25 + var_1_17; VAL [isInitial=1, stepLocal_2=16357, var_1_13=100000000004, var_1_15=100000000005, var_1_16=100000000004, var_1_17=16349, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=8, var_1_26=4, var_1_27=4, var_1_28=1, var_1_29=4, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=100000000005, var_1_37=100000000005, var_1_38=4, var_1_39=0, var_1_44=100000000005, var_1_45=100000000005, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=8] [L87] COND TRUE ((var_1_18 % var_1_21) & ((((1u) < 0 ) ? -(1u) : (1u)))) < stepLocal_2 [L88] var_1_20 = (var_1_23 || var_1_24) VAL [isInitial=1, stepLocal_2=16357, var_1_13=100000000004, var_1_15=100000000005, var_1_16=100000000004, var_1_17=16349, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=8, var_1_26=4, var_1_27=4, var_1_28=1, var_1_29=4, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=100000000005, var_1_37=100000000005, var_1_38=4, var_1_39=0, var_1_44=100000000005, var_1_45=100000000005, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=8] [L92] COND TRUE (var_1_29 & (var_1_18 + 2u)) < (16u >> var_1_26) [L93] var_1_39 = ((var_1_7 && (var_1_8 && var_1_7)) && (! var_1_23)) VAL [isInitial=1, stepLocal_2=16357, var_1_13=100000000004, var_1_15=100000000005, var_1_16=100000000004, var_1_17=16349, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=8, var_1_26=4, var_1_27=4, var_1_28=1, var_1_29=4, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=100000000005, var_1_37=100000000005, var_1_38=4, var_1_39=1, var_1_44=100000000005, var_1_45=100000000005, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=8] [L95] signed short int stepLocal_3 = var_1_9; VAL [isInitial=1, stepLocal_2=16357, stepLocal_3=8, var_1_13=100000000004, var_1_15=100000000005, var_1_16=100000000004, var_1_17=16349, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=8, var_1_26=4, var_1_27=4, var_1_28=1, var_1_29=4, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=100000000005, var_1_37=100000000005, var_1_38=4, var_1_39=1, var_1_44=100000000005, var_1_45=100000000005, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=8] [L96] COND FALSE !((~ var_1_29) > stepLocal_3) [L99] var_1_28 = (var_1_20 || ((! var_1_23) && (var_1_24 || var_1_7))) VAL [isInitial=1, stepLocal_2=16357, stepLocal_3=8, var_1_13=100000000004, var_1_15=100000000005, var_1_16=100000000004, var_1_17=16349, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=8, var_1_26=4, var_1_27=4, var_1_28=1, var_1_29=4, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=100000000005, var_1_37=100000000005, var_1_38=4, var_1_39=1, var_1_44=100000000005, var_1_45=100000000005, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=8] [L101] COND FALSE !(! var_1_8) VAL [isInitial=1, stepLocal_2=16357, stepLocal_3=8, var_1_13=100000000004, var_1_15=100000000005, var_1_16=100000000004, var_1_17=16349, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=8, var_1_26=4, var_1_27=4, var_1_28=1, var_1_29=4, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=100000000005, var_1_37=100000000005, var_1_38=4, var_1_39=1, var_1_44=100000000005, var_1_45=100000000005, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=8] [L104] var_1_8 || (var_1_27 >= (var_1_25 & var_1_18)) VAL [isInitial=1, stepLocal_2=16357, stepLocal_3=8, var_1_13=100000000004, var_1_15=100000000005, var_1_16=100000000004, var_1_17=16349, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=8, var_1_26=4, var_1_27=4, var_1_28=1, var_1_29=4, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=100000000005, var_1_37=100000000005, var_1_38=4, var_1_39=1, var_1_44=100000000005, var_1_45=100000000005, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=8] [L104] COND TRUE var_1_8 || (var_1_27 >= (var_1_25 & var_1_18)) [L105] COND FALSE !(-2 > var_1_18) [L108] var_1_49 = var_1_27 VAL [isInitial=1, stepLocal_2=16357, stepLocal_3=8, var_1_13=100000000004, var_1_15=100000000005, var_1_16=100000000004, var_1_17=16349, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=8, var_1_26=4, var_1_27=4, var_1_28=1, var_1_29=4, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=100000000005, var_1_37=100000000005, var_1_38=4, var_1_39=1, var_1_44=100000000005, var_1_45=100000000005, var_1_49=4, var_1_7=1, var_1_8=1, var_1_9=8] [L111] signed long int stepLocal_1 = (((var_1_9) > (var_1_25)) ? (var_1_9) : (var_1_25)); [L112] unsigned char stepLocal_0 = var_1_25; VAL [isInitial=1, stepLocal_0=8, stepLocal_1=8, stepLocal_2=16357, stepLocal_3=8, var_1_13=100000000004, var_1_15=100000000005, var_1_16=100000000004, var_1_17=16349, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=8, var_1_26=4, var_1_27=4, var_1_28=1, var_1_29=4, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=100000000005, var_1_37=100000000005, var_1_38=4, var_1_39=1, var_1_44=100000000005, var_1_45=100000000005, var_1_49=4, var_1_7=1, var_1_8=1, var_1_9=8] [L113] COND FALSE !(stepLocal_1 <= (var_1_25 - var_1_25)) [L122] var_1_1 = 0 VAL [isInitial=1, stepLocal_0=8, stepLocal_1=8, stepLocal_2=16357, stepLocal_3=8, var_1_13=100000000004, var_1_15=100000000005, var_1_16=100000000004, var_1_17=16349, var_1_18=16382, var_1_1=0, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=8, var_1_26=4, var_1_27=4, var_1_28=1, var_1_29=4, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=100000000005, var_1_37=100000000005, var_1_38=4, var_1_39=1, var_1_44=100000000005, var_1_45=100000000005, var_1_49=4, var_1_7=1, var_1_8=1, var_1_9=8] [L178] RET step() [L179] CALL, EXPR property() [L169-L170] return (((((((((((((var_1_9) > (var_1_25)) ? (var_1_9) : (var_1_25))) <= (var_1_25 - var_1_25)) ? ((var_1_25 < var_1_25) ? (var_1_20 ? (var_1_1 == ((unsigned char) var_1_7)) : (var_1_1 == ((unsigned char) var_1_8))) : 1) : (var_1_1 == ((unsigned char) 0))) && (((var_1_29 > var_1_25) && var_1_30) ? (var_1_9 == ((signed short int) var_1_25)) : (var_1_9 == ((signed short int) ((((var_1_25) > ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25))))) ? (var_1_25) : ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25)))))))))) && (var_1_8 ? (var_1_13 == ((float) (((((var_1_14 + var_1_15)) < (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16))))) ? ((var_1_14 + var_1_15)) : (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16)))))))) : 1)) && (var_1_17 == ((signed short int) ((var_1_18 - 25) - var_1_25)))) && ((((var_1_18 % var_1_21) & ((((1u) < 0 ) ? -(1u) : (1u)))) < (var_1_25 + var_1_17)) ? (var_1_20 == ((unsigned char) (var_1_23 || var_1_24))) : (var_1_20 == ((unsigned char) var_1_7)))) && (var_1_8 ? (var_1_25 == ((unsigned char) (var_1_26 + var_1_27))) : 1)) && (((~ var_1_29) > var_1_9) ? (var_1_28 == ((unsigned char) (! var_1_7))) : (var_1_28 == ((unsigned char) (var_1_20 || ((! var_1_23) && (var_1_24 || var_1_7))))))) && (var_1_29 == ((unsigned short int) var_1_27))) && (var_1_30 == ((unsigned char) var_1_8)) ; [L179] RET, EXPR property() [L179] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_13=100000000004, var_1_15=100000000005, var_1_16=100000000004, var_1_17=16349, var_1_18=16382, var_1_1=0, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=8, var_1_26=4, var_1_27=4, var_1_28=1, var_1_29=4, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=100000000005, var_1_37=100000000005, var_1_38=4, var_1_39=1, var_1_44=100000000005, var_1_45=100000000005, var_1_49=4, var_1_7=1, var_1_8=1, var_1_9=8] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_13=100000000004, var_1_15=100000000005, var_1_16=100000000004, var_1_17=16349, var_1_18=16382, var_1_1=0, var_1_20=0, var_1_21=1, var_1_23=0, var_1_24=0, var_1_25=8, var_1_26=4, var_1_27=4, var_1_28=1, var_1_29=4, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=100000000005, var_1_37=100000000005, var_1_38=4, var_1_39=1, var_1_44=100000000005, var_1_45=100000000005, var_1_49=4, var_1_7=1, var_1_8=1, var_1_9=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.8s, OverallIterations: 11, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1166 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1155 mSDsluCounter, 2556 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1451 mSDsCounter, 428 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1289 IncrementalHoareTripleChecker+Invalid, 1717 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 428 mSolverCounterUnsat, 1105 mSDtfsCounter, 1289 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1539 GetRequests, 1455 SyntacticMatches, 3 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=5, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 257 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 2217 NumberOfCodeBlocks, 2217 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2518 ConstructedInterpolants, 0 QuantifiedInterpolants, 6366 SizeOfPredicates, 11 NumberOfNonLiveVariables, 1152 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 16 InterpolantComputations, 7 PerfectInterpolantSequences, 17247/17664 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-20 21:01:28,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...