/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_operatoramount_amount10_file-23.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 21:06:13,792 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 21:06:13,854 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 21:06:13,857 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 21:06:13,858 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 21:06:13,879 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 21:06:13,879 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 21:06:13,879 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 21:06:13,880 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 21:06:13,882 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 21:06:13,883 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 21:06:13,883 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 21:06:13,883 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 21:06:13,884 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 21:06:13,885 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 21:06:13,885 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 21:06:13,885 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 21:06:13,885 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 21:06:13,885 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 21:06:13,886 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 21:06:13,886 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 21:06:13,886 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 21:06:13,887 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 21:06:13,887 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 21:06:13,887 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 21:06:13,887 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 21:06:13,887 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 21:06:13,887 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 21:06:13,888 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 21:06:13,888 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 21:06:13,889 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 21:06:13,889 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 21:06:13,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:06:13,889 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 21:06:13,889 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 21:06:13,889 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 21:06:13,889 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 21:06:13,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 21:06:13,889 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 21:06:13,890 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 21:06:13,890 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 21:06:13,890 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 21:06:13,890 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 21:06:13,890 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-15 21:06:14,086 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 21:06:14,101 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 21:06:14,103 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 21:06:14,103 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 21:06:14,104 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 21:06:14,104 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-23.i [2023-12-15 21:06:15,138 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 21:06:15,277 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 21:06:15,278 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-23.i [2023-12-15 21:06:15,282 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0bf2df74/a4092be30aff46778a6bb958e768b8b7/FLAGbf8343428 [2023-12-15 21:06:15,293 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0bf2df74/a4092be30aff46778a6bb958e768b8b7 [2023-12-15 21:06:15,294 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 21:06:15,295 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 21:06:15,296 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 21:06:15,296 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 21:06:15,299 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 21:06:15,299 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:06:15" (1/1) ... [2023-12-15 21:06:15,300 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@485293 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:06:15, skipping insertion in model container [2023-12-15 21:06:15,300 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:06:15" (1/1) ... [2023-12-15 21:06:15,314 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 21:06:15,426 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_operatoramount_amount10_file-23.i[915,928] [2023-12-15 21:06:15,452 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:06:15,464 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 21:06:15,472 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_operatoramount_amount10_file-23.i[915,928] [2023-12-15 21:06:15,480 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:06:15,496 INFO L206 MainTranslator]: Completed translation [2023-12-15 21:06:15,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:06:15 WrapperNode [2023-12-15 21:06:15,497 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 21:06:15,497 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 21:06:15,497 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 21:06:15,497 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 21:06:15,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:06:15" (1/1) ... [2023-12-15 21:06:15,507 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:06:15" (1/1) ... [2023-12-15 21:06:15,523 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 148 [2023-12-15 21:06:15,524 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 21:06:15,524 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 21:06:15,524 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 21:06:15,524 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 21:06:15,531 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:06:15" (1/1) ... [2023-12-15 21:06:15,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:06:15" (1/1) ... [2023-12-15 21:06:15,533 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:06:15" (1/1) ... [2023-12-15 21:06:15,550 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-15 21:06:15,550 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:06:15" (1/1) ... [2023-12-15 21:06:15,550 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:06:15" (1/1) ... [2023-12-15 21:06:15,572 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:06:15" (1/1) ... [2023-12-15 21:06:15,575 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:06:15" (1/1) ... [2023-12-15 21:06:15,576 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:06:15" (1/1) ... [2023-12-15 21:06:15,586 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:06:15" (1/1) ... [2023-12-15 21:06:15,588 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 21:06:15,588 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 21:06:15,588 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 21:06:15,589 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 21:06:15,589 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:06:15" (1/1) ... [2023-12-15 21:06:15,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:06:15,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:06:15,630 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-15 21:06:15,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-15 21:06:15,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 21:06:15,671 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 21:06:15,671 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 21:06:15,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 21:06:15,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 21:06:15,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 21:06:15,724 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 21:06:15,727 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 21:06:15,982 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 21:06:16,012 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 21:06:16,012 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 21:06:16,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:06:16 BoogieIcfgContainer [2023-12-15 21:06:16,013 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 21:06:16,015 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 21:06:16,015 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 21:06:16,017 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 21:06:16,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:06:15" (1/3) ... [2023-12-15 21:06:16,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d513b81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:06:16, skipping insertion in model container [2023-12-15 21:06:16,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:06:15" (2/3) ... [2023-12-15 21:06:16,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d513b81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:06:16, skipping insertion in model container [2023-12-15 21:06:16,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:06:16" (3/3) ... [2023-12-15 21:06:16,019 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-23.i [2023-12-15 21:06:16,031 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 21:06:16,031 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 21:06:16,069 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 21:06:16,073 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;@2cfe845a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 21:06:16,074 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 21:06:16,077 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 35 states have (on average 1.542857142857143) internal successors, (54), 36 states have internal predecessors, (54), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-15 21:06:16,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-15 21:06:16,084 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:06:16,084 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:06:16,085 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:06:16,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:06:16,089 INFO L85 PathProgramCache]: Analyzing trace with hash -626316995, now seen corresponding path program 1 times [2023-12-15 21:06:16,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:06:16,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865170560] [2023-12-15 21:06:16,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:06:16,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:06:16,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:16,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:06:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:16,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:06:16,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:16,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:06:16,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:16,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 21:06:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:16,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 21:06:16,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:16,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:06:16,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:16,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:06:16,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:16,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 21:06:16,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:16,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 21:06:16,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:16,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 21:06:16,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:16,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 21:06:16,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:16,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:06:16,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:16,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:06:16,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:16,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 21:06:16,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:16,293 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:06:16,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:06:16,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865170560] [2023-12-15 21:06:16,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865170560] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:06:16,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:06:16,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:06:16,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174711038] [2023-12-15 21:06:16,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:06:16,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 21:06:16,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:06:16,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 21:06:16,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:06:16,324 INFO L87 Difference]: Start difference. First operand has 52 states, 35 states have (on average 1.542857142857143) internal successors, (54), 36 states have internal predecessors, (54), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-15 21:06:16,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:06:16,366 INFO L93 Difference]: Finished difference Result 101 states and 176 transitions. [2023-12-15 21:06:16,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 21:06:16,368 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 85 [2023-12-15 21:06:16,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:06:16,375 INFO L225 Difference]: With dead ends: 101 [2023-12-15 21:06:16,376 INFO L226 Difference]: Without dead ends: 50 [2023-12-15 21:06:16,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:06:16,382 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:06:16,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:06:16,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-12-15 21:06:16,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-12-15 21:06:16,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 34 states have internal predecessors, (49), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-15 21:06:16,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 77 transitions. [2023-12-15 21:06:16,408 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 77 transitions. Word has length 85 [2023-12-15 21:06:16,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:06:16,408 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 77 transitions. [2023-12-15 21:06:16,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-15 21:06:16,408 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 77 transitions. [2023-12-15 21:06:16,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-15 21:06:16,410 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:06:16,410 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:06:16,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 21:06:16,411 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:06:16,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:06:16,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1314584579, now seen corresponding path program 1 times [2023-12-15 21:06:16,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:06:16,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110411083] [2023-12-15 21:06:16,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:06:16,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:06:16,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:16,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:06:16,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:16,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:06:16,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:16,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:06:16,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:16,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 21:06:16,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:16,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 21:06:16,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:16,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:06:16,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:16,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:06:16,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:16,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 21:06:16,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:16,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 21:06:16,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:16,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 21:06:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:16,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 21:06:16,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:16,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:06:16,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:16,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:06:16,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:16,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 21:06:16,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:16,789 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:06:16,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:06:16,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110411083] [2023-12-15 21:06:16,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110411083] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:06:16,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:06:16,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:06:16,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892901202] [2023-12-15 21:06:16,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:06:16,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:06:16,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:06:16,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:06:16,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:06:16,792 INFO L87 Difference]: Start difference. First operand 50 states and 77 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:06:16,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:06:16,846 INFO L93 Difference]: Finished difference Result 91 states and 135 transitions. [2023-12-15 21:06:16,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:06:16,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 85 [2023-12-15 21:06:16,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:06:16,847 INFO L225 Difference]: With dead ends: 91 [2023-12-15 21:06:16,848 INFO L226 Difference]: Without dead ends: 89 [2023-12-15 21:06:16,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:06:16,849 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 55 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:06:16,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 275 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:06:16,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-15 21:06:16,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2023-12-15 21:06:16,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 58 states have internal predecessors, (79), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-15 21:06:16,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 131 transitions. [2023-12-15 21:06:16,864 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 131 transitions. Word has length 85 [2023-12-15 21:06:16,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:06:16,865 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 131 transitions. [2023-12-15 21:06:16,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:06:16,866 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 131 transitions. [2023-12-15 21:06:16,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-12-15 21:06:16,870 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:06:16,871 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:06:16,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 21:06:16,871 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:06:16,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:06:16,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1996486636, now seen corresponding path program 1 times [2023-12-15 21:06:16,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:06:16,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397593120] [2023-12-15 21:06:16,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:06:16,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:06:16,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:16,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:06:16,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:16,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:06:16,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:16,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:06:16,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:16,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 21:06:16,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:16,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 21:06:16,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:16,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:06:16,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:16,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:06:16,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:16,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 21:06:16,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:16,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 21:06:16,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:16,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 21:06:16,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:16,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 21:06:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:16,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:06:16,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:16,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:06:16,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:16,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 21:06:16,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:16,986 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:06:16,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:06:16,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397593120] [2023-12-15 21:06:16,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397593120] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:06:16,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:06:16,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:06:16,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287990026] [2023-12-15 21:06:16,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:06:16,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:06:16,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:06:16,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:06:16,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:06:16,992 INFO L87 Difference]: Start difference. First operand 86 states and 131 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:06:17,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:06:17,033 INFO L93 Difference]: Finished difference Result 169 states and 253 transitions. [2023-12-15 21:06:17,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:06:17,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 88 [2023-12-15 21:06:17,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:06:17,039 INFO L225 Difference]: With dead ends: 169 [2023-12-15 21:06:17,039 INFO L226 Difference]: Without dead ends: 84 [2023-12-15 21:06:17,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:06:17,040 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 6 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:06:17,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 131 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:06:17,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-12-15 21:06:17,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 77. [2023-12-15 21:06:17,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 48 states have (on average 1.3125) internal successors, (63), 49 states have internal predecessors, (63), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-15 21:06:17,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 115 transitions. [2023-12-15 21:06:17,053 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 115 transitions. Word has length 88 [2023-12-15 21:06:17,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:06:17,054 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 115 transitions. [2023-12-15 21:06:17,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:06:17,055 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 115 transitions. [2023-12-15 21:06:17,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-12-15 21:06:17,056 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:06:17,057 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:06:17,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 21:06:17,057 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:06:17,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:06:17,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1783112161, now seen corresponding path program 1 times [2023-12-15 21:06:17,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:06:17,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304986473] [2023-12-15 21:06:17,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:06:17,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:06:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:17,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:06:17,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:17,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:06:17,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:17,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:06:17,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:17,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 21:06:17,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:17,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 21:06:17,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:17,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:06:17,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:17,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:06:17,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:17,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 21:06:17,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:17,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 21:06:17,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:17,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 21:06:17,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:17,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 21:06:17,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:17,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:06:17,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:17,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:06:17,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:17,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 21:06:17,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:17,161 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:06:17,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:06:17,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304986473] [2023-12-15 21:06:17,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304986473] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:06:17,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:06:17,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:06:17,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156036135] [2023-12-15 21:06:17,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:06:17,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:06:17,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:06:17,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:06:17,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:06:17,166 INFO L87 Difference]: Start difference. First operand 77 states and 115 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:06:17,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:06:17,223 INFO L93 Difference]: Finished difference Result 154 states and 230 transitions. [2023-12-15 21:06:17,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:06:17,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 88 [2023-12-15 21:06:17,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:06:17,246 INFO L225 Difference]: With dead ends: 154 [2023-12-15 21:06:17,247 INFO L226 Difference]: Without dead ends: 78 [2023-12-15 21:06:17,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:06:17,255 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 30 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:06:17,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 105 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:06:17,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-12-15 21:06:17,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2023-12-15 21:06:17,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 49 states have internal predecessors, (62), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-15 21:06:17,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 114 transitions. [2023-12-15 21:06:17,267 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 114 transitions. Word has length 88 [2023-12-15 21:06:17,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:06:17,268 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 114 transitions. [2023-12-15 21:06:17,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:06:17,268 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 114 transitions. [2023-12-15 21:06:17,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-15 21:06:17,269 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:06:17,269 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:06:17,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 21:06:17,269 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:06:17,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:06:17,269 INFO L85 PathProgramCache]: Analyzing trace with hash -482221176, now seen corresponding path program 1 times [2023-12-15 21:06:17,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:06:17,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721539798] [2023-12-15 21:06:17,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:06:17,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:06:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:17,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:06:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:17,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:06:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:17,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:06:17,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:17,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 21:06:17,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:17,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 21:06:17,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:17,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:06:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:17,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:06:17,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:17,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 21:06:17,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:17,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 21:06:17,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:17,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 21:06:17,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:17,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 21:06:17,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:17,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:06:17,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:17,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:06:17,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:17,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 21:06:17,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:17,677 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:06:17,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:06:17,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721539798] [2023-12-15 21:06:17,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721539798] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:06:17,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:06:17,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 21:06:17,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348113462] [2023-12-15 21:06:17,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:06:17,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 21:06:17,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:06:17,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 21:06:17,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:06:17,680 INFO L87 Difference]: Start difference. First operand 77 states and 114 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:06:17,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:06:17,807 INFO L93 Difference]: Finished difference Result 99 states and 142 transitions. [2023-12-15 21:06:17,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 21:06:17,807 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 91 [2023-12-15 21:06:17,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:06:17,808 INFO L225 Difference]: With dead ends: 99 [2023-12-15 21:06:17,808 INFO L226 Difference]: Without dead ends: 97 [2023-12-15 21:06:17,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:06:17,809 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 20 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:06:17,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 371 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:06:17,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-12-15 21:06:17,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 86. [2023-12-15 21:06:17,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 58 states have internal predecessors, (75), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-15 21:06:17,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 127 transitions. [2023-12-15 21:06:17,825 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 127 transitions. Word has length 91 [2023-12-15 21:06:17,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:06:17,825 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 127 transitions. [2023-12-15 21:06:17,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:06:17,825 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 127 transitions. [2023-12-15 21:06:17,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-15 21:06:17,826 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:06:17,826 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:06:17,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 21:06:17,826 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:06:17,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:06:17,826 INFO L85 PathProgramCache]: Analyzing trace with hash 770213103, now seen corresponding path program 1 times [2023-12-15 21:06:17,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:06:17,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463336334] [2023-12-15 21:06:17,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:06:17,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:06:17,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:17,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:06:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:17,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:06:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:17,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:06:17,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:17,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 21:06:17,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:17,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 21:06:17,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:17,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:06:17,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:17,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:06:17,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:17,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 21:06:17,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:17,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 21:06:17,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:17,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 21:06:17,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:17,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 21:06:17,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:17,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:06:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:17,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:06:17,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:17,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 21:06:17,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:17,970 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:06:17,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:06:17,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463336334] [2023-12-15 21:06:17,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463336334] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:06:17,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:06:17,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 21:06:17,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2551652] [2023-12-15 21:06:17,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:06:17,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 21:06:17,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:06:17,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 21:06:17,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:06:17,972 INFO L87 Difference]: Start difference. First operand 86 states and 127 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:06:18,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:06:18,127 INFO L93 Difference]: Finished difference Result 122 states and 174 transitions. [2023-12-15 21:06:18,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 21:06:18,127 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 92 [2023-12-15 21:06:18,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:06:18,128 INFO L225 Difference]: With dead ends: 122 [2023-12-15 21:06:18,128 INFO L226 Difference]: Without dead ends: 120 [2023-12-15 21:06:18,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-12-15 21:06:18,128 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 54 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:06:18,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 369 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:06:18,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-12-15 21:06:18,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 87. [2023-12-15 21:06:18,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 59 states have internal predecessors, (77), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-15 21:06:18,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 129 transitions. [2023-12-15 21:06:18,135 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 129 transitions. Word has length 92 [2023-12-15 21:06:18,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:06:18,135 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 129 transitions. [2023-12-15 21:06:18,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:06:18,135 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 129 transitions. [2023-12-15 21:06:18,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-15 21:06:18,136 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:06:18,136 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:06:18,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 21:06:18,136 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:06:18,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:06:18,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1450271473, now seen corresponding path program 1 times [2023-12-15 21:06:18,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:06:18,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436539467] [2023-12-15 21:06:18,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:06:18,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:06:18,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:06:18,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:06:18,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:06:18,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 21:06:18,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 21:06:18,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:06:18,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:06:18,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 21:06:18,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 21:06:18,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 21:06:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 21:06:18,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:06:18,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:06:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 21:06:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,374 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:06:18,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:06:18,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436539467] [2023-12-15 21:06:18,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436539467] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:06:18,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:06:18,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 21:06:18,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61044906] [2023-12-15 21:06:18,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:06:18,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 21:06:18,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:06:18,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 21:06:18,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:06:18,375 INFO L87 Difference]: Start difference. First operand 87 states and 129 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:06:18,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:06:18,583 INFO L93 Difference]: Finished difference Result 122 states and 174 transitions. [2023-12-15 21:06:18,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-15 21:06:18,583 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 92 [2023-12-15 21:06:18,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:06:18,584 INFO L225 Difference]: With dead ends: 122 [2023-12-15 21:06:18,584 INFO L226 Difference]: Without dead ends: 120 [2023-12-15 21:06:18,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-12-15 21:06:18,585 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 37 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:06:18,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 413 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:06:18,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-12-15 21:06:18,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 95. [2023-12-15 21:06:18,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 67 states have internal predecessors, (90), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-15 21:06:18,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 142 transitions. [2023-12-15 21:06:18,590 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 142 transitions. Word has length 92 [2023-12-15 21:06:18,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:06:18,591 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 142 transitions. [2023-12-15 21:06:18,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:06:18,591 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 142 transitions. [2023-12-15 21:06:18,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-15 21:06:18,592 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:06:18,592 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:06:18,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 21:06:18,592 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:06:18,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:06:18,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1838993907, now seen corresponding path program 1 times [2023-12-15 21:06:18,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:06:18,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789484874] [2023-12-15 21:06:18,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:06:18,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:06:18,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:06:18,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:06:18,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:06:18,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 21:06:18,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 21:06:18,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:06:18,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:06:18,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 21:06:18,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 21:06:18,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 21:06:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 21:06:18,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:06:18,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:06:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 21:06:18,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,645 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:06:18,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:06:18,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789484874] [2023-12-15 21:06:18,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789484874] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:06:18,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:06:18,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:06:18,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743783083] [2023-12-15 21:06:18,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:06:18,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:06:18,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:06:18,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:06:18,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:06:18,647 INFO L87 Difference]: Start difference. First operand 95 states and 142 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:06:18,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:06:18,695 INFO L93 Difference]: Finished difference Result 226 states and 338 transitions. [2023-12-15 21:06:18,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:06:18,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2023-12-15 21:06:18,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:06:18,696 INFO L225 Difference]: With dead ends: 226 [2023-12-15 21:06:18,696 INFO L226 Difference]: Without dead ends: 132 [2023-12-15 21:06:18,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:06:18,697 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 29 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:06:18,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 252 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:06:18,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-12-15 21:06:18,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 105. [2023-12-15 21:06:18,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 76 states have (on average 1.381578947368421) internal successors, (105), 77 states have internal predecessors, (105), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-15 21:06:18,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 157 transitions. [2023-12-15 21:06:18,703 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 157 transitions. Word has length 93 [2023-12-15 21:06:18,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:06:18,703 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 157 transitions. [2023-12-15 21:06:18,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:06:18,703 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 157 transitions. [2023-12-15 21:06:18,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-15 21:06:18,704 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:06:18,704 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:06:18,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-15 21:06:18,704 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:06:18,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:06:18,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1854151811, now seen corresponding path program 1 times [2023-12-15 21:06:18,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:06:18,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762999743] [2023-12-15 21:06:18,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:06:18,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:06:18,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:06:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:06:18,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:06:18,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 21:06:18,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 21:06:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:06:18,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:06:18,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 21:06:18,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 21:06:18,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 21:06:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 21:06:18,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:06:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:06:18,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 21:06:18,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,758 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:06:18,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:06:18,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762999743] [2023-12-15 21:06:18,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762999743] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:06:18,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:06:18,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:06:18,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561979274] [2023-12-15 21:06:18,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:06:18,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:06:18,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:06:18,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:06:18,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:06:18,759 INFO L87 Difference]: Start difference. First operand 105 states and 157 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:06:18,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:06:18,815 INFO L93 Difference]: Finished difference Result 236 states and 352 transitions. [2023-12-15 21:06:18,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:06:18,815 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2023-12-15 21:06:18,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:06:18,816 INFO L225 Difference]: With dead ends: 236 [2023-12-15 21:06:18,816 INFO L226 Difference]: Without dead ends: 132 [2023-12-15 21:06:18,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:06:18,817 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 36 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:06:18,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 290 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:06:18,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-12-15 21:06:18,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 114. [2023-12-15 21:06:18,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 85 states have (on average 1.4) internal successors, (119), 86 states have internal predecessors, (119), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-15 21:06:18,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 171 transitions. [2023-12-15 21:06:18,822 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 171 transitions. Word has length 93 [2023-12-15 21:06:18,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:06:18,822 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 171 transitions. [2023-12-15 21:06:18,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:06:18,823 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 171 transitions. [2023-12-15 21:06:18,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-15 21:06:18,823 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:06:18,823 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:06:18,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-15 21:06:18,823 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:06:18,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:06:18,824 INFO L85 PathProgramCache]: Analyzing trace with hash -2127217959, now seen corresponding path program 1 times [2023-12-15 21:06:18,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:06:18,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642514798] [2023-12-15 21:06:18,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:06:18,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:06:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:06:18,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:06:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:06:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 21:06:18,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 21:06:18,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:06:18,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:06:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 21:06:18,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 21:06:18,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 21:06:18,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 21:06:18,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:06:18,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:06:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 21:06:18,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,860 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:06:18,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:06:18,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642514798] [2023-12-15 21:06:18,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642514798] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:06:18,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:06:18,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:06:18,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779551166] [2023-12-15 21:06:18,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:06:18,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:06:18,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:06:18,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:06:18,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:06:18,861 INFO L87 Difference]: Start difference. First operand 114 states and 171 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:06:18,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:06:18,892 INFO L93 Difference]: Finished difference Result 262 states and 388 transitions. [2023-12-15 21:06:18,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:06:18,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2023-12-15 21:06:18,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:06:18,893 INFO L225 Difference]: With dead ends: 262 [2023-12-15 21:06:18,893 INFO L226 Difference]: Without dead ends: 149 [2023-12-15 21:06:18,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:06:18,894 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 35 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:06:18,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 138 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:06:18,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-12-15 21:06:18,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 143. [2023-12-15 21:06:18,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 107 states have (on average 1.3271028037383177) internal successors, (142), 109 states have internal predecessors, (142), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-15 21:06:18,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 206 transitions. [2023-12-15 21:06:18,900 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 206 transitions. Word has length 94 [2023-12-15 21:06:18,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:06:18,901 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 206 transitions. [2023-12-15 21:06:18,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:06:18,901 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 206 transitions. [2023-12-15 21:06:18,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-15 21:06:18,901 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:06:18,901 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:06:18,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-15 21:06:18,902 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:06:18,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:06:18,902 INFO L85 PathProgramCache]: Analyzing trace with hash 868482793, now seen corresponding path program 1 times [2023-12-15 21:06:18,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:06:18,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919869392] [2023-12-15 21:06:18,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:06:18,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:06:18,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:06:18,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:06:18,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:06:18,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 21:06:18,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 21:06:18,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:06:18,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:06:18,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 21:06:18,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 21:06:18,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 21:06:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 21:06:18,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:06:18,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:06:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 21:06:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:18,938 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:06:18,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:06:18,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919869392] [2023-12-15 21:06:18,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919869392] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:06:18,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:06:18,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:06:18,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027721974] [2023-12-15 21:06:18,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:06:18,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:06:18,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:06:18,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:06:18,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:06:18,940 INFO L87 Difference]: Start difference. First operand 143 states and 206 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:06:18,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:06:18,973 INFO L93 Difference]: Finished difference Result 295 states and 419 transitions. [2023-12-15 21:06:18,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:06:18,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2023-12-15 21:06:18,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:06:18,975 INFO L225 Difference]: With dead ends: 295 [2023-12-15 21:06:18,975 INFO L226 Difference]: Without dead ends: 153 [2023-12-15 21:06:18,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:06:18,976 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 42 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:06:18,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 126 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:06:18,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-12-15 21:06:18,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 128. [2023-12-15 21:06:18,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 91 states have (on average 1.2527472527472527) internal successors, (114), 93 states have internal predecessors, (114), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-15 21:06:18,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 178 transitions. [2023-12-15 21:06:18,994 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 178 transitions. Word has length 94 [2023-12-15 21:06:18,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:06:18,994 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 178 transitions. [2023-12-15 21:06:18,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:06:18,994 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 178 transitions. [2023-12-15 21:06:18,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-15 21:06:18,995 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:06:18,995 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:06:18,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-15 21:06:18,995 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:06:18,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:06:18,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1968613544, now seen corresponding path program 1 times [2023-12-15 21:06:18,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:06:18,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686986498] [2023-12-15 21:06:18,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:06:18,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:06:19,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:19,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:06:19,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:19,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:06:19,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:19,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:06:19,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:19,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 21:06:19,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:19,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 21:06:19,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:19,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:06:19,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:19,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:06:19,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:19,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 21:06:19,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:19,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 21:06:19,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:19,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 21:06:19,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:19,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 21:06:19,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:19,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:06:19,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:19,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:06:19,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:19,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 21:06:19,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:19,341 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:06:19,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:06:19,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686986498] [2023-12-15 21:06:19,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686986498] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:06:19,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:06:19,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 21:06:19,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658928453] [2023-12-15 21:06:19,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:06:19,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 21:06:19,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:06:19,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 21:06:19,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:06:19,342 INFO L87 Difference]: Start difference. First operand 128 states and 178 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:06:19,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:06:19,550 INFO L93 Difference]: Finished difference Result 155 states and 205 transitions. [2023-12-15 21:06:19,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 21:06:19,550 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 95 [2023-12-15 21:06:19,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:06:19,553 INFO L225 Difference]: With dead ends: 155 [2023-12-15 21:06:19,553 INFO L226 Difference]: Without dead ends: 153 [2023-12-15 21:06:19,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2023-12-15 21:06:19,554 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 22 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:06:19,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 487 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:06:19,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-12-15 21:06:19,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 149. [2023-12-15 21:06:19,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 108 states have (on average 1.212962962962963) internal successors, (131), 111 states have internal predecessors, (131), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-15 21:06:19,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 199 transitions. [2023-12-15 21:06:19,562 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 199 transitions. Word has length 95 [2023-12-15 21:06:19,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:06:19,562 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 199 transitions. [2023-12-15 21:06:19,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:06:19,563 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 199 transitions. [2023-12-15 21:06:19,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-15 21:06:19,563 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:06:19,563 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:06:19,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-15 21:06:19,564 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:06:19,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:06:19,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1734232699, now seen corresponding path program 1 times [2023-12-15 21:06:19,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:06:19,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144589359] [2023-12-15 21:06:19,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:06:19,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:06:19,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:19,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:06:19,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:19,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:06:19,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:19,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:06:19,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:19,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 21:06:19,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:19,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 21:06:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:19,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:06:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:19,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:06:19,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:19,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 21:06:19,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:19,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 21:06:19,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:19,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 21:06:19,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:19,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 21:06:19,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:19,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:06:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:19,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:06:19,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:19,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 21:06:19,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:19,721 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:06:19,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:06:19,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144589359] [2023-12-15 21:06:19,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144589359] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:06:19,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:06:19,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-15 21:06:19,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671774264] [2023-12-15 21:06:19,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:06:19,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-15 21:06:19,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:06:19,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-15 21:06:19,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:06:19,722 INFO L87 Difference]: Start difference. First operand 149 states and 199 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:06:19,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:06:19,899 INFO L93 Difference]: Finished difference Result 184 states and 236 transitions. [2023-12-15 21:06:19,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 21:06:19,899 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 96 [2023-12-15 21:06:19,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:06:19,900 INFO L225 Difference]: With dead ends: 184 [2023-12-15 21:06:19,900 INFO L226 Difference]: Without dead ends: 182 [2023-12-15 21:06:19,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2023-12-15 21:06:19,901 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 49 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:06:19,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 549 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:06:19,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-12-15 21:06:19,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 153. [2023-12-15 21:06:19,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 112 states have (on average 1.2142857142857142) internal successors, (136), 115 states have internal predecessors, (136), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-15 21:06:19,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 204 transitions. [2023-12-15 21:06:19,909 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 204 transitions. Word has length 96 [2023-12-15 21:06:19,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:06:19,909 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 204 transitions. [2023-12-15 21:06:19,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:06:19,909 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 204 transitions. [2023-12-15 21:06:19,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-15 21:06:19,910 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:06:19,910 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:06:19,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-15 21:06:19,910 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:06:19,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:06:19,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1033168121, now seen corresponding path program 1 times [2023-12-15 21:06:19,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:06:19,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489954770] [2023-12-15 21:06:19,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:06:19,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:06:19,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:06:20,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:06:20,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:06:20,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 21:06:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 21:06:20,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:06:20,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:06:20,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 21:06:20,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 21:06:20,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 21:06:20,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 21:06:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:06:20,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:06:20,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 21:06:20,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,197 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:06:20,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:06:20,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489954770] [2023-12-15 21:06:20,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489954770] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:06:20,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:06:20,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-15 21:06:20,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709288655] [2023-12-15 21:06:20,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:06:20,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-15 21:06:20,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:06:20,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-15 21:06:20,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:06:20,199 INFO L87 Difference]: Start difference. First operand 153 states and 204 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:06:20,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:06:20,409 INFO L93 Difference]: Finished difference Result 187 states and 241 transitions. [2023-12-15 21:06:20,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 21:06:20,410 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 96 [2023-12-15 21:06:20,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:06:20,410 INFO L225 Difference]: With dead ends: 187 [2023-12-15 21:06:20,410 INFO L226 Difference]: Without dead ends: 185 [2023-12-15 21:06:20,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2023-12-15 21:06:20,411 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 43 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:06:20,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 591 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:06:20,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2023-12-15 21:06:20,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 144. [2023-12-15 21:06:20,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 103 states have (on average 1.2233009708737863) internal successors, (126), 106 states have internal predecessors, (126), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-15 21:06:20,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 194 transitions. [2023-12-15 21:06:20,422 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 194 transitions. Word has length 96 [2023-12-15 21:06:20,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:06:20,422 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 194 transitions. [2023-12-15 21:06:20,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:06:20,423 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 194 transitions. [2023-12-15 21:06:20,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-15 21:06:20,423 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:06:20,423 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:06:20,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-15 21:06:20,424 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:06:20,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:06:20,424 INFO L85 PathProgramCache]: Analyzing trace with hash -515792257, now seen corresponding path program 1 times [2023-12-15 21:06:20,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:06:20,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692370682] [2023-12-15 21:06:20,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:06:20,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:06:20,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:06:20,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:06:20,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:06:20,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 21:06:20,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 21:06:20,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:06:20,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:06:20,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 21:06:20,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 21:06:20,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 21:06:20,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 21:06:20,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:06:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:06:20,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 21:06:20,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,472 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:06:20,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:06:20,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692370682] [2023-12-15 21:06:20,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692370682] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:06:20,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:06:20,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:06:20,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682527402] [2023-12-15 21:06:20,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:06:20,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:06:20,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:06:20,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:06:20,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:06:20,473 INFO L87 Difference]: Start difference. First operand 144 states and 194 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:06:20,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:06:20,562 INFO L93 Difference]: Finished difference Result 311 states and 420 transitions. [2023-12-15 21:06:20,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 21:06:20,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 96 [2023-12-15 21:06:20,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:06:20,564 INFO L225 Difference]: With dead ends: 311 [2023-12-15 21:06:20,564 INFO L226 Difference]: Without dead ends: 185 [2023-12-15 21:06:20,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:06:20,565 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 27 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:06:20,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 217 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:06:20,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2023-12-15 21:06:20,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 155. [2023-12-15 21:06:20,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 114 states have (on average 1.2456140350877194) internal successors, (142), 117 states have internal predecessors, (142), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-15 21:06:20,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 210 transitions. [2023-12-15 21:06:20,577 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 210 transitions. Word has length 96 [2023-12-15 21:06:20,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:06:20,577 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 210 transitions. [2023-12-15 21:06:20,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:06:20,577 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 210 transitions. [2023-12-15 21:06:20,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-15 21:06:20,578 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:06:20,578 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:06:20,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-15 21:06:20,578 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:06:20,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:06:20,579 INFO L85 PathProgramCache]: Analyzing trace with hash 164266113, now seen corresponding path program 1 times [2023-12-15 21:06:20,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:06:20,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805601016] [2023-12-15 21:06:20,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:06:20,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:06:20,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:06:20,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:06:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:06:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 21:06:20,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 21:06:20,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:06:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:06:20,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 21:06:20,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 21:06:20,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 21:06:20,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 21:06:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:06:20,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:06:20,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 21:06:20,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,622 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:06:20,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:06:20,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805601016] [2023-12-15 21:06:20,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805601016] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:06:20,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:06:20,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:06:20,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154109821] [2023-12-15 21:06:20,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:06:20,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:06:20,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:06:20,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:06:20,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:06:20,623 INFO L87 Difference]: Start difference. First operand 155 states and 210 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:06:20,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:06:20,659 INFO L93 Difference]: Finished difference Result 334 states and 454 transitions. [2023-12-15 21:06:20,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:06:20,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 96 [2023-12-15 21:06:20,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:06:20,660 INFO L225 Difference]: With dead ends: 334 [2023-12-15 21:06:20,660 INFO L226 Difference]: Without dead ends: 197 [2023-12-15 21:06:20,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:06:20,661 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 37 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:06:20,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 147 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:06:20,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-12-15 21:06:20,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 167. [2023-12-15 21:06:20,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 126 states have (on average 1.246031746031746) internal successors, (157), 129 states have internal predecessors, (157), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-15 21:06:20,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 225 transitions. [2023-12-15 21:06:20,675 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 225 transitions. Word has length 96 [2023-12-15 21:06:20,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:06:20,675 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 225 transitions. [2023-12-15 21:06:20,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:06:20,676 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 225 transitions. [2023-12-15 21:06:20,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-15 21:06:20,676 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:06:20,676 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:06:20,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-15 21:06:20,676 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:06:20,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:06:20,677 INFO L85 PathProgramCache]: Analyzing trace with hash -23176785, now seen corresponding path program 1 times [2023-12-15 21:06:20,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:06:20,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376212525] [2023-12-15 21:06:20,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:06:20,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:06:20,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:06:20,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:06:20,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:06:20,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 21:06:20,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 21:06:20,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:06:20,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:06:20,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 21:06:20,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 21:06:20,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 21:06:20,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 21:06:20,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:06:20,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:06:20,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 21:06:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,728 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:06:20,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:06:20,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376212525] [2023-12-15 21:06:20,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376212525] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:06:20,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:06:20,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:06:20,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100338713] [2023-12-15 21:06:20,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:06:20,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:06:20,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:06:20,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:06:20,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:06:20,729 INFO L87 Difference]: Start difference. First operand 167 states and 225 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:06:20,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:06:20,823 INFO L93 Difference]: Finished difference Result 338 states and 453 transitions. [2023-12-15 21:06:20,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 21:06:20,823 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 96 [2023-12-15 21:06:20,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:06:20,825 INFO L225 Difference]: With dead ends: 338 [2023-12-15 21:06:20,825 INFO L226 Difference]: Without dead ends: 189 [2023-12-15 21:06:20,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:06:20,826 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 25 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:06:20,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 234 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:06:20,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2023-12-15 21:06:20,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 175. [2023-12-15 21:06:20,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 134 states have (on average 1.2462686567164178) internal successors, (167), 137 states have internal predecessors, (167), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-15 21:06:20,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 235 transitions. [2023-12-15 21:06:20,836 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 235 transitions. Word has length 96 [2023-12-15 21:06:20,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:06:20,836 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 235 transitions. [2023-12-15 21:06:20,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:06:20,836 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 235 transitions. [2023-12-15 21:06:20,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-15 21:06:20,837 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:06:20,837 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:06:20,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-15 21:06:20,837 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:06:20,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:06:20,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1795655935, now seen corresponding path program 1 times [2023-12-15 21:06:20,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:06:20,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141837739] [2023-12-15 21:06:20,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:06:20,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:06:20,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:06:20,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:06:20,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:06:20,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 21:06:20,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 21:06:20,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:06:20,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:06:20,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 21:06:20,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 21:06:20,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 21:06:20,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 21:06:20,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:06:20,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:06:20,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 21:06:20,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:20,888 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:06:20,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:06:20,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141837739] [2023-12-15 21:06:20,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141837739] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:06:20,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:06:20,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:06:20,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555507474] [2023-12-15 21:06:20,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:06:20,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:06:20,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:06:20,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:06:20,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:06:20,889 INFO L87 Difference]: Start difference. First operand 175 states and 235 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:06:20,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:06:20,923 INFO L93 Difference]: Finished difference Result 345 states and 461 transitions. [2023-12-15 21:06:20,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:06:20,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 96 [2023-12-15 21:06:20,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:06:20,924 INFO L225 Difference]: With dead ends: 345 [2023-12-15 21:06:20,925 INFO L226 Difference]: Without dead ends: 188 [2023-12-15 21:06:20,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:06:20,926 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 37 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:06:20,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 131 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:06:20,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2023-12-15 21:06:20,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 163. [2023-12-15 21:06:20,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 122 states have (on average 1.180327868852459) internal successors, (144), 125 states have internal predecessors, (144), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-15 21:06:20,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 212 transitions. [2023-12-15 21:06:20,935 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 212 transitions. Word has length 96 [2023-12-15 21:06:20,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:06:20,936 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 212 transitions. [2023-12-15 21:06:20,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:06:20,936 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 212 transitions. [2023-12-15 21:06:20,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-15 21:06:20,937 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:06:20,937 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:06:20,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-15 21:06:20,937 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:06:20,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:06:20,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1058339263, now seen corresponding path program 1 times [2023-12-15 21:06:20,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:06:20,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692896485] [2023-12-15 21:06:20,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:06:20,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:06:20,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:21,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:06:21,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:21,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:06:21,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:21,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:06:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:21,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 21:06:21,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:21,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 21:06:21,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:21,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:06:21,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:21,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:06:21,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:21,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 21:06:21,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:21,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 21:06:21,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:21,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 21:06:21,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:21,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 21:06:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:21,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:06:21,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:21,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:06:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:21,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 21:06:21,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:21,239 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 33 proven. 6 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2023-12-15 21:06:21,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:06:21,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692896485] [2023-12-15 21:06:21,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692896485] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:06:21,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149675618] [2023-12-15 21:06:21,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:06:21,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:06:21,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:06:21,258 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:06:21,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-15 21:06:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:21,333 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-15 21:06:21,340 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:06:21,575 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 144 proven. 12 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2023-12-15 21:06:21,576 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:06:21,731 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 33 proven. 6 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2023-12-15 21:06:21,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149675618] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:06:21,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:06:21,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2023-12-15 21:06:21,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402505844] [2023-12-15 21:06:21,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:06:21,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-15 21:06:21,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:06:21,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-15 21:06:21,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2023-12-15 21:06:21,733 INFO L87 Difference]: Start difference. First operand 163 states and 212 transitions. Second operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-15 21:06:22,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:06:22,007 INFO L93 Difference]: Finished difference Result 266 states and 327 transitions. [2023-12-15 21:06:22,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-15 21:06:22,008 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 96 [2023-12-15 21:06:22,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:06:22,008 INFO L225 Difference]: With dead ends: 266 [2023-12-15 21:06:22,008 INFO L226 Difference]: Without dead ends: 0 [2023-12-15 21:06:22,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 212 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2023-12-15 21:06:22,009 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 166 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:06:22,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 366 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:06:22,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-15 21:06:22,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-15 21:06:22,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:06:22,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-15 21:06:22,010 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 96 [2023-12-15 21:06:22,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:06:22,010 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-15 21:06:22,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-15 21:06:22,010 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-15 21:06:22,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-15 21:06:22,012 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 21:06:22,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-15 21:06:22,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:06:22,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-15 21:06:24,021 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (or (and (= ~var_1_1~0 ~var_1_8~0) (= ~var_1_7~0 (* (div ~var_1_7~0 256) 256))) (and (= (mod ~var_1_7~0 256) 0) (= (mod ~var_1_1~0 256) 0))) [2023-12-15 21:06:24,021 INFO L895 garLoopResultBuilder]: At program point L52-1(line 52) the Hoare annotation is: (or (and (= ~var_1_1~0 ~var_1_8~0) (= ~var_1_7~0 (* (div ~var_1_7~0 256) 256))) (and (= (mod ~var_1_7~0 256) 0) (= (mod ~var_1_1~0 256) 0))) [2023-12-15 21:06:24,021 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-15 21:06:24,021 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-15 21:06:24,021 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-15 21:06:24,021 INFO L895 garLoopResultBuilder]: At program point L61(line 61) the Hoare annotation is: (or (and (= ~var_1_1~0 ~var_1_8~0) (= ~var_1_7~0 (* (div ~var_1_7~0 256) 256))) (and (= (mod ~var_1_7~0 256) 0) (= (mod ~var_1_1~0 256) 0))) [2023-12-15 21:06:24,021 INFO L895 garLoopResultBuilder]: At program point L61-1(line 61) the Hoare annotation is: (or (and (= ~var_1_1~0 ~var_1_8~0) (= ~var_1_7~0 (* (div ~var_1_7~0 256) 256))) (and (= (mod ~var_1_7~0 256) 0) (= (mod ~var_1_1~0 256) 0))) [2023-12-15 21:06:24,021 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2023-12-15 21:06:24,021 INFO L899 garLoopResultBuilder]: For program point L62(line 62) no Hoare annotation was computed. [2023-12-15 21:06:24,021 INFO L895 garLoopResultBuilder]: At program point L79-2(lines 79 85) the Hoare annotation is: (or (and (= ~var_1_1~0 ~var_1_8~0) (= ~var_1_7~0 (* (div ~var_1_7~0 256) 256))) (and (= (mod ~var_1_7~0 256) 0) (= (mod ~var_1_1~0 256) 0) (<= (+ ~var_1_3~0 1) ~var_1_2~0))) [2023-12-15 21:06:24,021 INFO L899 garLoopResultBuilder]: For program point L79-3(lines 79 85) no Hoare annotation was computed. [2023-12-15 21:06:24,021 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-15 21:06:24,021 INFO L895 garLoopResultBuilder]: At program point L55(line 55) the Hoare annotation is: (or (and (= ~var_1_1~0 ~var_1_8~0) (= ~var_1_7~0 (* (div ~var_1_7~0 256) 256))) (and (= (mod ~var_1_7~0 256) 0) (= (mod ~var_1_1~0 256) 0))) [2023-12-15 21:06:24,022 INFO L895 garLoopResultBuilder]: At program point L55-1(line 55) the Hoare annotation is: (or (and (= ~var_1_1~0 ~var_1_8~0) (= ~var_1_7~0 (* (div ~var_1_7~0 256) 256))) (and (= (mod ~var_1_7~0 256) 0) (= (mod ~var_1_1~0 256) 0))) [2023-12-15 21:06:24,022 INFO L902 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: true [2023-12-15 21:06:24,022 INFO L902 garLoopResultBuilder]: At program point L64-1(line 64) the Hoare annotation is: true [2023-12-15 21:06:24,022 INFO L899 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2023-12-15 21:06:24,022 INFO L899 garLoopResultBuilder]: For program point L73(line 73) no Hoare annotation was computed. [2023-12-15 21:06:24,022 INFO L899 garLoopResultBuilder]: For program point L73-1(line 73) no Hoare annotation was computed. [2023-12-15 21:06:24,022 INFO L899 garLoopResultBuilder]: For program point L73-3(line 73) no Hoare annotation was computed. [2023-12-15 21:06:24,022 INFO L899 garLoopResultBuilder]: For program point L73-5(line 73) no Hoare annotation was computed. [2023-12-15 21:06:24,022 INFO L899 garLoopResultBuilder]: For program point L73-7(line 73) no Hoare annotation was computed. [2023-12-15 21:06:24,022 INFO L899 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2023-12-15 21:06:24,022 INFO L899 garLoopResultBuilder]: For program point L32(lines 32 46) no Hoare annotation was computed. [2023-12-15 21:06:24,022 INFO L899 garLoopResultBuilder]: For program point L73-9(line 73) no Hoare annotation was computed. [2023-12-15 21:06:24,022 INFO L899 garLoopResultBuilder]: For program point L73-11(line 73) no Hoare annotation was computed. [2023-12-15 21:06:24,022 INFO L899 garLoopResultBuilder]: For program point L73-12(line 73) no Hoare annotation was computed. [2023-12-15 21:06:24,022 INFO L899 garLoopResultBuilder]: For program point L73-14(line 73) no Hoare annotation was computed. [2023-12-15 21:06:24,022 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-15 21:06:24,022 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (or (and (= ~var_1_1~0 ~var_1_8~0) (= ~var_1_7~0 (* (div ~var_1_7~0 256) 256))) (and (= (mod ~var_1_7~0 256) 0) (= (mod ~var_1_1~0 256) 0))) [2023-12-15 21:06:24,023 INFO L895 garLoopResultBuilder]: At program point L49-1(line 49) the Hoare annotation is: (or (and (= ~var_1_1~0 ~var_1_8~0) (= ~var_1_7~0 (* (div ~var_1_7~0 256) 256))) (and (= (mod ~var_1_7~0 256) 0) (= (mod ~var_1_1~0 256) 0))) [2023-12-15 21:06:24,023 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 45) no Hoare annotation was computed. [2023-12-15 21:06:24,023 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-15 21:06:24,023 INFO L895 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (or (and (= ~var_1_1~0 ~var_1_8~0) (= ~var_1_7~0 (* (div ~var_1_7~0 256) 256))) (and (= (mod ~var_1_7~0 256) 0) (= (mod ~var_1_1~0 256) 0))) [2023-12-15 21:06:24,023 INFO L895 garLoopResultBuilder]: At program point L58-1(line 58) the Hoare annotation is: (or (and (= ~var_1_1~0 ~var_1_8~0) (= ~var_1_7~0 (* (div ~var_1_7~0 256) 256))) (and (= (mod ~var_1_7~0 256) 0) (= (mod ~var_1_1~0 256) 0))) [2023-12-15 21:06:24,023 INFO L899 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2023-12-15 21:06:24,023 INFO L895 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (= ~var_1_7~0 (* (div ~var_1_7~0 256) 256)) [2023-12-15 21:06:24,023 INFO L895 garLoopResultBuilder]: At program point L67-1(line 67) the Hoare annotation is: (= ~var_1_7~0 (* (div ~var_1_7~0 256) 256)) [2023-12-15 21:06:24,023 INFO L899 garLoopResultBuilder]: For program point L34(line 34) no Hoare annotation was computed. [2023-12-15 21:06:24,023 INFO L899 garLoopResultBuilder]: For program point L34-2(line 34) no Hoare annotation was computed. [2023-12-15 21:06:24,023 INFO L899 garLoopResultBuilder]: For program point L34-4(line 34) no Hoare annotation was computed. [2023-12-15 21:06:24,023 INFO L899 garLoopResultBuilder]: For program point L34-6(line 34) no Hoare annotation was computed. [2023-12-15 21:06:24,023 INFO L899 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2023-12-15 21:06:24,023 INFO L899 garLoopResultBuilder]: For program point L34-8(line 34) no Hoare annotation was computed. [2023-12-15 21:06:24,023 INFO L899 garLoopResultBuilder]: For program point L34-10(line 34) no Hoare annotation was computed. [2023-12-15 21:06:24,023 INFO L899 garLoopResultBuilder]: For program point L34-11(lines 34 42) no Hoare annotation was computed. [2023-12-15 21:06:24,023 INFO L899 garLoopResultBuilder]: For program point L68(lines 47 69) no Hoare annotation was computed. [2023-12-15 21:06:24,023 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 39) no Hoare annotation was computed. [2023-12-15 21:06:24,024 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-15 21:06:24,024 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-15 21:06:24,024 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-15 21:06:24,024 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-15 21:06:24,026 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:06:24,028 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 21:06:24,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:06:24 BoogieIcfgContainer [2023-12-15 21:06:24,038 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 21:06:24,038 INFO L158 Benchmark]: Toolchain (without parser) took 8743.08ms. Allocated memory was 176.2MB in the beginning and 259.0MB in the end (delta: 82.8MB). Free memory was 110.3MB in the beginning and 165.9MB in the end (delta: -55.6MB). Peak memory consumption was 124.0MB. Max. memory is 8.0GB. [2023-12-15 21:06:24,038 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 176.2MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:06:24,039 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.87ms. Allocated memory is still 176.2MB. Free memory was 110.0MB in the beginning and 98.4MB in the end (delta: 11.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-15 21:06:24,039 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.46ms. Allocated memory is still 176.2MB. Free memory was 98.4MB in the beginning and 96.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 21:06:24,039 INFO L158 Benchmark]: Boogie Preprocessor took 63.63ms. Allocated memory was 176.2MB in the beginning and 211.8MB in the end (delta: 35.7MB). Free memory was 96.2MB in the beginning and 179.1MB in the end (delta: -82.9MB). Peak memory consumption was 6.2MB. Max. memory is 8.0GB. [2023-12-15 21:06:24,042 INFO L158 Benchmark]: RCFGBuilder took 424.31ms. Allocated memory is still 211.8MB. Free memory was 179.0MB in the beginning and 168.0MB in the end (delta: 11.0MB). Peak memory consumption was 13.4MB. Max. memory is 8.0GB. [2023-12-15 21:06:24,042 INFO L158 Benchmark]: TraceAbstraction took 8023.29ms. Allocated memory was 211.8MB in the beginning and 259.0MB in the end (delta: 47.2MB). Free memory was 166.9MB in the beginning and 165.9MB in the end (delta: 1.1MB). Peak memory consumption was 144.2MB. Max. memory is 8.0GB. [2023-12-15 21:06:24,045 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.12ms. Allocated memory is still 176.2MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 200.87ms. Allocated memory is still 176.2MB. Free memory was 110.0MB in the beginning and 98.4MB in the end (delta: 11.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.46ms. Allocated memory is still 176.2MB. Free memory was 98.4MB in the beginning and 96.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 63.63ms. Allocated memory was 176.2MB in the beginning and 211.8MB in the end (delta: 35.7MB). Free memory was 96.2MB in the beginning and 179.1MB in the end (delta: -82.9MB). Peak memory consumption was 6.2MB. Max. memory is 8.0GB. * RCFGBuilder took 424.31ms. Allocated memory is still 211.8MB. Free memory was 179.0MB in the beginning and 168.0MB in the end (delta: 11.0MB). Peak memory consumption was 13.4MB. Max. memory is 8.0GB. * TraceAbstraction took 8023.29ms. Allocated memory was 211.8MB in the beginning and 259.0MB in the end (delta: 47.2MB). Free memory was 166.9MB in the beginning and 165.9MB in the end (delta: 1.1MB). Peak memory consumption was 144.2MB. 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.0s, OverallIterations: 19, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 784 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 750 mSDsluCounter, 5266 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3765 mSDsCounter, 134 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2212 IncrementalHoareTripleChecker+Invalid, 2346 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 134 mSolverCounterUnsat, 1501 mSDtfsCounter, 2212 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 895 GetRequests, 771 SyntacticMatches, 2 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=175occurred in iteration=17, InterpolantAutomatonStates: 136, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 329 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 353 PreInvPairs, 409 NumberOfFragments, 275 HoareAnnotationTreeSize, 353 FormulaSimplifications, 154424 FormulaSimplificationTreeSizeReduction, 1.4s HoareSimplificationTime, 16 FormulaSimplificationsInter, 3004 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1858 NumberOfCodeBlocks, 1858 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1933 ConstructedInterpolants, 0 QuantifiedInterpolants, 3901 SizeOfPredicates, 17 NumberOfNonLiveVariables, 229 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 21 InterpolantComputations, 18 PerfectInterpolantSequences, 7620/7644 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 79]: Loop Invariant Derived loop invariant: (((var_1_1 == var_1_8) && (var_1_7 == ((var_1_7 / 256) * 256))) || ((((var_1_7 % 256) == 0) && ((var_1_1 % 256) == 0)) && ((var_1_3 + 1) <= var_1_2))) RESULT: Ultimate proved your program to be correct! [2023-12-15 21:06:24,077 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...