/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-65.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 20:19:30,877 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 20:19:30,942 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-15 20:19:30,947 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 20:19:30,948 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 20:19:30,969 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 20:19:30,969 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 20:19:30,970 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 20:19:30,970 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 20:19:30,973 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 20:19:30,973 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 20:19:30,974 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 20:19:30,974 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 20:19:30,975 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 20:19:30,975 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 20:19:30,975 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 20:19:30,976 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 20:19:30,976 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 20:19:30,976 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 20:19:30,976 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 20:19:30,976 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 20:19:30,977 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 20:19:30,977 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 20:19:30,977 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 20:19:30,977 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 20:19:30,977 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 20:19:30,977 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 20:19:30,978 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 20:19:30,978 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 20:19:30,978 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 20:19:30,979 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 20:19:30,979 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 20:19:30,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 20:19:30,979 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 20:19:30,979 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 20:19:30,979 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 20:19:30,980 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 20:19:30,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 20:19:30,980 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 20:19:30,980 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 20:19:30,980 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 20:19:30,980 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 20:19:30,980 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 20:19:30,981 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-15 20:19:31,174 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 20:19:31,197 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 20:19:31,199 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 20:19:31,200 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 20:19:31,200 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 20:19:31,201 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-65.i [2023-12-15 20:19:32,285 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 20:19:32,410 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 20:19:32,411 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-65.i [2023-12-15 20:19:32,417 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e09adfaa/1bb8204cc0034a42b249097df0238b78/FLAG2755c154f [2023-12-15 20:19:32,430 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e09adfaa/1bb8204cc0034a42b249097df0238b78 [2023-12-15 20:19:32,431 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 20:19:32,436 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 20:19:32,437 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 20:19:32,437 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 20:19:32,441 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 20:19:32,441 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:19:32" (1/1) ... [2023-12-15 20:19:32,442 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d3b5a33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:19:32, skipping insertion in model container [2023-12-15 20:19:32,442 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:19:32" (1/1) ... [2023-12-15 20:19:32,469 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 20:19:32,565 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-65.i[919,932] [2023-12-15 20:19:32,629 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 20:19:32,637 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 20:19:32,645 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-65.i[919,932] [2023-12-15 20:19:32,666 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 20:19:32,681 INFO L206 MainTranslator]: Completed translation [2023-12-15 20:19:32,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:19:32 WrapperNode [2023-12-15 20:19:32,682 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 20:19:32,683 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 20:19:32,683 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 20:19:32,683 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 20:19:32,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:19:32" (1/1) ... [2023-12-15 20:19:32,696 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:19:32" (1/1) ... [2023-12-15 20:19:32,725 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 269 [2023-12-15 20:19:32,725 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 20:19:32,726 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 20:19:32,726 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 20:19:32,726 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 20:19:32,734 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:19:32" (1/1) ... [2023-12-15 20:19:32,734 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:19:32" (1/1) ... [2023-12-15 20:19:32,737 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:19:32" (1/1) ... [2023-12-15 20:19:32,750 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-15 20:19:32,750 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:19:32" (1/1) ... [2023-12-15 20:19:32,751 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:19:32" (1/1) ... [2023-12-15 20:19:32,758 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:19:32" (1/1) ... [2023-12-15 20:19:32,761 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:19:32" (1/1) ... [2023-12-15 20:19:32,763 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:19:32" (1/1) ... [2023-12-15 20:19:32,764 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:19:32" (1/1) ... [2023-12-15 20:19:32,767 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 20:19:32,768 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 20:19:32,768 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 20:19:32,768 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 20:19:32,769 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:19:32" (1/1) ... [2023-12-15 20:19:32,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 20:19:32,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:19:32,793 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-15 20:19:32,832 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-15 20:19:32,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 20:19:32,835 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 20:19:32,836 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 20:19:32,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 20:19:32,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 20:19:32,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 20:19:32,921 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 20:19:32,926 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 20:19:33,228 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 20:19:33,248 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 20:19:33,248 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 20:19:33,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:19:33 BoogieIcfgContainer [2023-12-15 20:19:33,249 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 20:19:33,250 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 20:19:33,250 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 20:19:33,252 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 20:19:33,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 08:19:32" (1/3) ... [2023-12-15 20:19:33,253 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e416a82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:19:33, skipping insertion in model container [2023-12-15 20:19:33,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:19:32" (2/3) ... [2023-12-15 20:19:33,253 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e416a82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:19:33, skipping insertion in model container [2023-12-15 20:19:33,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:19:33" (3/3) ... [2023-12-15 20:19:33,254 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-65.i [2023-12-15 20:19:33,266 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 20:19:33,266 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 20:19:33,297 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 20:19:33,302 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;@15464657, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 20:19:33,302 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 20:19:33,305 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 66 states have (on average 1.621212121212121) internal successors, (107), 67 states have internal predecessors, (107), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-15 20:19:33,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-15 20:19:33,325 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:19:33,326 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:19:33,326 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:19:33,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:19:33,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1077122347, now seen corresponding path program 1 times [2023-12-15 20:19:33,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:19:33,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779919823] [2023-12-15 20:19:33,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:19:33,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:19:33,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:33,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:19:33,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:33,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:19:33,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:33,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:19:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:33,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:19:33,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:33,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:19:33,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:33,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:19:33,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:33,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:19:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:33,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:19:33,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:33,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:19:33,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:33,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:19:33,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:33,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:19:33,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:33,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-15 20:19:33,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:33,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-15 20:19:33,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:33,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 20:19:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:33,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 20:19:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:33,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-15 20:19:33,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:33,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-15 20:19:33,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:33,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-15 20:19:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:33,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-15 20:19:33,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:33,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 20:19:33,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:33,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 20:19:33,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:33,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-15 20:19:33,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:33,620 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-12-15 20:19:33,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:19:33,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779919823] [2023-12-15 20:19:33,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779919823] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:19:33,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:19:33,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 20:19:33,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256333684] [2023-12-15 20:19:33,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:19:33,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 20:19:33,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:19:33,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 20:19:33,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 20:19:33,658 INFO L87 Difference]: Start difference. First operand has 91 states, 66 states have (on average 1.621212121212121) internal successors, (107), 67 states have internal predecessors, (107), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2023-12-15 20:19:33,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:19:33,718 INFO L93 Difference]: Finished difference Result 179 states and 322 transitions. [2023-12-15 20:19:33,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 20:19:33,720 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 148 [2023-12-15 20:19:33,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:19:33,728 INFO L225 Difference]: With dead ends: 179 [2023-12-15 20:19:33,729 INFO L226 Difference]: Without dead ends: 89 [2023-12-15 20:19:33,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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-15 20:19:33,735 INFO L413 NwaCegarLoop]: 140 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, 140 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-15 20:19:33,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:19:33,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-15 20:19:33,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-12-15 20:19:33,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 65 states have (on average 1.523076923076923) internal successors, (99), 65 states have internal predecessors, (99), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-15 20:19:33,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 143 transitions. [2023-12-15 20:19:33,788 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 143 transitions. Word has length 148 [2023-12-15 20:19:33,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:19:33,788 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 143 transitions. [2023-12-15 20:19:33,788 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2023-12-15 20:19:33,788 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 143 transitions. [2023-12-15 20:19:33,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-15 20:19:33,796 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:19:33,796 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:19:33,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 20:19:33,796 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:19:33,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:19:33,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1364537433, now seen corresponding path program 1 times [2023-12-15 20:19:33,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:19:33,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269520833] [2023-12-15 20:19:33,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:19:33,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:19:33,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:19:34,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:19:34,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:19:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:19:34,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:19:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:19:34,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:19:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:19:34,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:19:34,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:19:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:19:34,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-15 20:19:34,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-15 20:19:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 20:19:34,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 20:19:34,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-15 20:19:34,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-15 20:19:34,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-15 20:19:34,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-15 20:19:34,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 20:19:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 20:19:34,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-15 20:19:34,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,121 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-12-15 20:19:34,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:19:34,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269520833] [2023-12-15 20:19:34,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269520833] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:19:34,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:19:34,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:19:34,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831159870] [2023-12-15 20:19:34,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:19:34,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:19:34,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:19:34,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:19:34,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:19:34,129 INFO L87 Difference]: Start difference. First operand 89 states and 143 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:19:34,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:19:34,240 INFO L93 Difference]: Finished difference Result 265 states and 427 transitions. [2023-12-15 20:19:34,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:19:34,241 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 148 [2023-12-15 20:19:34,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:19:34,242 INFO L225 Difference]: With dead ends: 265 [2023-12-15 20:19:34,243 INFO L226 Difference]: Without dead ends: 177 [2023-12-15 20:19:34,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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-15 20:19:34,244 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 124 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:19:34,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 352 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:19:34,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-12-15 20:19:34,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 123. [2023-12-15 20:19:34,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 99 states have (on average 1.5757575757575757) internal successors, (156), 99 states have internal predecessors, (156), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-15 20:19:34,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 200 transitions. [2023-12-15 20:19:34,254 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 200 transitions. Word has length 148 [2023-12-15 20:19:34,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:19:34,256 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 200 transitions. [2023-12-15 20:19:34,256 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:19:34,256 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 200 transitions. [2023-12-15 20:19:34,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-15 20:19:34,257 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:19:34,257 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:19:34,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 20:19:34,257 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:19:34,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:19:34,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1042844555, now seen corresponding path program 1 times [2023-12-15 20:19:34,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:19:34,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730687803] [2023-12-15 20:19:34,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:19:34,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:19:34,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:19:34,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:19:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:19:34,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:19:34,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:19:34,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:19:34,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:19:34,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:19:34,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:19:34,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:19:34,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:19:34,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-15 20:19:34,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-15 20:19:34,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 20:19:34,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 20:19:34,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-15 20:19:34,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-15 20:19:34,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-15 20:19:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-15 20:19:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 20:19:34,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 20:19:34,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-15 20:19:34,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,380 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-12-15 20:19:34,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:19:34,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730687803] [2023-12-15 20:19:34,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730687803] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:19:34,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:19:34,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:19:34,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014469656] [2023-12-15 20:19:34,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:19:34,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:19:34,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:19:34,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:19:34,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:19:34,385 INFO L87 Difference]: Start difference. First operand 123 states and 200 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:19:34,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:19:34,404 INFO L93 Difference]: Finished difference Result 209 states and 334 transitions. [2023-12-15 20:19:34,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:19:34,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 149 [2023-12-15 20:19:34,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:19:34,408 INFO L225 Difference]: With dead ends: 209 [2023-12-15 20:19:34,408 INFO L226 Difference]: Without dead ends: 87 [2023-12-15 20:19:34,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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-15 20:19:34,413 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 53 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:19:34,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 203 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:19:34,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-12-15 20:19:34,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-12-15 20:19:34,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 63 states have (on average 1.4285714285714286) internal successors, (90), 63 states have internal predecessors, (90), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-15 20:19:34,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 134 transitions. [2023-12-15 20:19:34,423 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 134 transitions. Word has length 149 [2023-12-15 20:19:34,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:19:34,423 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 134 transitions. [2023-12-15 20:19:34,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:19:34,423 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 134 transitions. [2023-12-15 20:19:34,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-15 20:19:34,424 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:19:34,425 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:19:34,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 20:19:34,425 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:19:34,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:19:34,425 INFO L85 PathProgramCache]: Analyzing trace with hash -423274210, now seen corresponding path program 1 times [2023-12-15 20:19:34,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:19:34,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571884211] [2023-12-15 20:19:34,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:19:34,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:19:34,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:19:34,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:19:34,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:19:34,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:19:34,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:19:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:19:34,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:19:34,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:19:34,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:19:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:19:34,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:19:34,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-15 20:19:34,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-15 20:19:34,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 20:19:34,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 20:19:34,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-15 20:19:34,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-15 20:19:34,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-15 20:19:34,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-15 20:19:34,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 20:19:34,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 20:19:34,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-15 20:19:34,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,551 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-12-15 20:19:34,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:19:34,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571884211] [2023-12-15 20:19:34,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571884211] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:19:34,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:19:34,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:19:34,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030072917] [2023-12-15 20:19:34,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:19:34,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:19:34,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:19:34,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:19:34,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:19:34,554 INFO L87 Difference]: Start difference. First operand 87 states and 134 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:19:34,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:19:34,598 INFO L93 Difference]: Finished difference Result 257 states and 396 transitions. [2023-12-15 20:19:34,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:19:34,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2023-12-15 20:19:34,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:19:34,600 INFO L225 Difference]: With dead ends: 257 [2023-12-15 20:19:34,600 INFO L226 Difference]: Without dead ends: 171 [2023-12-15 20:19:34,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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-15 20:19:34,605 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 121 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:19:34,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 346 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:19:34,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-12-15 20:19:34,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2023-12-15 20:19:34,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 122 states have (on average 1.401639344262295) internal successors, (171), 122 states have internal predecessors, (171), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-12-15 20:19:34,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 259 transitions. [2023-12-15 20:19:34,630 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 259 transitions. Word has length 150 [2023-12-15 20:19:34,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:19:34,630 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 259 transitions. [2023-12-15 20:19:34,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:19:34,631 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 259 transitions. [2023-12-15 20:19:34,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-15 20:19:34,631 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:19:34,632 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:19:34,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 20:19:34,632 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:19:34,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:19:34,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1232620836, now seen corresponding path program 1 times [2023-12-15 20:19:34,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:19:34,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284934681] [2023-12-15 20:19:34,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:19:34,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:19:34,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:19:34,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:19:34,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:19:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:19:34,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:19:34,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:19:34,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:19:34,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:19:34,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:19:34,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:19:34,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:19:34,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-15 20:19:34,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-15 20:19:34,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 20:19:34,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 20:19:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-15 20:19:34,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-15 20:19:34,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-15 20:19:34,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-15 20:19:34,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 20:19:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 20:19:34,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-15 20:19:34,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:34,874 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-12-15 20:19:34,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:19:34,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284934681] [2023-12-15 20:19:34,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284934681] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:19:34,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:19:34,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 20:19:34,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20926987] [2023-12-15 20:19:34,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:19:34,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 20:19:34,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:19:34,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 20:19:34,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 20:19:34,876 INFO L87 Difference]: Start difference. First operand 169 states and 259 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:19:35,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:19:35,074 INFO L93 Difference]: Finished difference Result 451 states and 687 transitions. [2023-12-15 20:19:35,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 20:19:35,075 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2023-12-15 20:19:35,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:19:35,076 INFO L225 Difference]: With dead ends: 451 [2023-12-15 20:19:35,077 INFO L226 Difference]: Without dead ends: 283 [2023-12-15 20:19:35,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-15 20:19:35,078 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 89 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:19:35,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 411 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:19:35,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2023-12-15 20:19:35,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 214. [2023-12-15 20:19:35,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 144 states have (on average 1.3680555555555556) internal successors, (197), 144 states have internal predecessors, (197), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2023-12-15 20:19:35,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 329 transitions. [2023-12-15 20:19:35,138 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 329 transitions. Word has length 150 [2023-12-15 20:19:35,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:19:35,139 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 329 transitions. [2023-12-15 20:19:35,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:19:35,139 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 329 transitions. [2023-12-15 20:19:35,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-15 20:19:35,140 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:19:35,140 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:19:35,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 20:19:35,140 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:19:35,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:19:35,140 INFO L85 PathProgramCache]: Analyzing trace with hash 572817498, now seen corresponding path program 1 times [2023-12-15 20:19:35,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:19:35,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932453698] [2023-12-15 20:19:35,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:19:35,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:19:35,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:35,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:19:35,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:35,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:19:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:35,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:19:35,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:35,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:19:35,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:35,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:19:35,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:35,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:19:35,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:35,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:19:35,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:35,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:19:35,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:35,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:19:35,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:35,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:19:35,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:35,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:19:35,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:35,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-15 20:19:35,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:35,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-15 20:19:35,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:35,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 20:19:35,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:35,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 20:19:35,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:35,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-15 20:19:35,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:35,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-15 20:19:35,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:35,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-15 20:19:35,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:35,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-15 20:19:35,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:35,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 20:19:35,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:35,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 20:19:35,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:35,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-15 20:19:35,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:35,823 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-12-15 20:19:35,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:19:35,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932453698] [2023-12-15 20:19:35,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932453698] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:19:35,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:19:35,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 20:19:35,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704168748] [2023-12-15 20:19:35,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:19:35,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 20:19:35,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:19:35,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 20:19:35,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-15 20:19:35,825 INFO L87 Difference]: Start difference. First operand 214 states and 329 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:19:36,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:19:36,285 INFO L93 Difference]: Finished difference Result 382 states and 587 transitions. [2023-12-15 20:19:36,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 20:19:36,286 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2023-12-15 20:19:36,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:19:36,289 INFO L225 Difference]: With dead ends: 382 [2023-12-15 20:19:36,289 INFO L226 Difference]: Without dead ends: 214 [2023-12-15 20:19:36,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-15 20:19:36,290 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 108 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 20:19:36,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 500 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 20:19:36,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2023-12-15 20:19:36,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2023-12-15 20:19:36,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 144 states have (on average 1.3541666666666667) internal successors, (195), 144 states have internal predecessors, (195), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2023-12-15 20:19:36,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 327 transitions. [2023-12-15 20:19:36,339 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 327 transitions. Word has length 150 [2023-12-15 20:19:36,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:19:36,339 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 327 transitions. [2023-12-15 20:19:36,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:19:36,340 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 327 transitions. [2023-12-15 20:19:36,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-15 20:19:36,340 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:19:36,341 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:19:36,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 20:19:36,341 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:19:36,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:19:36,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1360086940, now seen corresponding path program 1 times [2023-12-15 20:19:36,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:19:36,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669623709] [2023-12-15 20:19:36,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:19:36,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:19:36,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:36,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:19:36,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:36,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:19:36,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:36,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:19:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:36,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:19:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:36,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:19:36,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:36,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:19:36,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:36,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:19:36,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:36,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:19:36,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:36,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:19:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:36,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:19:36,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:36,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:19:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:36,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-15 20:19:36,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:36,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-15 20:19:36,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:36,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 20:19:36,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:36,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 20:19:36,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:36,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-15 20:19:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:36,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-15 20:19:36,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:36,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-15 20:19:36,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:36,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-15 20:19:36,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:36,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 20:19:36,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:36,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 20:19:36,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:36,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-15 20:19:36,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:36,558 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 18 proven. 45 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2023-12-15 20:19:36,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:19:36,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669623709] [2023-12-15 20:19:36,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669623709] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 20:19:36,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464498788] [2023-12-15 20:19:36,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:19:36,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:19:36,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:19:36,561 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-15 20:19:36,606 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-15 20:19:36,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:36,692 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-15 20:19:36,701 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:19:36,871 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 393 proven. 45 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2023-12-15 20:19:36,871 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 20:19:37,031 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 18 proven. 45 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2023-12-15 20:19:37,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464498788] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 20:19:37,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 20:19:37,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2023-12-15 20:19:37,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848816018] [2023-12-15 20:19:37,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 20:19:37,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 20:19:37,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:19:37,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 20:19:37,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-15 20:19:37,033 INFO L87 Difference]: Start difference. First operand 214 states and 327 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2023-12-15 20:19:37,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:19:37,230 INFO L93 Difference]: Finished difference Result 400 states and 596 transitions. [2023-12-15 20:19:37,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 20:19:37,231 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 154 [2023-12-15 20:19:37,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:19:37,232 INFO L225 Difference]: With dead ends: 400 [2023-12-15 20:19:37,232 INFO L226 Difference]: Without dead ends: 232 [2023-12-15 20:19:37,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 347 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2023-12-15 20:19:37,234 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 122 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:19:37,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 269 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:19:37,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2023-12-15 20:19:37,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 224. [2023-12-15 20:19:37,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 151 states have (on average 1.3112582781456954) internal successors, (198), 151 states have internal predecessors, (198), 66 states have call successors, (66), 6 states have call predecessors, (66), 6 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2023-12-15 20:19:37,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 330 transitions. [2023-12-15 20:19:37,272 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 330 transitions. Word has length 154 [2023-12-15 20:19:37,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:19:37,273 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 330 transitions. [2023-12-15 20:19:37,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2023-12-15 20:19:37,273 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 330 transitions. [2023-12-15 20:19:37,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-15 20:19:37,274 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:19:37,274 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:19:37,281 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-15 20:19:37,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:19:37,479 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:19:37,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:19:37,480 INFO L85 PathProgramCache]: Analyzing trace with hash 736638820, now seen corresponding path program 1 times [2023-12-15 20:19:37,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:19:37,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345951672] [2023-12-15 20:19:37,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:19:37,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:19:37,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:37,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:19:37,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:37,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:19:37,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:37,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:19:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:37,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:19:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:37,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:19:37,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:37,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:19:37,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:37,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:19:37,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:37,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:19:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:37,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:19:37,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:37,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:19:37,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:37,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:19:37,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:37,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-15 20:19:37,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:37,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-15 20:19:37,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:37,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 20:19:37,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:37,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 20:19:37,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:37,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-15 20:19:37,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:37,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-15 20:19:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:37,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-15 20:19:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:37,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-15 20:19:37,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:37,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 20:19:37,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:37,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 20:19:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:37,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-15 20:19:37,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:37,700 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-12-15 20:19:37,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:19:37,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345951672] [2023-12-15 20:19:37,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345951672] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:19:37,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:19:37,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 20:19:37,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045373391] [2023-12-15 20:19:37,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:19:37,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 20:19:37,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:19:37,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 20:19:37,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-15 20:19:37,701 INFO L87 Difference]: Start difference. First operand 224 states and 330 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:19:37,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:19:37,810 INFO L93 Difference]: Finished difference Result 438 states and 637 transitions. [2023-12-15 20:19:37,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 20:19:37,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 154 [2023-12-15 20:19:37,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:19:37,814 INFO L225 Difference]: With dead ends: 438 [2023-12-15 20:19:37,814 INFO L226 Difference]: Without dead ends: 263 [2023-12-15 20:19:37,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-15 20:19:37,815 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 63 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:19:37,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 385 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:19:37,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2023-12-15 20:19:37,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 260. [2023-12-15 20:19:37,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 179 states have (on average 1.3016759776536313) internal successors, (233), 180 states have internal predecessors, (233), 72 states have call successors, (72), 8 states have call predecessors, (72), 8 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72) [2023-12-15 20:19:37,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 377 transitions. [2023-12-15 20:19:37,865 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 377 transitions. Word has length 154 [2023-12-15 20:19:37,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:19:37,865 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 377 transitions. [2023-12-15 20:19:37,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:19:37,865 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 377 transitions. [2023-12-15 20:19:37,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-15 20:19:37,866 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:19:37,867 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:19:37,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-15 20:19:37,867 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:19:37,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:19:37,867 INFO L85 PathProgramCache]: Analyzing trace with hash -284429534, now seen corresponding path program 1 times [2023-12-15 20:19:37,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:19:37,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252491422] [2023-12-15 20:19:37,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:19:37,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:19:37,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:38,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:19:38,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:38,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:19:38,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:38,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:19:38,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:38,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:19:38,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:38,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:19:38,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:38,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:19:38,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:38,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:19:38,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:38,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:19:38,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:38,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:19:38,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:38,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:19:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:38,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:19:38,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:38,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-15 20:19:38,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:38,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-15 20:19:38,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:38,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 20:19:38,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:38,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 20:19:38,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:38,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-15 20:19:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:38,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-15 20:19:38,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:38,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-15 20:19:38,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:38,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-15 20:19:38,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:38,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 20:19:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:38,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 20:19:38,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:38,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-15 20:19:38,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:38,076 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-12-15 20:19:38,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:19:38,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252491422] [2023-12-15 20:19:38,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252491422] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:19:38,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:19:38,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 20:19:38,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044389141] [2023-12-15 20:19:38,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:19:38,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 20:19:38,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:19:38,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 20:19:38,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-15 20:19:38,078 INFO L87 Difference]: Start difference. First operand 260 states and 377 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:19:38,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:19:38,465 INFO L93 Difference]: Finished difference Result 572 states and 826 transitions. [2023-12-15 20:19:38,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 20:19:38,465 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 154 [2023-12-15 20:19:38,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:19:38,468 INFO L225 Difference]: With dead ends: 572 [2023-12-15 20:19:38,468 INFO L226 Difference]: Without dead ends: 366 [2023-12-15 20:19:38,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-12-15 20:19:38,469 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 258 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 20:19:38,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 737 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 20:19:38,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2023-12-15 20:19:38,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 343. [2023-12-15 20:19:38,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 237 states have (on average 1.2869198312236287) internal successors, (305), 239 states have internal predecessors, (305), 94 states have call successors, (94), 11 states have call predecessors, (94), 11 states have return successors, (94), 92 states have call predecessors, (94), 94 states have call successors, (94) [2023-12-15 20:19:38,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 493 transitions. [2023-12-15 20:19:38,522 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 493 transitions. Word has length 154 [2023-12-15 20:19:38,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:19:38,522 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 493 transitions. [2023-12-15 20:19:38,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-15 20:19:38,523 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 493 transitions. [2023-12-15 20:19:38,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-15 20:19:38,523 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:19:38,524 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:19:38,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-15 20:19:38,524 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:19:38,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:19:38,524 INFO L85 PathProgramCache]: Analyzing trace with hash -223065980, now seen corresponding path program 1 times [2023-12-15 20:19:38,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:19:38,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477923130] [2023-12-15 20:19:38,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:19:38,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:19:38,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:39,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:19:39,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:39,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:19:39,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:39,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:19:39,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:39,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:19:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:39,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:19:39,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:39,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:19:39,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:39,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:19:39,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:39,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:19:39,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:39,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:19:39,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:39,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:19:39,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:39,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:19:39,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:39,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-15 20:19:39,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:39,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-15 20:19:39,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:39,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 20:19:39,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:39,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 20:19:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:39,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-15 20:19:39,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:39,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-15 20:19:39,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:39,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-15 20:19:39,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:39,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-15 20:19:39,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:39,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 20:19:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:39,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 20:19:39,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:39,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-15 20:19:39,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:39,086 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-12-15 20:19:39,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:19:39,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477923130] [2023-12-15 20:19:39,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477923130] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:19:39,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:19:39,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 20:19:39,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858139327] [2023-12-15 20:19:39,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:19:39,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 20:19:39,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:19:39,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 20:19:39,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-15 20:19:39,087 INFO L87 Difference]: Start difference. First operand 343 states and 493 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2023-12-15 20:19:39,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:19:39,577 INFO L93 Difference]: Finished difference Result 640 states and 902 transitions. [2023-12-15 20:19:39,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 20:19:39,577 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 155 [2023-12-15 20:19:39,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:19:39,579 INFO L225 Difference]: With dead ends: 640 [2023-12-15 20:19:39,579 INFO L226 Difference]: Without dead ends: 371 [2023-12-15 20:19:39,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-12-15 20:19:39,580 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 247 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 20:19:39,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 227 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 20:19:39,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2023-12-15 20:19:39,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 348. [2023-12-15 20:19:39,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 247 states have (on average 1.263157894736842) internal successors, (312), 249 states have internal predecessors, (312), 84 states have call successors, (84), 16 states have call predecessors, (84), 16 states have return successors, (84), 82 states have call predecessors, (84), 84 states have call successors, (84) [2023-12-15 20:19:39,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 480 transitions. [2023-12-15 20:19:39,644 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 480 transitions. Word has length 155 [2023-12-15 20:19:39,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:19:39,645 INFO L495 AbstractCegarLoop]: Abstraction has 348 states and 480 transitions. [2023-12-15 20:19:39,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2023-12-15 20:19:39,645 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 480 transitions. [2023-12-15 20:19:39,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-15 20:19:39,646 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:19:39,646 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:19:39,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-15 20:19:39,647 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:19:39,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:19:39,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1502929658, now seen corresponding path program 1 times [2023-12-15 20:19:39,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:19:39,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875072617] [2023-12-15 20:19:39,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:19:39,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:19:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:39,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:19:39,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:39,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:19:39,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:39,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:19:39,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:39,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:19:39,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:39,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:19:39,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:39,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:19:39,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:39,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:19:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:39,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:19:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:39,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:19:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:39,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:19:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:39,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:19:39,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:39,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-15 20:19:39,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:39,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-15 20:19:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:39,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 20:19:39,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:39,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 20:19:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:39,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-15 20:19:39,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:39,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-15 20:19:39,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:39,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-15 20:19:39,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:39,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-15 20:19:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:39,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 20:19:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:39,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 20:19:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:39,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-15 20:19:39,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:39,840 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 51 proven. 12 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2023-12-15 20:19:39,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:19:39,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875072617] [2023-12-15 20:19:39,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875072617] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 20:19:39,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915552057] [2023-12-15 20:19:39,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:19:39,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:19:39,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:19:39,842 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-15 20:19:39,869 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-15 20:19:39,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:19:39,939 INFO L262 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-15 20:19:39,948 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:19:40,007 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 327 proven. 12 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2023-12-15 20:19:40,007 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 20:19:40,113 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 51 proven. 12 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2023-12-15 20:19:40,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915552057] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 20:19:40,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 20:19:40,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2023-12-15 20:19:40,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642958643] [2023-12-15 20:19:40,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 20:19:40,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 20:19:40,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:19:40,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 20:19:40,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-15 20:19:40,115 INFO L87 Difference]: Start difference. First operand 348 states and 480 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2023-12-15 20:19:40,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:19:40,277 INFO L93 Difference]: Finished difference Result 643 states and 873 transitions. [2023-12-15 20:19:40,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 20:19:40,278 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 155 [2023-12-15 20:19:40,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:19:40,281 INFO L225 Difference]: With dead ends: 643 [2023-12-15 20:19:40,281 INFO L226 Difference]: Without dead ends: 376 [2023-12-15 20:19:40,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 349 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-15 20:19:40,282 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 138 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:19:40,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 252 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:19:40,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2023-12-15 20:19:40,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 360. [2023-12-15 20:19:40,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 256 states have (on average 1.2421875) internal successors, (318), 258 states have internal predecessors, (318), 84 states have call successors, (84), 19 states have call predecessors, (84), 19 states have return successors, (84), 82 states have call predecessors, (84), 84 states have call successors, (84) [2023-12-15 20:19:40,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 486 transitions. [2023-12-15 20:19:40,335 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 486 transitions. Word has length 155 [2023-12-15 20:19:40,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:19:40,335 INFO L495 AbstractCegarLoop]: Abstraction has 360 states and 486 transitions. [2023-12-15 20:19:40,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2023-12-15 20:19:40,336 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 486 transitions. [2023-12-15 20:19:40,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-15 20:19:40,337 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:19:40,337 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:19:40,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-15 20:19:40,541 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,SelfDestructingSolverStorable10 [2023-12-15 20:19:40,541 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:19:40,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:19:40,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1244764220, now seen corresponding path program 1 times [2023-12-15 20:19:40,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:19:40,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247427554] [2023-12-15 20:19:40,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:19:40,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:19:40,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 20:19:40,577 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-15 20:19:40,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 20:19:40,652 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-15 20:19:40,652 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-15 20:19:40,653 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 20:19:40,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-15 20:19:40,656 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:19:40,658 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 20:19:40,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 08:19:40 BoogieIcfgContainer [2023-12-15 20:19:40,779 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 20:19:40,780 INFO L158 Benchmark]: Toolchain (without parser) took 8347.50ms. Allocated memory was 338.7MB in the beginning and 526.4MB in the end (delta: 187.7MB). Free memory was 286.4MB in the beginning and 483.6MB in the end (delta: -197.2MB). Peak memory consumption was 295.7MB. Max. memory is 8.0GB. [2023-12-15 20:19:40,780 INFO L158 Benchmark]: CDTParser took 0.86ms. Allocated memory is still 227.5MB. Free memory is still 177.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 20:19:40,780 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.08ms. Allocated memory is still 338.7MB. Free memory was 286.1MB in the beginning and 270.9MB in the end (delta: 15.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-15 20:19:40,780 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.47ms. Allocated memory is still 338.7MB. Free memory was 270.9MB in the beginning and 266.8MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-15 20:19:40,780 INFO L158 Benchmark]: Boogie Preprocessor took 41.71ms. Allocated memory is still 338.7MB. Free memory was 266.8MB in the beginning and 262.3MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-15 20:19:40,781 INFO L158 Benchmark]: RCFGBuilder took 480.84ms. Allocated memory is still 338.7MB. Free memory was 262.3MB in the beginning and 296.3MB in the end (delta: -34.0MB). Peak memory consumption was 23.7MB. Max. memory is 8.0GB. [2023-12-15 20:19:40,781 INFO L158 Benchmark]: TraceAbstraction took 7529.56ms. Allocated memory was 338.7MB in the beginning and 526.4MB in the end (delta: 187.7MB). Free memory was 295.8MB in the beginning and 483.6MB in the end (delta: -187.8MB). Peak memory consumption was 304.5MB. Max. memory is 8.0GB. [2023-12-15 20:19:40,783 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.86ms. Allocated memory is still 227.5MB. Free memory is still 177.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 245.08ms. Allocated memory is still 338.7MB. Free memory was 286.1MB in the beginning and 270.9MB in the end (delta: 15.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.47ms. Allocated memory is still 338.7MB. Free memory was 270.9MB in the beginning and 266.8MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.71ms. Allocated memory is still 338.7MB. Free memory was 266.8MB in the beginning and 262.3MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 480.84ms. Allocated memory is still 338.7MB. Free memory was 262.3MB in the beginning and 296.3MB in the end (delta: -34.0MB). Peak memory consumption was 23.7MB. Max. memory is 8.0GB. * TraceAbstraction took 7529.56ms. Allocated memory was 338.7MB in the beginning and 526.4MB in the end (delta: 187.7MB). Free memory was 295.8MB in the beginning and 483.6MB in the end (delta: -187.8MB). Peak memory consumption was 304.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 185, overapproximation of someBinaryArithmeticDOUBLEoperation at line 85. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 4; [L23] unsigned short int var_1_8 = 64; [L24] unsigned short int var_1_11 = 256; [L25] unsigned short int var_1_12 = 0; [L26] unsigned short int var_1_13 = 64; [L27] unsigned char var_1_14 = 1; [L28] unsigned char var_1_15 = 0; [L29] signed char var_1_16 = 50; [L30] signed char var_1_19 = -100; [L31] double var_1_20 = 100000000.8; [L32] double var_1_21 = 15.125; [L33] double var_1_22 = 99.22; [L34] signed long int var_1_23 = -16; [L35] unsigned char var_1_24 = 1; [L36] signed char var_1_25 = 10; [L37] signed char var_1_26 = 16; [L38] unsigned char var_1_27 = 0; [L39] double var_1_28 = 5.5; [L40] signed long int var_1_29 = 50; [L41] signed char var_1_31 = 4; [L42] unsigned short int var_1_33 = 16; [L43] unsigned char var_1_39 = 4; [L44] signed long int var_1_41 = -5; [L45] double var_1_42 = 49.6; [L46] signed long int var_1_45 = -2; [L47] unsigned long int var_1_47 = 16; [L48] unsigned long int var_1_50 = 1275815169; [L49] unsigned long int var_1_51 = 1483937619; [L50] signed short int last_1_var_1_1 = 4; [L51] unsigned char last_1_var_1_14 = 1; [L52] signed char last_1_var_1_16 = 50; [L53] signed long int last_1_var_1_23 = -16; [L54] unsigned char last_1_var_1_24 = 1; [L55] double last_1_var_1_28 = 5.5; [L189] isInitial = 1 [L190] FCALL initially() [L191] COND TRUE 1 [L192] CALL updateLastVariables() [L177] last_1_var_1_1 = var_1_1 [L178] last_1_var_1_14 = var_1_14 [L179] last_1_var_1_16 = var_1_16 [L180] last_1_var_1_23 = var_1_23 [L181] last_1_var_1_24 = var_1_24 [L182] last_1_var_1_28 = var_1_28 [L192] RET updateLastVariables() [L193] CALL updateVariables() [L141] var_1_11 = __VERIFIER_nondet_ushort() [L142] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L142] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L143] CALL assume_abort_if_not(var_1_11 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L143] RET assume_abort_if_not(var_1_11 <= 32767) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L144] var_1_12 = __VERIFIER_nondet_ushort() [L145] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L145] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L146] CALL assume_abort_if_not(var_1_12 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L146] RET assume_abort_if_not(var_1_12 <= 32767) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L147] var_1_13 = __VERIFIER_nondet_ushort() [L148] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L148] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L149] CALL assume_abort_if_not(var_1_13 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L149] RET assume_abort_if_not(var_1_13 <= 65534) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L150] var_1_15 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L151] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L152] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L152] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L153] var_1_19 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_19 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L154] RET assume_abort_if_not(var_1_19 >= -127) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L155] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L155] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L156] var_1_21 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L157] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L158] var_1_22 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L159] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L160] var_1_25 = __VERIFIER_nondet_char() [L161] CALL assume_abort_if_not(var_1_25 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L161] RET assume_abort_if_not(var_1_25 >= -1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L162] CALL assume_abort_if_not(var_1_25 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L162] RET assume_abort_if_not(var_1_25 <= 127) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L163] var_1_26 = __VERIFIER_nondet_char() [L164] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L164] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L165] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L165] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L166] var_1_27 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L167] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L168] CALL assume_abort_if_not(var_1_27 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L168] RET assume_abort_if_not(var_1_27 <= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L169] var_1_50 = __VERIFIER_nondet_ulong() [L170] CALL assume_abort_if_not(var_1_50 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1483937619, var_1_8=64] [L170] RET assume_abort_if_not(var_1_50 >= 1073741823) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1483937619, var_1_8=64] [L171] CALL assume_abort_if_not(var_1_50 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1483937619, var_1_8=64] [L171] RET assume_abort_if_not(var_1_50 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1483937619, var_1_8=64] [L172] var_1_51 = __VERIFIER_nondet_ulong() [L173] CALL assume_abort_if_not(var_1_51 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L173] RET assume_abort_if_not(var_1_51 >= 1073741824) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L174] CALL assume_abort_if_not(var_1_51 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L174] RET assume_abort_if_not(var_1_51 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L193] RET updateVariables() [L194] CALL step() [L59] signed long int stepLocal_3 = last_1_var_1_23; [L60] unsigned char stepLocal_2 = ! (last_1_var_1_14 || last_1_var_1_14); VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, stepLocal_3=-16, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L61] COND FALSE !(last_1_var_1_23 < stepLocal_3) [L72] var_1_16 = 100 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, stepLocal_3=-16, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L74] COND FALSE !(1000000.4f != var_1_22) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, stepLocal_3=-16, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L79] EXPR ((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, stepLocal_3=-16, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L79] COND TRUE (((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16) >= last_1_var_1_23 [L80] var_1_23 = (5 - var_1_12) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, stepLocal_3=-16, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=1, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L84] var_1_39 = var_1_26 [L85] var_1_20 = (var_1_21 - (var_1_22 + 1.5)) [L86] var_1_29 = var_1_12 [L87] var_1_31 = var_1_19 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, stepLocal_3=-16, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=4, var_1_23=1, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=4, var_1_31=126, var_1_33=16, var_1_39=0, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L88] COND FALSE !(var_1_12 != var_1_1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, stepLocal_3=-16, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=4, var_1_23=1, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=4, var_1_31=126, var_1_33=16, var_1_39=0, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L93] var_1_28 = var_1_21 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, stepLocal_3=-16, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=4, var_1_21=2147483652, var_1_23=1, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=4, var_1_31=126, var_1_33=16, var_1_39=0, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L94] COND FALSE !(var_1_21 < var_1_21) [L107] var_1_47 = var_1_23 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, stepLocal_3=-16, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=4, var_1_21=2147483652, var_1_23=1, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=4, var_1_31=126, var_1_33=16, var_1_39=0, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=1, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L109] unsigned char stepLocal_0 = var_1_23 > 4; VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_0=0, stepLocal_2=0, stepLocal_3=-16, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=4, var_1_21=2147483652, var_1_23=1, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=4, var_1_31=126, var_1_33=16, var_1_39=0, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=1, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L110] COND TRUE (var_1_23 <= var_1_23) || stepLocal_0 [L111] var_1_1 = (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_0=0, stepLocal_2=0, stepLocal_3=-16, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=4, var_1_31=126, var_1_33=16, var_1_39=0, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=1, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L115] var_1_24 = ((var_1_1 <= (var_1_25 - var_1_26)) && var_1_27) [L116] signed char stepLocal_1 = var_1_16; VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_0=0, stepLocal_1=100, stepLocal_2=0, stepLocal_3=-16, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=4, var_1_31=126, var_1_33=16, var_1_39=0, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=1, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L117] EXPR var_1_16 ^ var_1_16 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_0=0, stepLocal_1=100, stepLocal_2=0, stepLocal_3=-16, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=4, var_1_31=126, var_1_33=16, var_1_39=0, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=1, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L117] COND TRUE stepLocal_1 > (var_1_23 + (var_1_16 ^ var_1_16)) [L118] var_1_14 = (var_1_24 || var_1_15) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_0=0, stepLocal_1=100, stepLocal_2=0, stepLocal_3=-16, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=4, var_1_31=126, var_1_33=16, var_1_39=0, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=1, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L120] COND TRUE \read(var_1_14) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_0=0, stepLocal_1=100, stepLocal_2=0, stepLocal_3=-16, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=4, var_1_31=126, var_1_33=16, var_1_39=0, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=1, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L121] COND FALSE !(\read(var_1_24)) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_0=0, stepLocal_1=100, stepLocal_2=0, stepLocal_3=-16, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=4, var_1_31=126, var_1_33=16, var_1_39=0, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=1, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L125] COND TRUE \read(var_1_15) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_0=0, stepLocal_1=100, stepLocal_2=0, stepLocal_3=-16, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=4, var_1_31=126, var_1_33=16, var_1_39=0, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=1, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L126] COND TRUE var_1_11 < var_1_19 [L127] var_1_33 = ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_0=0, stepLocal_1=100, stepLocal_2=0, stepLocal_3=-16, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=4, var_1_31=126, var_1_33=0, var_1_39=0, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=1, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L134] COND FALSE !(var_1_14 && var_1_27) [L137] var_1_45 = ((var_1_19 + var_1_23) + var_1_26) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_0=0, stepLocal_1=100, stepLocal_2=0, stepLocal_3=-16, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=4, var_1_31=126, var_1_33=0, var_1_39=0, var_1_41=-5, var_1_42=248/5, var_1_45=127, var_1_47=1, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L194] RET step() [L195] CALL, EXPR property() [L185] EXPR ((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=4, var_1_31=126, var_1_33=0, var_1_39=0, var_1_41=-5, var_1_42=248/5, var_1_45=127, var_1_47=1, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L185] EXPR var_1_16 ^ var_1_16 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=4, var_1_31=126, var_1_33=0, var_1_39=0, var_1_41=-5, var_1_42=248/5, var_1_45=127, var_1_47=1, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L185] EXPR ((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=4, var_1_31=126, var_1_33=0, var_1_39=0, var_1_41=-5, var_1_42=248/5, var_1_45=127, var_1_47=1, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L185] EXPR (((((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1)) && ((last_1_var_1_23 < last_1_var_1_23) ? (((! (last_1_var_1_14 || last_1_var_1_14)) && last_1_var_1_24) ? ((((((2.75f) > (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f))))) ? (2.75f) : (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f)))))) != last_1_var_1_28) ? (var_1_16 == ((signed char) 10)) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) 100)))) && (var_1_20 == ((double) (var_1_21 - (var_1_22 + 1.5))))) && (((((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16) >= last_1_var_1_23) ? (var_1_23 == ((signed long int) (5 - var_1_12))) : (var_1_23 == ((signed long int) ((((var_1_11) > (last_1_var_1_1)) ? (var_1_11) : (last_1_var_1_1)))))) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=4, var_1_31=126, var_1_33=0, var_1_39=0, var_1_41=-5, var_1_42=248/5, var_1_45=127, var_1_47=1, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L185-L186] return (((((((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1)) && ((last_1_var_1_23 < last_1_var_1_23) ? (((! (last_1_var_1_14 || last_1_var_1_14)) && last_1_var_1_24) ? ((((((2.75f) > (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f))))) ? (2.75f) : (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f)))))) != last_1_var_1_28) ? (var_1_16 == ((signed char) 10)) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) 100)))) && (var_1_20 == ((double) (var_1_21 - (var_1_22 + 1.5))))) && (((((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16) >= last_1_var_1_23) ? (var_1_23 == ((signed long int) (5 - var_1_12))) : (var_1_23 == ((signed long int) ((((var_1_11) > (last_1_var_1_1)) ? (var_1_11) : (last_1_var_1_1))))))) && (var_1_24 == ((unsigned char) ((var_1_1 <= (var_1_25 - var_1_26)) && var_1_27)))) && (var_1_28 == ((double) var_1_21)) ; [L195] RET, EXPR property() [L195] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=4, var_1_31=126, var_1_33=0, var_1_39=0, var_1_41=-5, var_1_42=248/5, var_1_45=127, var_1_47=1, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=4, var_1_31=126, var_1_33=0, var_1_39=0, var_1_41=-5, var_1_42=248/5, var_1_45=127, var_1_47=1, var_1_50=2147483647, var_1_51=1073741824, var_1_8=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 91 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.4s, OverallIterations: 12, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1345 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1323 mSDsluCounter, 3822 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2156 mSDsCounter, 323 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1362 IncrementalHoareTripleChecker+Invalid, 1685 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 323 mSolverCounterUnsat, 1666 mSDtfsCounter, 1362 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1195 GetRequests, 1138 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=360occurred in iteration=11, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 198 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 2131 NumberOfCodeBlocks, 2131 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2270 ConstructedInterpolants, 0 QuantifiedInterpolants, 6438 SizeOfPredicates, 6 NumberOfNonLiveVariables, 779 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 13689/13860 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-15 20:19:40,808 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...