/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_floatingpointinfluence_has-floats_file-56.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 10:32:31,720 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 10:32:31,768 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-19 10:32:31,771 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 10:32:31,771 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 10:32:31,785 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 10:32:31,785 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 10:32:31,785 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 10:32:31,786 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 10:32:31,786 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 10:32:31,786 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 10:32:31,787 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 10:32:31,787 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 10:32:31,787 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 10:32:31,788 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 10:32:31,788 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 10:32:31,788 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 10:32:31,788 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 10:32:31,789 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 10:32:31,789 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 10:32:31,789 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 10:32:31,800 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 10:32:31,801 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 10:32:31,801 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 10:32:31,801 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 10:32:31,801 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 10:32:31,802 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 10:32:31,802 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 10:32:31,802 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 10:32:31,802 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 10:32:31,803 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 10:32:31,803 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 10:32:31,803 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 10:32:31,804 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 10:32:31,804 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 10:32:31,804 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 10:32:31,804 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 10:32:31,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 10:32:31,805 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 10:32:31,805 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 10:32:31,805 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 10:32:31,806 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 10:32:31,806 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 10:32:31,806 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-19 10:32:31,975 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 10:32:31,996 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 10:32:31,998 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 10:32:31,999 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 10:32:32,000 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 10:32:32,001 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-56.i [2023-12-19 10:32:33,222 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 10:32:33,423 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 10:32:33,423 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-56.i [2023-12-19 10:32:33,429 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e8256cbb/24f9b717e28d45588f938f8f7bd33fda/FLAGc1ee9284b [2023-12-19 10:32:33,441 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e8256cbb/24f9b717e28d45588f938f8f7bd33fda [2023-12-19 10:32:33,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 10:32:33,443 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 10:32:33,444 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 10:32:33,444 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 10:32:33,451 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 10:32:33,452 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 10:32:33" (1/1) ... [2023-12-19 10:32:33,453 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7be00d8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:32:33, skipping insertion in model container [2023-12-19 10:32:33,453 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 10:32:33" (1/1) ... [2023-12-19 10:32:33,484 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 10:32:33,613 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_floatingpointinfluence_has-floats_file-56.i[917,930] [2023-12-19 10:32:33,671 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 10:32:33,686 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 10:32:33,697 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_floatingpointinfluence_has-floats_file-56.i[917,930] [2023-12-19 10:32:33,726 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 10:32:33,748 INFO L206 MainTranslator]: Completed translation [2023-12-19 10:32:33,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:32:33 WrapperNode [2023-12-19 10:32:33,751 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 10:32:33,752 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 10:32:33,753 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 10:32:33,753 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 10:32:33,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:32:33" (1/1) ... [2023-12-19 10:32:33,778 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:32:33" (1/1) ... [2023-12-19 10:32:33,809 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 148 [2023-12-19 10:32:33,809 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 10:32:33,810 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 10:32:33,810 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 10:32:33,810 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 10:32:33,818 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:32:33" (1/1) ... [2023-12-19 10:32:33,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:32:33" (1/1) ... [2023-12-19 10:32:33,820 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:32:33" (1/1) ... [2023-12-19 10:32:33,831 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-19 10:32:33,831 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:32:33" (1/1) ... [2023-12-19 10:32:33,832 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:32:33" (1/1) ... [2023-12-19 10:32:33,838 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:32:33" (1/1) ... [2023-12-19 10:32:33,840 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:32:33" (1/1) ... [2023-12-19 10:32:33,841 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:32:33" (1/1) ... [2023-12-19 10:32:33,843 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:32:33" (1/1) ... [2023-12-19 10:32:33,849 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 10:32:33,849 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 10:32:33,849 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 10:32:33,850 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 10:32:33,850 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:32:33" (1/1) ... [2023-12-19 10:32:33,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 10:32:33,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 10:32:33,890 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-19 10:32:33,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-19 10:32:33,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 10:32:33,929 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 10:32:33,929 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 10:32:33,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 10:32:33,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 10:32:33,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 10:32:34,010 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 10:32:34,013 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 10:32:34,400 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 10:32:34,422 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 10:32:34,423 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 10:32:34,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 10:32:34 BoogieIcfgContainer [2023-12-19 10:32:34,423 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 10:32:34,425 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 10:32:34,425 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 10:32:34,427 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 10:32:34,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 10:32:33" (1/3) ... [2023-12-19 10:32:34,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@391d51a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 10:32:34, skipping insertion in model container [2023-12-19 10:32:34,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:32:33" (2/3) ... [2023-12-19 10:32:34,439 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@391d51a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 10:32:34, skipping insertion in model container [2023-12-19 10:32:34,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 10:32:34" (3/3) ... [2023-12-19 10:32:34,441 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-56.i [2023-12-19 10:32:34,453 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 10:32:34,453 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 10:32:34,491 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 10:32:34,496 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;@5ec941cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 10:32:34,497 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 10:32:34,500 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 40 states have internal predecessors, (58), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-19 10:32:34,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-19 10:32:34,509 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:32:34,509 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:32:34,509 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:32:34,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:32:34,513 INFO L85 PathProgramCache]: Analyzing trace with hash 340055048, now seen corresponding path program 1 times [2023-12-19 10:32:34,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:32:34,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731601350] [2023-12-19 10:32:34,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:32:34,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:32:34,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:34,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:32:34,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:34,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:32:34,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:34,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:32:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:34,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:32:34,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:34,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:32:34,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:34,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:32:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:34,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:32:34,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:34,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:32:34,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:34,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:32:34,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:34,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:32:34,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:34,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:32:34,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:34,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:32:34,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:34,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 10:32:34,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:34,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 10:32:34,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:34,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 10:32:34,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:34,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-19 10:32:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:34,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-19 10:32:34,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:34,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-19 10:32:34,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:34,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 10:32:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:34,910 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 10:32:34,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:32:34,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731601350] [2023-12-19 10:32:34,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731601350] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:32:34,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:32:34,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 10:32:34,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330003161] [2023-12-19 10:32:34,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:32:34,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 10:32:34,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:32:34,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 10:32:34,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 10:32:34,937 INFO L87 Difference]: Start difference. First operand has 61 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 40 states have internal predecessors, (58), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 10:32:35,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:32:35,018 INFO L93 Difference]: Finished difference Result 143 states and 249 transitions. [2023-12-19 10:32:35,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 10:32:35,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 120 [2023-12-19 10:32:35,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:32:35,031 INFO L225 Difference]: With dead ends: 143 [2023-12-19 10:32:35,031 INFO L226 Difference]: Without dead ends: 83 [2023-12-19 10:32:35,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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-19 10:32:35,036 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 29 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 10:32:35,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 155 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 10:32:35,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-12-19 10:32:35,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 71. [2023-12-19 10:32:35,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 50 states have (on average 1.48) internal successors, (74), 50 states have internal predecessors, (74), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-19 10:32:35,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 112 transitions. [2023-12-19 10:32:35,074 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 112 transitions. Word has length 120 [2023-12-19 10:32:35,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:32:35,075 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 112 transitions. [2023-12-19 10:32:35,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 10:32:35,076 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 112 transitions. [2023-12-19 10:32:35,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-19 10:32:35,078 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:32:35,078 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:32:35,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 10:32:35,078 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:32:35,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:32:35,079 INFO L85 PathProgramCache]: Analyzing trace with hash 282796746, now seen corresponding path program 1 times [2023-12-19 10:32:35,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:32:35,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150977326] [2023-12-19 10:32:35,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:32:35,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:32:35,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:41,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:32:41,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:41,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:32:41,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:41,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:32:41,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:41,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:32:41,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:41,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:32:41,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:41,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:32:41,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:41,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:32:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:41,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:32:41,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:41,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:32:41,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:41,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:32:41,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:41,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:32:41,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:41,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:32:41,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:41,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 10:32:41,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:41,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 10:32:41,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:41,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 10:32:41,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:41,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-19 10:32:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:41,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-19 10:32:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:41,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-19 10:32:41,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:41,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 10:32:41,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:41,576 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 10:32:41,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:32:41,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150977326] [2023-12-19 10:32:41,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150977326] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:32:41,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:32:41,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-19 10:32:41,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531337793] [2023-12-19 10:32:41,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:32:41,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 10:32:41,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:32:41,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 10:32:41,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-12-19 10:32:41,579 INFO L87 Difference]: Start difference. First operand 71 states and 112 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 10:32:42,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:32:42,678 INFO L93 Difference]: Finished difference Result 340 states and 514 transitions. [2023-12-19 10:32:42,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-19 10:32:42,679 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 120 [2023-12-19 10:32:42,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:32:42,684 INFO L225 Difference]: With dead ends: 340 [2023-12-19 10:32:42,685 INFO L226 Difference]: Without dead ends: 270 [2023-12-19 10:32:42,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2023-12-19 10:32:42,687 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 341 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 10:32:42,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 574 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 10:32:42,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2023-12-19 10:32:42,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 190. [2023-12-19 10:32:42,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 149 states have (on average 1.5100671140939597) internal successors, (225), 149 states have internal predecessors, (225), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-19 10:32:42,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 301 transitions. [2023-12-19 10:32:42,723 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 301 transitions. Word has length 120 [2023-12-19 10:32:42,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:32:42,725 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 301 transitions. [2023-12-19 10:32:42,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 10:32:42,726 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 301 transitions. [2023-12-19 10:32:42,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-19 10:32:42,730 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:32:42,730 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:32:42,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 10:32:42,731 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:32:42,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:32:42,731 INFO L85 PathProgramCache]: Analyzing trace with hash 540962184, now seen corresponding path program 1 times [2023-12-19 10:32:42,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:32:42,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930976452] [2023-12-19 10:32:42,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:32:42,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:32:42,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:42,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:32:42,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:42,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:32:42,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:42,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:32:42,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:42,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:32:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:42,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:32:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:42,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:32:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:42,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:32:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:42,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:32:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:42,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:32:42,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:42,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:32:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:42,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:32:42,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:42,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:32:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:42,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 10:32:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:42,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 10:32:42,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:42,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 10:32:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:42,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-19 10:32:42,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:42,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-19 10:32:42,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:42,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-19 10:32:42,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:42,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 10:32:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:42,846 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 10:32:42,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:32:42,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930976452] [2023-12-19 10:32:42,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930976452] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:32:42,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:32:42,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 10:32:42,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330838952] [2023-12-19 10:32:42,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:32:42,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 10:32:42,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:32:42,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 10:32:42,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 10:32:42,856 INFO L87 Difference]: Start difference. First operand 190 states and 301 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 10:32:42,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:32:42,888 INFO L93 Difference]: Finished difference Result 364 states and 575 transitions. [2023-12-19 10:32:42,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 10:32:42,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 120 [2023-12-19 10:32:42,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:32:42,892 INFO L225 Difference]: With dead ends: 364 [2023-12-19 10:32:42,892 INFO L226 Difference]: Without dead ends: 175 [2023-12-19 10:32:42,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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-19 10:32:42,897 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 10:32:42,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 10:32:42,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-12-19 10:32:42,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2023-12-19 10:32:42,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 134 states have (on average 1.4701492537313432) internal successors, (197), 134 states have internal predecessors, (197), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-19 10:32:42,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 273 transitions. [2023-12-19 10:32:42,939 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 273 transitions. Word has length 120 [2023-12-19 10:32:42,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:32:42,939 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 273 transitions. [2023-12-19 10:32:42,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 10:32:42,940 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 273 transitions. [2023-12-19 10:32:42,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-19 10:32:42,943 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:32:42,944 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:32:42,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 10:32:42,944 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:32:42,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:32:42,945 INFO L85 PathProgramCache]: Analyzing trace with hash -246750966, now seen corresponding path program 1 times [2023-12-19 10:32:42,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:32:42,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008946618] [2023-12-19 10:32:42,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:32:42,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:32:42,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:42,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:32:42,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:42,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:32:42,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:43,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:32:43,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:43,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:32:43,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:43,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:32:43,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:43,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:32:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:43,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:32:43,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:43,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:32:43,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:43,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:32:43,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:43,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:32:43,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:43,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:32:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:43,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:32:43,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:43,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 10:32:43,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:43,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 10:32:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:43,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 10:32:43,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:43,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-19 10:32:43,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:43,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-19 10:32:43,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:43,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-19 10:32:43,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:43,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 10:32:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:32:43,047 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 10:32:43,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:32:43,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008946618] [2023-12-19 10:32:43,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008946618] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:32:43,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:32:43,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 10:32:43,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069215100] [2023-12-19 10:32:43,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:32:43,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 10:32:43,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:32:43,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 10:32:43,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 10:32:43,049 INFO L87 Difference]: Start difference. First operand 175 states and 273 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 10:32:43,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:32:43,067 INFO L93 Difference]: Finished difference Result 349 states and 545 transitions. [2023-12-19 10:32:43,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 10:32:43,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 120 [2023-12-19 10:32:43,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:32:43,068 INFO L225 Difference]: With dead ends: 349 [2023-12-19 10:32:43,068 INFO L226 Difference]: Without dead ends: 175 [2023-12-19 10:32:43,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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-19 10:32:43,069 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 10:32:43,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 10:32:43,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-12-19 10:32:43,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2023-12-19 10:32:43,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 134 states have (on average 1.455223880597015) internal successors, (195), 134 states have internal predecessors, (195), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-19 10:32:43,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 271 transitions. [2023-12-19 10:32:43,079 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 271 transitions. Word has length 120 [2023-12-19 10:32:43,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:32:43,079 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 271 transitions. [2023-12-19 10:32:43,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 10:32:43,079 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 271 transitions. [2023-12-19 10:32:43,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-19 10:32:43,080 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:32:43,080 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:32:43,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 10:32:43,081 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:32:43,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:32:43,081 INFO L85 PathProgramCache]: Analyzing trace with hash 11414472, now seen corresponding path program 1 times [2023-12-19 10:32:43,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:32:43,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39915777] [2023-12-19 10:32:43,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:32:43,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:32:43,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:13,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:33:13,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:13,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:33:13,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:13,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:33:13,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:13,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:33:13,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:13,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:33:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:13,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:33:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:13,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:33:13,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:13,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:33:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:13,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:33:13,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:13,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:33:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:13,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:33:13,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:13,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:33:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:13,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 10:33:13,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:13,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 10:33:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:13,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 10:33:13,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:13,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-19 10:33:13,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:13,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-19 10:33:13,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:13,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-19 10:33:13,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:13,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 10:33:13,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:13,928 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 10:33:13,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:33:13,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39915777] [2023-12-19 10:33:13,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39915777] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:33:13,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:33:13,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 10:33:13,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111461718] [2023-12-19 10:33:13,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:33:13,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 10:33:13,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:33:13,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 10:33:13,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-19 10:33:13,937 INFO L87 Difference]: Start difference. First operand 175 states and 271 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 10:33:15,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:33:15,723 INFO L93 Difference]: Finished difference Result 320 states and 484 transitions. [2023-12-19 10:33:15,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-19 10:33:15,724 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 120 [2023-12-19 10:33:15,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:33:15,726 INFO L225 Difference]: With dead ends: 320 [2023-12-19 10:33:15,726 INFO L226 Difference]: Without dead ends: 250 [2023-12-19 10:33:15,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2023-12-19 10:33:15,727 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 159 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-19 10:33:15,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 315 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-19 10:33:15,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2023-12-19 10:33:15,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 188. [2023-12-19 10:33:15,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 147 states have (on average 1.469387755102041) internal successors, (216), 147 states have internal predecessors, (216), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-19 10:33:15,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 292 transitions. [2023-12-19 10:33:15,738 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 292 transitions. Word has length 120 [2023-12-19 10:33:15,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:33:15,739 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 292 transitions. [2023-12-19 10:33:15,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 10:33:15,739 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 292 transitions. [2023-12-19 10:33:15,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-19 10:33:15,740 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:33:15,740 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:33:15,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-19 10:33:15,741 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:33:15,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:33:15,741 INFO L85 PathProgramCache]: Analyzing trace with hash -45843830, now seen corresponding path program 1 times [2023-12-19 10:33:15,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:33:15,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324463934] [2023-12-19 10:33:15,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:33:15,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:33:15,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:15,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:33:15,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:15,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:33:15,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:15,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:33:15,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:15,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:33:15,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:15,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:33:15,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:15,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:33:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:15,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:33:15,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:15,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:33:15,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:15,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:33:15,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:15,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:33:15,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:15,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:33:15,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:15,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:33:15,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:15,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 10:33:15,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:15,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 10:33:15,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:15,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 10:33:15,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:15,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-19 10:33:15,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:15,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-19 10:33:15,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:15,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-19 10:33:15,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:15,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 10:33:15,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:15,802 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 10:33:15,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:33:15,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324463934] [2023-12-19 10:33:15,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324463934] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:33:15,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:33:15,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 10:33:15,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766863193] [2023-12-19 10:33:15,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:33:15,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 10:33:15,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:33:15,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 10:33:15,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 10:33:15,804 INFO L87 Difference]: Start difference. First operand 188 states and 292 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 10:33:15,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:33:15,834 INFO L93 Difference]: Finished difference Result 393 states and 605 transitions. [2023-12-19 10:33:15,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 10:33:15,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 120 [2023-12-19 10:33:15,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:33:15,836 INFO L225 Difference]: With dead ends: 393 [2023-12-19 10:33:15,836 INFO L226 Difference]: Without dead ends: 206 [2023-12-19 10:33:15,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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-19 10:33:15,837 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 28 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 10:33:15,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 180 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 10:33:15,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2023-12-19 10:33:15,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 176. [2023-12-19 10:33:15,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 135 states have (on average 1.4222222222222223) internal successors, (192), 135 states have internal predecessors, (192), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-19 10:33:15,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 268 transitions. [2023-12-19 10:33:15,848 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 268 transitions. Word has length 120 [2023-12-19 10:33:15,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:33:15,848 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 268 transitions. [2023-12-19 10:33:15,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 10:33:15,848 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 268 transitions. [2023-12-19 10:33:15,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-19 10:33:15,849 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:33:15,849 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:33:15,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 10:33:15,850 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:33:15,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:33:15,850 INFO L85 PathProgramCache]: Analyzing trace with hash 712479050, now seen corresponding path program 1 times [2023-12-19 10:33:15,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:33:15,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453231881] [2023-12-19 10:33:15,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:33:15,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:33:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:27,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:33:27,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:27,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:33:27,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:27,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:33:27,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:27,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:33:27,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:27,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:33:27,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:27,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:33:27,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:27,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:33:27,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:27,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:33:27,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:27,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:33:27,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:27,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:33:27,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:27,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:33:27,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:27,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:33:27,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:27,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 10:33:27,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:27,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 10:33:27,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:27,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 10:33:27,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:27,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-19 10:33:27,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:27,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-19 10:33:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:27,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-19 10:33:27,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:27,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 10:33:27,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:27,295 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 10:33:27,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:33:27,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453231881] [2023-12-19 10:33:27,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453231881] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:33:27,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:33:27,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 10:33:27,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739012680] [2023-12-19 10:33:27,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:33:27,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 10:33:27,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:33:27,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 10:33:27,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-19 10:33:27,298 INFO L87 Difference]: Start difference. First operand 176 states and 268 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 10:33:28,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:33:28,099 INFO L93 Difference]: Finished difference Result 395 states and 590 transitions. [2023-12-19 10:33:28,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-19 10:33:28,099 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 120 [2023-12-19 10:33:28,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:33:28,101 INFO L225 Difference]: With dead ends: 395 [2023-12-19 10:33:28,101 INFO L226 Difference]: Without dead ends: 220 [2023-12-19 10:33:28,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-12-19 10:33:28,102 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 97 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-19 10:33:28,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 259 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-19 10:33:28,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2023-12-19 10:33:28,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 173. [2023-12-19 10:33:28,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 132 states have (on average 1.3863636363636365) internal successors, (183), 132 states have internal predecessors, (183), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-19 10:33:28,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 259 transitions. [2023-12-19 10:33:28,112 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 259 transitions. Word has length 120 [2023-12-19 10:33:28,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:33:28,113 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 259 transitions. [2023-12-19 10:33:28,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 10:33:28,113 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 259 transitions. [2023-12-19 10:33:28,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-19 10:33:28,114 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:33:28,114 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:33:28,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-19 10:33:28,114 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:33:28,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:33:28,115 INFO L85 PathProgramCache]: Analyzing trace with hash 654431032, now seen corresponding path program 1 times [2023-12-19 10:33:28,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:33:28,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418609845] [2023-12-19 10:33:28,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:33:28,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:33:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:28,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:33:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:28,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:33:28,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:28,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:33:28,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:28,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:33:28,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:28,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:33:28,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:28,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:33:28,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:28,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:33:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:28,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:33:28,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:28,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:33:28,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:28,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:33:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:28,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:33:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:28,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:33:28,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:28,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 10:33:28,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:28,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 10:33:28,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:28,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 10:33:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:28,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-19 10:33:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:28,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-19 10:33:28,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:28,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-19 10:33:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:28,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 10:33:28,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:28,373 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 10:33:28,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:33:28,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418609845] [2023-12-19 10:33:28,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418609845] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:33:28,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:33:28,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 10:33:28,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416954764] [2023-12-19 10:33:28,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:33:28,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 10:33:28,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:33:28,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 10:33:28,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-19 10:33:28,375 INFO L87 Difference]: Start difference. First operand 173 states and 259 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 10:33:28,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:33:28,471 INFO L93 Difference]: Finished difference Result 311 states and 452 transitions. [2023-12-19 10:33:28,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 10:33:28,471 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 122 [2023-12-19 10:33:28,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:33:28,473 INFO L225 Difference]: With dead ends: 311 [2023-12-19 10:33:28,473 INFO L226 Difference]: Without dead ends: 309 [2023-12-19 10:33:28,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-12-19 10:33:28,475 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 75 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 10:33:28,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 451 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 10:33:28,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2023-12-19 10:33:28,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 305. [2023-12-19 10:33:28,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 232 states have (on average 1.3362068965517242) internal successors, (310), 234 states have internal predecessors, (310), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-19 10:33:28,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 446 transitions. [2023-12-19 10:33:28,504 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 446 transitions. Word has length 122 [2023-12-19 10:33:28,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:33:28,506 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 446 transitions. [2023-12-19 10:33:28,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 10:33:28,506 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 446 transitions. [2023-12-19 10:33:28,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-19 10:33:28,507 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:33:28,507 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:33:28,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-19 10:33:28,508 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:33:28,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:33:28,508 INFO L85 PathProgramCache]: Analyzing trace with hash 2114238005, now seen corresponding path program 1 times [2023-12-19 10:33:28,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:33:28,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450848294] [2023-12-19 10:33:28,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:33:28,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:33:28,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:28,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:33:28,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:28,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:33:28,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:28,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:33:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:28,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:33:28,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:28,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:33:28,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:28,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:33:28,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:28,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:33:28,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:28,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:33:28,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:28,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:33:28,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:28,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:33:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:28,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:33:28,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:28,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:33:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:28,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 10:33:28,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:28,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 10:33:28,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:28,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 10:33:28,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:28,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-19 10:33:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:28,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-19 10:33:28,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:28,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-19 10:33:28,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:28,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 10:33:28,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:28,606 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 10:33:28,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:33:28,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450848294] [2023-12-19 10:33:28,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450848294] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:33:28,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:33:28,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 10:33:28,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417375861] [2023-12-19 10:33:28,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:33:28,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 10:33:28,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:33:28,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 10:33:28,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 10:33:28,609 INFO L87 Difference]: Start difference. First operand 305 states and 446 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 10:33:28,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:33:28,670 INFO L93 Difference]: Finished difference Result 531 states and 771 transitions. [2023-12-19 10:33:28,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 10:33:28,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 122 [2023-12-19 10:33:28,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:33:28,674 INFO L225 Difference]: With dead ends: 531 [2023-12-19 10:33:28,674 INFO L226 Difference]: Without dead ends: 390 [2023-12-19 10:33:28,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 10:33:28,676 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 46 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 10:33:28,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 249 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 10:33:28,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2023-12-19 10:33:28,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 386. [2023-12-19 10:33:28,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 303 states have (on average 1.33003300330033) internal successors, (403), 307 states have internal predecessors, (403), 76 states have call successors, (76), 6 states have call predecessors, (76), 6 states have return successors, (76), 72 states have call predecessors, (76), 76 states have call successors, (76) [2023-12-19 10:33:28,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 555 transitions. [2023-12-19 10:33:28,702 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 555 transitions. Word has length 122 [2023-12-19 10:33:28,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:33:28,703 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 555 transitions. [2023-12-19 10:33:28,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 10:33:28,703 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 555 transitions. [2023-12-19 10:33:28,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-19 10:33:28,704 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:33:28,704 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:33:28,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-19 10:33:28,704 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:33:28,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:33:28,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1304891379, now seen corresponding path program 1 times [2023-12-19 10:33:28,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:33:28,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81024448] [2023-12-19 10:33:28,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:33:28,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:33:28,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:50,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:33:50,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:50,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:33:50,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:50,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:33:50,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:50,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:33:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:50,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:33:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:50,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:33:50,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:50,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:33:50,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:50,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:33:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:50,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:33:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:50,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:33:50,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:50,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:33:50,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:50,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:33:50,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:50,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 10:33:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:50,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 10:33:50,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:50,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 10:33:50,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:50,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-19 10:33:50,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:50,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-19 10:33:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:50,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-19 10:33:50,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:50,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 10:33:50,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:50,511 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 10:33:50,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:33:50,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81024448] [2023-12-19 10:33:50,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81024448] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:33:50,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:33:50,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 10:33:50,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207552188] [2023-12-19 10:33:50,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:33:50,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 10:33:50,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:33:50,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 10:33:50,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-19 10:33:50,513 INFO L87 Difference]: Start difference. First operand 386 states and 555 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 10:33:51,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:33:51,059 INFO L93 Difference]: Finished difference Result 710 states and 1000 transitions. [2023-12-19 10:33:51,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 10:33:51,060 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 122 [2023-12-19 10:33:51,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:33:51,062 INFO L225 Difference]: With dead ends: 710 [2023-12-19 10:33:51,062 INFO L226 Difference]: Without dead ends: 488 [2023-12-19 10:33:51,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2023-12-19 10:33:51,064 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 112 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 10:33:51,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 244 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 10:33:51,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2023-12-19 10:33:51,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 386. [2023-12-19 10:33:51,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 303 states have (on average 1.3102310231023102) internal successors, (397), 307 states have internal predecessors, (397), 76 states have call successors, (76), 6 states have call predecessors, (76), 6 states have return successors, (76), 72 states have call predecessors, (76), 76 states have call successors, (76) [2023-12-19 10:33:51,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 549 transitions. [2023-12-19 10:33:51,090 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 549 transitions. Word has length 122 [2023-12-19 10:33:51,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:33:51,090 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 549 transitions. [2023-12-19 10:33:51,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 10:33:51,090 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 549 transitions. [2023-12-19 10:33:51,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-19 10:33:51,092 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:33:51,092 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:33:51,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-19 10:33:51,092 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:33:51,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:33:51,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1527431991, now seen corresponding path program 1 times [2023-12-19 10:33:51,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:33:51,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991685708] [2023-12-19 10:33:51,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:33:51,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:33:51,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:51,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:33:51,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:51,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:33:51,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:51,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:33:51,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:51,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:33:51,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:51,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:33:51,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:51,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:33:51,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:51,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:33:51,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:51,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:33:51,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:51,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:33:51,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:51,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:33:51,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:51,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:33:51,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:51,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:33:51,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:51,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 10:33:51,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:51,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 10:33:51,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:51,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 10:33:51,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:51,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-19 10:33:51,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:51,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-19 10:33:51,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:51,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-19 10:33:51,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:51,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 10:33:51,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:51,240 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2023-12-19 10:33:51,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:33:51,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991685708] [2023-12-19 10:33:51,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991685708] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 10:33:51,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990679569] [2023-12-19 10:33:51,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:33:51,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 10:33:51,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 10:33:51,262 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 10:33:51,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-19 10:33:51,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:51,354 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-19 10:33:51,361 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 10:33:51,420 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 178 proven. 6 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2023-12-19 10:33:51,420 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 10:33:51,523 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2023-12-19 10:33:51,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990679569] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 10:33:51,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 10:33:51,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2023-12-19 10:33:51,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446229222] [2023-12-19 10:33:51,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 10:33:51,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 10:33:51,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:33:51,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 10:33:51,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-19 10:33:51,525 INFO L87 Difference]: Start difference. First operand 386 states and 549 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2023-12-19 10:33:51,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:33:51,835 INFO L93 Difference]: Finished difference Result 934 states and 1328 transitions. [2023-12-19 10:33:51,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-19 10:33:51,835 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 122 [2023-12-19 10:33:51,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:33:51,839 INFO L225 Difference]: With dead ends: 934 [2023-12-19 10:33:51,839 INFO L226 Difference]: Without dead ends: 549 [2023-12-19 10:33:51,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 277 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2023-12-19 10:33:51,840 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 238 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 10:33:51,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 201 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 10:33:51,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2023-12-19 10:33:51,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 366. [2023-12-19 10:33:51,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 281 states have (on average 1.2704626334519573) internal successors, (357), 285 states have internal predecessors, (357), 76 states have call successors, (76), 8 states have call predecessors, (76), 8 states have return successors, (76), 72 states have call predecessors, (76), 76 states have call successors, (76) [2023-12-19 10:33:51,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 509 transitions. [2023-12-19 10:33:51,894 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 509 transitions. Word has length 122 [2023-12-19 10:33:51,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:33:51,895 INFO L495 AbstractCegarLoop]: Abstraction has 366 states and 509 transitions. [2023-12-19 10:33:51,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2023-12-19 10:33:51,895 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 509 transitions. [2023-12-19 10:33:51,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-19 10:33:51,896 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:33:51,896 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:33:51,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-19 10:33:52,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-19 10:33:52,106 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:33:52,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:33:52,106 INFO L85 PathProgramCache]: Analyzing trace with hash 2120821086, now seen corresponding path program 1 times [2023-12-19 10:33:52,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:33:52,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085285881] [2023-12-19 10:33:52,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:33:52,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:33:52,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:52,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:33:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:52,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:33:52,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:52,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:33:52,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:52,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:33:52,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:52,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:33:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:52,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:33:52,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:52,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:33:52,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:52,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:33:52,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:52,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:33:52,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:52,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:33:52,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:52,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:33:52,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:52,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:33:52,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:52,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 10:33:52,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:52,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 10:33:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:52,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 10:33:52,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:52,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-19 10:33:52,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:52,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-19 10:33:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:52,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-19 10:33:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:52,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 10:33:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:52,190 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 10:33:52,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:33:52,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085285881] [2023-12-19 10:33:52,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085285881] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:33:52,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:33:52,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 10:33:52,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086638068] [2023-12-19 10:33:52,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:33:52,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 10:33:52,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:33:52,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 10:33:52,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 10:33:52,192 INFO L87 Difference]: Start difference. First operand 366 states and 509 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 10:33:52,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:33:52,239 INFO L93 Difference]: Finished difference Result 845 states and 1158 transitions. [2023-12-19 10:33:52,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 10:33:52,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 124 [2023-12-19 10:33:52,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:33:52,241 INFO L225 Difference]: With dead ends: 845 [2023-12-19 10:33:52,241 INFO L226 Difference]: Without dead ends: 480 [2023-12-19 10:33:52,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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-19 10:33:52,243 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 48 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 10:33:52,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 192 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 10:33:52,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2023-12-19 10:33:52,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 476. [2023-12-19 10:33:52,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 362 states have (on average 1.207182320441989) internal successors, (437), 369 states have internal predecessors, (437), 100 states have call successors, (100), 13 states have call predecessors, (100), 13 states have return successors, (100), 93 states have call predecessors, (100), 100 states have call successors, (100) [2023-12-19 10:33:52,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 637 transitions. [2023-12-19 10:33:52,280 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 637 transitions. Word has length 124 [2023-12-19 10:33:52,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:33:52,281 INFO L495 AbstractCegarLoop]: Abstraction has 476 states and 637 transitions. [2023-12-19 10:33:52,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 10:33:52,281 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 637 transitions. [2023-12-19 10:33:52,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-19 10:33:52,282 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:33:52,282 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:33:52,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-19 10:33:52,282 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:33:52,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:33:52,282 INFO L85 PathProgramCache]: Analyzing trace with hash 2142281939, now seen corresponding path program 1 times [2023-12-19 10:33:52,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:33:52,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689771624] [2023-12-19 10:33:52,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:33:52,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:33:52,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:52,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:33:52,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:52,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:33:52,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:52,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:33:52,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:52,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:33:52,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:52,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:33:52,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:52,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:33:52,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:52,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:33:52,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:52,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:33:52,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:52,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:33:52,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:52,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:33:52,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:52,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:33:52,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:52,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:33:52,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:52,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 10:33:52,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:52,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 10:33:52,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:52,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-19 10:33:52,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:52,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-19 10:33:52,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:52,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-19 10:33:52,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:52,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-19 10:33:52,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:52,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-19 10:33:52,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:33:52,359 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-19 10:33:52,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:33:52,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689771624] [2023-12-19 10:33:52,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689771624] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:33:52,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:33:52,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 10:33:52,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446155358] [2023-12-19 10:33:52,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:33:52,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 10:33:52,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:33:52,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 10:33:52,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 10:33:52,361 INFO L87 Difference]: Start difference. First operand 476 states and 637 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 10:33:52,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:33:52,429 INFO L93 Difference]: Finished difference Result 963 states and 1282 transitions. [2023-12-19 10:33:52,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 10:33:52,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 124 [2023-12-19 10:33:52,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:33:52,433 INFO L225 Difference]: With dead ends: 963 [2023-12-19 10:33:52,433 INFO L226 Difference]: Without dead ends: 488 [2023-12-19 10:33:52,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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-19 10:33:52,434 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 37 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 10:33:52,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 170 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 10:33:52,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2023-12-19 10:33:52,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 423. [2023-12-19 10:33:52,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 334 states have (on average 1.2035928143712575) internal successors, (402), 338 states have internal predecessors, (402), 76 states have call successors, (76), 12 states have call predecessors, (76), 12 states have return successors, (76), 72 states have call predecessors, (76), 76 states have call successors, (76) [2023-12-19 10:33:52,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 554 transitions. [2023-12-19 10:33:52,463 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 554 transitions. Word has length 124 [2023-12-19 10:33:52,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:33:52,463 INFO L495 AbstractCegarLoop]: Abstraction has 423 states and 554 transitions. [2023-12-19 10:33:52,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-19 10:33:52,463 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 554 transitions. [2023-12-19 10:33:52,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-19 10:33:52,465 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:33:52,465 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:33:52,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-19 10:33:52,465 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:33:52,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:33:52,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1994202915, now seen corresponding path program 1 times [2023-12-19 10:33:52,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:33:52,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124787730] [2023-12-19 10:33:52,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:33:52,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:33:52,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 10:33:52,490 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 10:33:52,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 10:33:52,553 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 10:33:52,553 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 10:33:52,554 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 10:33:52,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-19 10:33:52,558 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:33:52,561 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 10:33:52,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 10:33:52 BoogieIcfgContainer [2023-12-19 10:33:52,631 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 10:33:52,631 INFO L158 Benchmark]: Toolchain (without parser) took 79187.98ms. Allocated memory was 233.8MB in the beginning and 1.0GB in the end (delta: 772.8MB). Free memory was 181.8MB in the beginning and 711.4MB in the end (delta: -529.6MB). Peak memory consumption was 244.0MB. Max. memory is 8.0GB. [2023-12-19 10:33:52,631 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 185.6MB. Free memory is still 134.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 10:33:52,632 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.16ms. Allocated memory is still 233.8MB. Free memory was 181.5MB in the beginning and 168.2MB in the end (delta: 13.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-19 10:33:52,632 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.04ms. Allocated memory is still 233.8MB. Free memory was 168.2MB in the beginning and 164.4MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-19 10:33:52,632 INFO L158 Benchmark]: Boogie Preprocessor took 38.86ms. Allocated memory is still 233.8MB. Free memory was 164.4MB in the beginning and 159.2MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-19 10:33:52,633 INFO L158 Benchmark]: RCFGBuilder took 573.91ms. Allocated memory is still 233.8MB. Free memory was 159.1MB in the beginning and 185.5MB in the end (delta: -26.4MB). Peak memory consumption was 14.5MB. Max. memory is 8.0GB. [2023-12-19 10:33:52,633 INFO L158 Benchmark]: TraceAbstraction took 78206.23ms. Allocated memory was 233.8MB in the beginning and 1.0GB in the end (delta: 772.8MB). Free memory was 185.0MB in the beginning and 711.4MB in the end (delta: -526.4MB). Peak memory consumption was 246.3MB. Max. memory is 8.0GB. [2023-12-19 10:33:52,634 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.13ms. Allocated memory is still 185.6MB. Free memory is still 134.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 307.16ms. Allocated memory is still 233.8MB. Free memory was 181.5MB in the beginning and 168.2MB in the end (delta: 13.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.04ms. Allocated memory is still 233.8MB. Free memory was 168.2MB in the beginning and 164.4MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.86ms. Allocated memory is still 233.8MB. Free memory was 164.4MB in the beginning and 159.2MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 573.91ms. Allocated memory is still 233.8MB. Free memory was 159.1MB in the beginning and 185.5MB in the end (delta: -26.4MB). Peak memory consumption was 14.5MB. Max. memory is 8.0GB. * TraceAbstraction took 78206.23ms. Allocated memory was 233.8MB in the beginning and 1.0GB in the end (delta: 772.8MB). Free memory was 185.0MB in the beginning and 711.4MB in the end (delta: -526.4MB). Peak memory consumption was 246.3MB. 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 106. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] signed char var_1_3 = 0; [L24] unsigned char var_1_5 = 128; [L25] unsigned char var_1_6 = 16; [L26] unsigned char var_1_7 = 2; [L27] unsigned char var_1_8 = 8; [L28] double var_1_9 = 10.5; [L29] unsigned char var_1_10 = 0; [L30] unsigned char var_1_12 = 0; [L31] double var_1_13 = 99.25; [L32] unsigned char var_1_14 = 64; [L33] unsigned char var_1_16 = 0; [L34] unsigned char var_1_17 = 0; [L35] unsigned char var_1_18 = 1; [L36] unsigned char last_1_var_1_14 = 64; [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] CALL updateLastVariables() [L103] last_1_var_1_14 = var_1_14 [L113] RET updateLastVariables() [L114] CALL updateVariables() [L72] var_1_3 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L73] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L74] CALL assume_abort_if_not(var_1_3 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L74] RET assume_abort_if_not(var_1_3 <= 16) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L75] var_1_5 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_5 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L76] RET assume_abort_if_not(var_1_5 >= 127) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L77] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L77] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L78] var_1_6 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_7=2, var_1_8=8, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_7=2, var_1_8=8, var_1_9=21/2] [L79] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_7=2, var_1_8=8, var_1_9=21/2] [L80] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=2, var_1_8=8, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=2, var_1_8=8, var_1_9=21/2] [L80] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=2, var_1_8=8, var_1_9=21/2] [L81] var_1_7 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_8=8, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_8=8, var_1_9=21/2] [L82] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_8=8, var_1_9=21/2] [L83] CALL assume_abort_if_not(var_1_7 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=8, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=8, var_1_9=21/2] [L83] RET assume_abort_if_not(var_1_7 <= 127) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=8, var_1_9=21/2] [L84] var_1_8 = __VERIFIER_nondet_uchar() [L85] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_9=21/2] [L85] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_9=21/2] [L86] CALL assume_abort_if_not(var_1_8 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L86] RET assume_abort_if_not(var_1_8 <= 64) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L87] var_1_10 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L88] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L89] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L89] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L90] var_1_12 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L91] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L92] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L92] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L93] var_1_13 = __VERIFIER_nondet_double() [L94] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L94] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L95] var_1_17 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L96] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L97] CALL assume_abort_if_not(var_1_17 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L97] RET assume_abort_if_not(var_1_17 <= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L98] var_1_18 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_18 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L99] RET assume_abort_if_not(var_1_18 >= 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L100] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L100] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L114] RET updateVariables() [L115] CALL step() [L40] EXPR last_1_var_1_14 >> var_1_3 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L40] COND TRUE (last_1_var_1_14 >> var_1_3) >= last_1_var_1_14 [L41] var_1_1 = ((((var_1_3) < ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))))) ? (var_1_3) : ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7))))))) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L45] COND FALSE !((var_1_8 + var_1_1) >= var_1_7) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L48] COND TRUE var_1_12 || var_1_10 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L49] EXPR var_1_8 << var_1_3 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L49] COND FALSE !(var_1_1 >= (var_1_8 << var_1_3)) [L56] var_1_16 = var_1_18 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=1, var_1_17=0, var_1_18=1, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L61] unsigned char stepLocal_1 = var_1_14; [L62] unsigned char stepLocal_0 = var_1_16; VAL [isInitial=1, last_1_var_1_14=64, stepLocal_0=1, stepLocal_1=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=1, var_1_17=0, var_1_18=1, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L63] COND TRUE \read(var_1_16) VAL [isInitial=1, last_1_var_1_14=64, stepLocal_0=1, stepLocal_1=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=1, var_1_17=0, var_1_18=1, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L64] COND TRUE stepLocal_0 || var_1_16 VAL [isInitial=1, last_1_var_1_14=64, stepLocal_0=1, stepLocal_1=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=1, var_1_17=0, var_1_18=1, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L65] COND TRUE stepLocal_1 > var_1_6 [L66] var_1_9 = var_1_13 VAL [isInitial=1, last_1_var_1_14=64, stepLocal_0=1, stepLocal_1=64, var_1_10=1, var_1_12=1, var_1_13=133, var_1_14=64, var_1_16=1, var_1_17=0, var_1_18=1, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=133] [L115] RET step() [L116] CALL, EXPR property() [L106] EXPR last_1_var_1_14 >> var_1_3 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=133, var_1_14=64, var_1_16=1, var_1_17=0, var_1_18=1, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=133] [L106] EXPR (((((last_1_var_1_14 >> var_1_3) >= last_1_var_1_14) ? (var_1_1 == ((unsigned char) ((((var_1_3) < ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))))) ? (var_1_3) : ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7))))))))) : (var_1_1 == ((unsigned char) (((((var_1_6) < (var_1_3)) ? (var_1_6) : (var_1_3))) + (((((var_1_8 + 1)) < (var_1_7)) ? ((var_1_8 + 1)) : (var_1_7))))))) && (var_1_16 ? ((var_1_16 || var_1_16) ? ((var_1_14 > var_1_6) ? (var_1_9 == ((double) var_1_13)) : 1) : 1) : 1)) && (((var_1_8 + var_1_1) >= var_1_7) ? (var_1_14 == ((unsigned char) var_1_6)) : 1)) && ((var_1_12 || var_1_10) ? ((var_1_1 >= (var_1_8 << var_1_3)) ? ((var_1_6 > var_1_7) ? (var_1_16 == ((unsigned char) var_1_17)) : (var_1_16 == ((unsigned char) 1))) : (var_1_16 == ((unsigned char) var_1_18))) : (var_1_16 == ((unsigned char) var_1_17))) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=133, var_1_14=64, var_1_16=1, var_1_17=0, var_1_18=1, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=133] [L106-L107] return (((((last_1_var_1_14 >> var_1_3) >= last_1_var_1_14) ? (var_1_1 == ((unsigned char) ((((var_1_3) < ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))))) ? (var_1_3) : ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7))))))))) : (var_1_1 == ((unsigned char) (((((var_1_6) < (var_1_3)) ? (var_1_6) : (var_1_3))) + (((((var_1_8 + 1)) < (var_1_7)) ? ((var_1_8 + 1)) : (var_1_7))))))) && (var_1_16 ? ((var_1_16 || var_1_16) ? ((var_1_14 > var_1_6) ? (var_1_9 == ((double) var_1_13)) : 1) : 1) : 1)) && (((var_1_8 + var_1_1) >= var_1_7) ? (var_1_14 == ((unsigned char) var_1_6)) : 1)) && ((var_1_12 || var_1_10) ? ((var_1_1 >= (var_1_8 << var_1_3)) ? ((var_1_6 > var_1_7) ? (var_1_16 == ((unsigned char) var_1_17)) : (var_1_16 == ((unsigned char) 1))) : (var_1_16 == ((unsigned char) var_1_18))) : (var_1_16 == ((unsigned char) var_1_17))) ; [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=133, var_1_14=64, var_1_16=1, var_1_17=0, var_1_18=1, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=133] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=133, var_1_14=64, var_1_16=1, var_1_17=0, var_1_18=1, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=133] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 78.1s, OverallIterations: 14, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1227 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1210 mSDsluCounter, 3322 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2143 mSDsCounter, 224 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1153 IncrementalHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 224 mSolverCounterUnsat, 1179 mSDtfsCounter, 1153 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 853 GetRequests, 764 SyntacticMatches, 4 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=476occurred in iteration=12, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 593 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 71.6s InterpolantComputationTime, 1822 NumberOfCodeBlocks, 1822 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1805 ConstructedInterpolants, 0 QuantifiedInterpolants, 12618 SizeOfPredicates, 4 NumberOfNonLiveVariables, 279 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 15 InterpolantComputations, 12 PerfectInterpolantSequences, 10242/10260 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-19 10:33:52,715 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...