/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-3.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 04:28:07,578 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 04:28:07,621 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-16 04:28:07,624 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 04:28:07,624 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 04:28:07,638 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 04:28:07,639 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 04:28:07,639 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 04:28:07,639 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 04:28:07,640 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 04:28:07,640 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 04:28:07,640 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 04:28:07,640 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 04:28:07,641 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 04:28:07,641 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 04:28:07,641 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 04:28:07,641 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 04:28:07,642 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 04:28:07,642 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 04:28:07,642 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 04:28:07,642 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 04:28:07,643 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 04:28:07,643 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 04:28:07,643 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 04:28:07,643 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 04:28:07,643 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 04:28:07,643 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 04:28:07,644 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 04:28:07,644 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 04:28:07,644 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 04:28:07,644 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 04:28:07,644 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 04:28:07,644 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:28:07,645 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 04:28:07,645 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 04:28:07,645 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 04:28:07,645 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 04:28:07,646 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 04:28:07,646 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 04:28:07,646 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 04:28:07,646 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 04:28:07,646 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 04:28:07,647 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 04:28:07,647 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-16 04:28:07,839 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 04:28:07,862 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 04:28:07,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 04:28:07,865 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 04:28:07,865 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 04:28:07,866 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-3.i [2023-12-16 04:28:08,932 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 04:28:09,078 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 04:28:09,078 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-3.i [2023-12-16 04:28:09,084 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d061e4e78/39f2327a58574623883822dc87fdd2b0/FLAGaaca62682 [2023-12-16 04:28:09,097 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d061e4e78/39f2327a58574623883822dc87fdd2b0 [2023-12-16 04:28:09,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 04:28:09,100 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 04:28:09,102 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 04:28:09,103 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 04:28:09,106 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 04:28:09,107 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:28:09" (1/1) ... [2023-12-16 04:28:09,107 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66d9f6f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:28:09, skipping insertion in model container [2023-12-16 04:28:09,107 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:28:09" (1/1) ... [2023-12-16 04:28:09,134 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 04:28:09,255 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-3.i[915,928] [2023-12-16 04:28:09,311 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:28:09,322 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 04:28:09,330 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-3.i[915,928] [2023-12-16 04:28:09,370 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:28:09,399 INFO L206 MainTranslator]: Completed translation [2023-12-16 04:28:09,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:28:09 WrapperNode [2023-12-16 04:28:09,401 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 04:28:09,402 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 04:28:09,405 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 04:28:09,405 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 04:28:09,410 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:28:09" (1/1) ... [2023-12-16 04:28:09,423 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:28:09" (1/1) ... [2023-12-16 04:28:09,453 INFO L138 Inliner]: procedures = 29, calls = 179, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 625 [2023-12-16 04:28:09,453 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 04:28:09,454 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 04:28:09,454 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 04:28:09,454 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 04:28:09,462 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:28:09" (1/1) ... [2023-12-16 04:28:09,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:28:09" (1/1) ... [2023-12-16 04:28:09,467 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:28:09" (1/1) ... [2023-12-16 04:28:09,481 INFO L175 MemorySlicer]: Split 151 memory accesses to 2 slices as follows [2, 149]. 99 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 14]. The 17 writes are split as follows [0, 17]. [2023-12-16 04:28:09,481 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:28:09" (1/1) ... [2023-12-16 04:28:09,481 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:28:09" (1/1) ... [2023-12-16 04:28:09,496 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:28:09" (1/1) ... [2023-12-16 04:28:09,514 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:28:09" (1/1) ... [2023-12-16 04:28:09,516 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:28:09" (1/1) ... [2023-12-16 04:28:09,518 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:28:09" (1/1) ... [2023-12-16 04:28:09,537 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 04:28:09,538 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 04:28:09,539 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 04:28:09,539 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 04:28:09,539 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:28:09" (1/1) ... [2023-12-16 04:28:09,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:28:09,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:28:09,573 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-16 04:28:09,612 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-16 04:28:09,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 04:28:09,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-16 04:28:09,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-16 04:28:09,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-16 04:28:09,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-16 04:28:09,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-16 04:28:09,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-16 04:28:09,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-16 04:28:09,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-16 04:28:09,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-16 04:28:09,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-16 04:28:09,623 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 04:28:09,623 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 04:28:09,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 04:28:09,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-16 04:28:09,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 04:28:09,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 04:28:09,759 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 04:28:09,760 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 04:28:10,238 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 04:28:10,270 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 04:28:10,271 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 04:28:10,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:28:10 BoogieIcfgContainer [2023-12-16 04:28:10,271 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 04:28:10,273 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 04:28:10,273 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 04:28:10,275 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 04:28:10,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:28:09" (1/3) ... [2023-12-16 04:28:10,277 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54f584ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:28:10, skipping insertion in model container [2023-12-16 04:28:10,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:28:09" (2/3) ... [2023-12-16 04:28:10,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54f584ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:28:10, skipping insertion in model container [2023-12-16 04:28:10,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:28:10" (3/3) ... [2023-12-16 04:28:10,282 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-3.i [2023-12-16 04:28:10,295 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 04:28:10,295 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 04:28:10,340 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 04:28:10,345 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;@451bb5a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 04:28:10,345 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 04:28:10,349 INFO L276 IsEmpty]: Start isEmpty. Operand has 142 states, 123 states have (on average 1.4878048780487805) internal successors, (183), 124 states have internal predecessors, (183), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 04:28:10,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-16 04:28:10,361 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:28:10,362 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:28:10,362 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:28:10,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:28:10,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1423285154, now seen corresponding path program 1 times [2023-12-16 04:28:10,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:28:10,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156945563] [2023-12-16 04:28:10,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:28:10,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:28:10,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:10,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:28:10,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:10,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:28:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:10,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:28:10,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:10,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:28:10,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:10,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:28:10,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:10,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:28:10,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:10,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:28:10,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:10,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:28:10,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:10,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:28:10,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:10,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:28:10,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:10,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:28:10,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:10,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:28:10,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:10,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:28:10,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:10,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:28:10,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:10,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:28:10,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:10,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:28:10,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:10,665 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 04:28:10,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:28:10,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156945563] [2023-12-16 04:28:10,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156945563] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:28:10,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:28:10,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 04:28:10,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606586518] [2023-12-16 04:28:10,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:28:10,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 04:28:10,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:28:10,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 04:28:10,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 04:28:10,721 INFO L87 Difference]: Start difference. First operand has 142 states, 123 states have (on average 1.4878048780487805) internal successors, (183), 124 states have internal predecessors, (183), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-16 04:28:10,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:28:10,769 INFO L93 Difference]: Finished difference Result 281 states and 444 transitions. [2023-12-16 04:28:10,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 04:28:10,771 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2023-12-16 04:28:10,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:28:10,777 INFO L225 Difference]: With dead ends: 281 [2023-12-16 04:28:10,777 INFO L226 Difference]: Without dead ends: 140 [2023-12-16 04:28:10,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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-16 04:28:10,782 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:28:10,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 206 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:28:10,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-12-16 04:28:10,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2023-12-16 04:28:10,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 122 states have (on average 1.459016393442623) internal successors, (178), 122 states have internal predecessors, (178), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 04:28:10,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 210 transitions. [2023-12-16 04:28:10,827 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 210 transitions. Word has length 128 [2023-12-16 04:28:10,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:28:10,828 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 210 transitions. [2023-12-16 04:28:10,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-16 04:28:10,828 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 210 transitions. [2023-12-16 04:28:10,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-16 04:28:10,830 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:28:10,830 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:28:10,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 04:28:10,830 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:28:10,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:28:10,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1876476474, now seen corresponding path program 1 times [2023-12-16 04:28:10,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:28:10,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385511138] [2023-12-16 04:28:10,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:28:10,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:28:10,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:28:11,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:28:11,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:28:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:28:11,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:28:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:28:11,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:28:11,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:28:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:28:11,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:28:11,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:28:11,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:28:11,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:28:11,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:28:11,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:28:11,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:28:11,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,059 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 04:28:11,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:28:11,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385511138] [2023-12-16 04:28:11,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385511138] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:28:11,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:28:11,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:28:11,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158370739] [2023-12-16 04:28:11,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:28:11,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:28:11,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:28:11,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:28:11,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:28:11,062 INFO L87 Difference]: Start difference. First operand 140 states and 210 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-16 04:28:11,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:28:11,111 INFO L93 Difference]: Finished difference Result 285 states and 428 transitions. [2023-12-16 04:28:11,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:28:11,112 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2023-12-16 04:28:11,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:28:11,113 INFO L225 Difference]: With dead ends: 285 [2023-12-16 04:28:11,113 INFO L226 Difference]: Without dead ends: 146 [2023-12-16 04:28:11,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:28:11,114 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 10 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:28:11,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 610 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:28:11,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-12-16 04:28:11,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 142. [2023-12-16 04:28:11,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 124 states have (on average 1.4516129032258065) internal successors, (180), 124 states have internal predecessors, (180), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 04:28:11,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 212 transitions. [2023-12-16 04:28:11,123 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 212 transitions. Word has length 128 [2023-12-16 04:28:11,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:28:11,124 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 212 transitions. [2023-12-16 04:28:11,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-16 04:28:11,124 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 212 transitions. [2023-12-16 04:28:11,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-16 04:28:11,125 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:28:11,126 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:28:11,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 04:28:11,126 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:28:11,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:28:11,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1482109688, now seen corresponding path program 1 times [2023-12-16 04:28:11,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:28:11,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128201580] [2023-12-16 04:28:11,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:28:11,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:28:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:28:11,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:28:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:28:11,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:28:11,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:28:11,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:28:11,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:28:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:28:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:28:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:28:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:28:11,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:28:11,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:28:11,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:28:11,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:28:11,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:28:11,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,369 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 04:28:11,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:28:11,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128201580] [2023-12-16 04:28:11,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128201580] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:28:11,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:28:11,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:28:11,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260964103] [2023-12-16 04:28:11,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:28:11,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:28:11,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:28:11,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:28:11,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:28:11,376 INFO L87 Difference]: Start difference. First operand 142 states and 212 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:28:11,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:28:11,425 INFO L93 Difference]: Finished difference Result 321 states and 481 transitions. [2023-12-16 04:28:11,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:28:11,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 128 [2023-12-16 04:28:11,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:28:11,430 INFO L225 Difference]: With dead ends: 321 [2023-12-16 04:28:11,430 INFO L226 Difference]: Without dead ends: 180 [2023-12-16 04:28:11,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:28:11,435 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 67 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:28:11,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 696 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:28:11,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-12-16 04:28:11,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 144. [2023-12-16 04:28:11,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 126 states have (on average 1.4444444444444444) internal successors, (182), 126 states have internal predecessors, (182), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 04:28:11,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 214 transitions. [2023-12-16 04:28:11,458 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 214 transitions. Word has length 128 [2023-12-16 04:28:11,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:28:11,458 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 214 transitions. [2023-12-16 04:28:11,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:28:11,458 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 214 transitions. [2023-12-16 04:28:11,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-16 04:28:11,460 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:28:11,460 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:28:11,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 04:28:11,460 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:28:11,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:28:11,460 INFO L85 PathProgramCache]: Analyzing trace with hash -2009217034, now seen corresponding path program 1 times [2023-12-16 04:28:11,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:28:11,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841550494] [2023-12-16 04:28:11,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:28:11,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:28:11,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:28:11,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:28:11,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:28:11,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:28:11,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:28:11,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:28:11,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:28:11,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:28:11,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:28:11,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:28:11,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:28:11,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:28:11,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:28:11,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:28:11,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:28:11,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:28:11,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:11,623 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 04:28:11,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:28:11,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841550494] [2023-12-16 04:28:11,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841550494] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:28:11,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:28:11,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 04:28:11,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499942623] [2023-12-16 04:28:11,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:28:11,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 04:28:11,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:28:11,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 04:28:11,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:28:11,625 INFO L87 Difference]: Start difference. First operand 144 states and 214 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:28:11,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:28:11,650 INFO L93 Difference]: Finished difference Result 363 states and 541 transitions. [2023-12-16 04:28:11,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 04:28:11,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 130 [2023-12-16 04:28:11,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:28:11,653 INFO L225 Difference]: With dead ends: 363 [2023-12-16 04:28:11,653 INFO L226 Difference]: Without dead ends: 220 [2023-12-16 04:28:11,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-16 04:28:11,662 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 111 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:28:11,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 399 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:28:11,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2023-12-16 04:28:11,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 176. [2023-12-16 04:28:11,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 158 states have (on average 1.4620253164556962) internal successors, (231), 158 states have internal predecessors, (231), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 04:28:11,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 263 transitions. [2023-12-16 04:28:11,675 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 263 transitions. Word has length 130 [2023-12-16 04:28:11,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:28:11,676 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 263 transitions. [2023-12-16 04:28:11,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:28:11,676 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 263 transitions. [2023-12-16 04:28:11,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-16 04:28:11,677 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:28:11,677 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:28:11,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 04:28:11,677 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:28:11,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:28:11,677 INFO L85 PathProgramCache]: Analyzing trace with hash -661739891, now seen corresponding path program 1 times [2023-12-16 04:28:11,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:28:11,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541332903] [2023-12-16 04:28:11,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:28:11,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:28:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:12,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:28:12,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:12,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:28:12,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:12,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:28:12,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:12,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:28:12,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:12,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:28:12,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:12,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:28:12,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:12,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:28:12,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:12,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:28:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:12,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:28:12,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:12,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:28:12,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:12,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:28:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:12,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:28:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:12,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:28:12,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:12,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:28:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:12,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:28:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:12,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:28:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:12,475 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 04:28:12,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:28:12,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541332903] [2023-12-16 04:28:12,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541332903] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:28:12,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:28:12,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:28:12,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773199411] [2023-12-16 04:28:12,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:28:12,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:28:12,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:28:12,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:28:12,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:28:12,477 INFO L87 Difference]: Start difference. First operand 176 states and 263 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:28:12,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:28:12,743 INFO L93 Difference]: Finished difference Result 526 states and 787 transitions. [2023-12-16 04:28:12,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 04:28:12,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 130 [2023-12-16 04:28:12,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:28:12,746 INFO L225 Difference]: With dead ends: 526 [2023-12-16 04:28:12,746 INFO L226 Difference]: Without dead ends: 351 [2023-12-16 04:28:12,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:28:12,748 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 154 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:28:12,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 529 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:28:12,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2023-12-16 04:28:12,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 343. [2023-12-16 04:28:12,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 308 states have (on average 1.4545454545454546) internal successors, (448), 308 states have internal predecessors, (448), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-16 04:28:12,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 512 transitions. [2023-12-16 04:28:12,768 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 512 transitions. Word has length 130 [2023-12-16 04:28:12,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:28:12,769 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 512 transitions. [2023-12-16 04:28:12,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:28:12,769 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 512 transitions. [2023-12-16 04:28:12,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-16 04:28:12,770 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:28:12,770 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:28:12,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 04:28:12,771 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:28:12,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:28:12,771 INFO L85 PathProgramCache]: Analyzing trace with hash -2048916795, now seen corresponding path program 1 times [2023-12-16 04:28:12,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:28:12,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679433801] [2023-12-16 04:28:12,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:28:12,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:28:12,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:13,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:28:13,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:13,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:28:13,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:13,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:28:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:13,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:28:13,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:13,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:28:13,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:13,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:28:13,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:13,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:28:13,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:13,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:28:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:13,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:28:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:13,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:28:13,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:13,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:28:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:13,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:28:13,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:13,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:28:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:13,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:28:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:13,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:28:13,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:13,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:28:13,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:13,989 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 04:28:13,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:28:13,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679433801] [2023-12-16 04:28:13,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679433801] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:28:13,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:28:13,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:28:13,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992269354] [2023-12-16 04:28:13,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:28:13,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:28:13,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:28:13,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:28:13,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:28:13,991 INFO L87 Difference]: Start difference. First operand 343 states and 512 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:28:14,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:28:14,342 INFO L93 Difference]: Finished difference Result 658 states and 981 transitions. [2023-12-16 04:28:14,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 04:28:14,343 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2023-12-16 04:28:14,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:28:14,345 INFO L225 Difference]: With dead ends: 658 [2023-12-16 04:28:14,345 INFO L226 Difference]: Without dead ends: 483 [2023-12-16 04:28:14,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:28:14,346 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 244 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:28:14,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 945 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:28:14,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2023-12-16 04:28:14,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 450. [2023-12-16 04:28:14,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 410 states have (on average 1.4585365853658536) internal successors, (598), 411 states have internal predecessors, (598), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-16 04:28:14,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 670 transitions. [2023-12-16 04:28:14,372 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 670 transitions. Word has length 131 [2023-12-16 04:28:14,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:28:14,373 INFO L495 AbstractCegarLoop]: Abstraction has 450 states and 670 transitions. [2023-12-16 04:28:14,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:28:14,373 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 670 transitions. [2023-12-16 04:28:14,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-16 04:28:14,374 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:28:14,374 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:28:14,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 04:28:14,375 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:28:14,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:28:14,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1808160039, now seen corresponding path program 1 times [2023-12-16 04:28:14,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:28:14,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761688917] [2023-12-16 04:28:14,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:28:14,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:28:14,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:14,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:28:14,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:14,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:28:14,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:14,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:28:14,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:14,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:28:14,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:14,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:28:14,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:14,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:28:14,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:14,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:28:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:14,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:28:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:14,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:28:14,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:14,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:28:14,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:14,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:28:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:14,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:28:14,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:14,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:28:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:14,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:28:14,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:14,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:28:14,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:14,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:28:14,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:14,946 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 04:28:14,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:28:14,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761688917] [2023-12-16 04:28:14,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761688917] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:28:14,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:28:14,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:28:14,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057843753] [2023-12-16 04:28:14,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:28:14,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:28:14,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:28:14,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:28:14,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:28:14,948 INFO L87 Difference]: Start difference. First operand 450 states and 670 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:28:15,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:28:15,184 INFO L93 Difference]: Finished difference Result 939 states and 1399 transitions. [2023-12-16 04:28:15,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 04:28:15,184 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 132 [2023-12-16 04:28:15,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:28:15,187 INFO L225 Difference]: With dead ends: 939 [2023-12-16 04:28:15,187 INFO L226 Difference]: Without dead ends: 490 [2023-12-16 04:28:15,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:28:15,189 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 199 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:28:15,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 548 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:28:15,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2023-12-16 04:28:15,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 450. [2023-12-16 04:28:15,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 410 states have (on average 1.4560975609756097) internal successors, (597), 411 states have internal predecessors, (597), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-16 04:28:15,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 669 transitions. [2023-12-16 04:28:15,201 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 669 transitions. Word has length 132 [2023-12-16 04:28:15,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:28:15,201 INFO L495 AbstractCegarLoop]: Abstraction has 450 states and 669 transitions. [2023-12-16 04:28:15,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:28:15,202 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 669 transitions. [2023-12-16 04:28:15,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-16 04:28:15,203 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:28:15,203 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:28:15,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 04:28:15,203 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:28:15,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:28:15,204 INFO L85 PathProgramCache]: Analyzing trace with hash -22174193, now seen corresponding path program 1 times [2023-12-16 04:28:15,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:28:15,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941356653] [2023-12-16 04:28:15,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:28:15,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:28:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:28:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:28:15,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:28:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:28:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:28:15,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:28:15,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:28:15,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:28:15,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:28:15,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:28:15,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:28:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:28:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:28:15,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:28:15,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:28:15,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:28:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,335 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 04:28:15,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:28:15,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941356653] [2023-12-16 04:28:15,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941356653] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:28:15,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:28:15,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:28:15,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001437726] [2023-12-16 04:28:15,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:28:15,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:28:15,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:28:15,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:28:15,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:28:15,336 INFO L87 Difference]: Start difference. First operand 450 states and 669 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:28:15,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:28:15,395 INFO L93 Difference]: Finished difference Result 1130 states and 1683 transitions. [2023-12-16 04:28:15,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 04:28:15,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 132 [2023-12-16 04:28:15,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:28:15,398 INFO L225 Difference]: With dead ends: 1130 [2023-12-16 04:28:15,398 INFO L226 Difference]: Without dead ends: 681 [2023-12-16 04:28:15,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:28:15,400 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 124 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:28:15,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 900 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:28:15,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2023-12-16 04:28:15,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 453. [2023-12-16 04:28:15,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 413 states have (on average 1.4527845036319613) internal successors, (600), 414 states have internal predecessors, (600), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-16 04:28:15,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 672 transitions. [2023-12-16 04:28:15,420 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 672 transitions. Word has length 132 [2023-12-16 04:28:15,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:28:15,420 INFO L495 AbstractCegarLoop]: Abstraction has 453 states and 672 transitions. [2023-12-16 04:28:15,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:28:15,420 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 672 transitions. [2023-12-16 04:28:15,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-16 04:28:15,421 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:28:15,421 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:28:15,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 04:28:15,422 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:28:15,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:28:15,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1508938874, now seen corresponding path program 1 times [2023-12-16 04:28:15,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:28:15,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477972092] [2023-12-16 04:28:15,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:28:15,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:28:15,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:28:15,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:28:15,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:28:15,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:28:15,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:28:15,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:28:15,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:28:15,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:28:15,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:28:15,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:28:15,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:28:15,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:28:15,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:28:15,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:28:15,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:28:15,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:28:15,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,539 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 04:28:15,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:28:15,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477972092] [2023-12-16 04:28:15,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477972092] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:28:15,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:28:15,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:28:15,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181229868] [2023-12-16 04:28:15,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:28:15,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:28:15,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:28:15,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:28:15,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:28:15,540 INFO L87 Difference]: Start difference. First operand 453 states and 672 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:28:15,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:28:15,576 INFO L93 Difference]: Finished difference Result 980 states and 1457 transitions. [2023-12-16 04:28:15,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:28:15,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2023-12-16 04:28:15,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:28:15,578 INFO L225 Difference]: With dead ends: 980 [2023-12-16 04:28:15,578 INFO L226 Difference]: Without dead ends: 528 [2023-12-16 04:28:15,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:28:15,580 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 144 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:28:15,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 765 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:28:15,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2023-12-16 04:28:15,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 462. [2023-12-16 04:28:15,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 422 states have (on average 1.4431279620853081) internal successors, (609), 423 states have internal predecessors, (609), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-16 04:28:15,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 681 transitions. [2023-12-16 04:28:15,589 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 681 transitions. Word has length 133 [2023-12-16 04:28:15,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:28:15,590 INFO L495 AbstractCegarLoop]: Abstraction has 462 states and 681 transitions. [2023-12-16 04:28:15,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:28:15,590 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 681 transitions. [2023-12-16 04:28:15,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-16 04:28:15,591 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:28:15,591 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:28:15,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-16 04:28:15,591 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:28:15,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:28:15,591 INFO L85 PathProgramCache]: Analyzing trace with hash -253814581, now seen corresponding path program 1 times [2023-12-16 04:28:15,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:28:15,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739752818] [2023-12-16 04:28:15,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:28:15,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:28:15,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:28:15,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:28:15,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:28:15,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:28:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:28:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:28:15,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:28:15,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:28:15,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:28:15,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:28:15,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:28:15,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:28:15,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:28:15,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:28:15,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:28:15,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:28:15,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:15,967 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 04:28:15,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:28:15,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739752818] [2023-12-16 04:28:15,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739752818] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:28:15,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:28:15,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:28:15,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871450048] [2023-12-16 04:28:15,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:28:15,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:28:15,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:28:15,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:28:15,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:28:15,968 INFO L87 Difference]: Start difference. First operand 462 states and 681 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:28:16,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:28:16,446 INFO L93 Difference]: Finished difference Result 994 states and 1469 transitions. [2023-12-16 04:28:16,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:28:16,447 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2023-12-16 04:28:16,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:28:16,449 INFO L225 Difference]: With dead ends: 994 [2023-12-16 04:28:16,449 INFO L226 Difference]: Without dead ends: 704 [2023-12-16 04:28:16,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-16 04:28:16,451 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 472 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 04:28:16,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 559 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 04:28:16,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2023-12-16 04:28:16,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 628. [2023-12-16 04:28:16,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 571 states have (on average 1.4413309982486866) internal successors, (823), 572 states have internal predecessors, (823), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2023-12-16 04:28:16,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 927 transitions. [2023-12-16 04:28:16,482 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 927 transitions. Word has length 133 [2023-12-16 04:28:16,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:28:16,482 INFO L495 AbstractCegarLoop]: Abstraction has 628 states and 927 transitions. [2023-12-16 04:28:16,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:28:16,482 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 927 transitions. [2023-12-16 04:28:16,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-16 04:28:16,483 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:28:16,483 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:28:16,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-16 04:28:16,483 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:28:16,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:28:16,484 INFO L85 PathProgramCache]: Analyzing trace with hash 171017055, now seen corresponding path program 1 times [2023-12-16 04:28:16,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:28:16,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034921554] [2023-12-16 04:28:16,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:28:16,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:28:16,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:16,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:28:16,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:16,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:28:16,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:16,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:28:16,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:16,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:28:16,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:16,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:28:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:16,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:28:16,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:16,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:28:16,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:16,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:28:16,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:16,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:28:16,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:16,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:28:16,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:16,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:28:16,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:16,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:28:16,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:16,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:28:16,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:16,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:28:16,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:16,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:28:16,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:16,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:28:16,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:16,804 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 04:28:16,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:28:16,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034921554] [2023-12-16 04:28:16,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034921554] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:28:16,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:28:16,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:28:16,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892117378] [2023-12-16 04:28:16,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:28:16,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:28:16,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:28:16,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:28:16,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:28:16,806 INFO L87 Difference]: Start difference. First operand 628 states and 927 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:28:17,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:28:17,223 INFO L93 Difference]: Finished difference Result 1333 states and 1968 transitions. [2023-12-16 04:28:17,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:28:17,223 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2023-12-16 04:28:17,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:28:17,226 INFO L225 Difference]: With dead ends: 1333 [2023-12-16 04:28:17,226 INFO L226 Difference]: Without dead ends: 819 [2023-12-16 04:28:17,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:28:17,227 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 472 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:28:17,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 448 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:28:17,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2023-12-16 04:28:17,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 741. [2023-12-16 04:28:17,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 666 states have (on average 1.424924924924925) internal successors, (949), 667 states have internal predecessors, (949), 68 states have call successors, (68), 6 states have call predecessors, (68), 6 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-16 04:28:17,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1085 transitions. [2023-12-16 04:28:17,244 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1085 transitions. Word has length 133 [2023-12-16 04:28:17,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:28:17,245 INFO L495 AbstractCegarLoop]: Abstraction has 741 states and 1085 transitions. [2023-12-16 04:28:17,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:28:17,245 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1085 transitions. [2023-12-16 04:28:17,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-16 04:28:17,246 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:28:17,246 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:28:17,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-16 04:28:17,246 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:28:17,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:28:17,246 INFO L85 PathProgramCache]: Analyzing trace with hash -159753555, now seen corresponding path program 1 times [2023-12-16 04:28:17,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:28:17,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156250360] [2023-12-16 04:28:17,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:28:17,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:28:17,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:18,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:28:18,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:18,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:28:18,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:18,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:28:18,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:18,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:28:18,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:18,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:28:18,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:18,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:28:18,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:18,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:28:18,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:18,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:28:18,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:18,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:28:18,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:18,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:28:18,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:18,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:28:18,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:18,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:28:18,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:18,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:28:18,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:18,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:28:18,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:18,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:28:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:18,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:28:18,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:18,324 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 04:28:18,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:28:18,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156250360] [2023-12-16 04:28:18,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156250360] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:28:18,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:28:18,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-16 04:28:18,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545408158] [2023-12-16 04:28:18,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:28:18,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 04:28:18,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:28:18,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 04:28:18,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2023-12-16 04:28:18,326 INFO L87 Difference]: Start difference. First operand 741 states and 1085 transitions. Second operand has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-16 04:28:19,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:28:19,347 INFO L93 Difference]: Finished difference Result 1929 states and 2818 transitions. [2023-12-16 04:28:19,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-16 04:28:19,347 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 134 [2023-12-16 04:28:19,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:28:19,351 INFO L225 Difference]: With dead ends: 1929 [2023-12-16 04:28:19,351 INFO L226 Difference]: Without dead ends: 1189 [2023-12-16 04:28:19,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2023-12-16 04:28:19,353 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 440 mSDsluCounter, 1650 mSDsCounter, 0 mSdLazyCounter, 1624 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 1882 SdHoareTripleChecker+Invalid, 1636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-16 04:28:19,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 1882 Invalid, 1636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1624 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-16 04:28:19,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2023-12-16 04:28:19,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 970. [2023-12-16 04:28:19,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 885 states have (on average 1.4259887005649718) internal successors, (1262), 888 states have internal predecessors, (1262), 76 states have call successors, (76), 8 states have call predecessors, (76), 8 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2023-12-16 04:28:19,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1414 transitions. [2023-12-16 04:28:19,381 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1414 transitions. Word has length 134 [2023-12-16 04:28:19,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:28:19,382 INFO L495 AbstractCegarLoop]: Abstraction has 970 states and 1414 transitions. [2023-12-16 04:28:19,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-16 04:28:19,382 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1414 transitions. [2023-12-16 04:28:19,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-16 04:28:19,383 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:28:19,383 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:28:19,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-16 04:28:19,384 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:28:19,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:28:19,384 INFO L85 PathProgramCache]: Analyzing trace with hash -552780565, now seen corresponding path program 1 times [2023-12-16 04:28:19,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:28:19,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075809696] [2023-12-16 04:28:19,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:28:19,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:28:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:19,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:28:19,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:19,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:28:19,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:19,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:28:19,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:19,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:28:19,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:19,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:28:19,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:19,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:28:19,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:19,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:28:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:19,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:28:19,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:19,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:28:19,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:19,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:28:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:19,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:28:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:19,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:28:19,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:19,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:28:19,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:19,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:28:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:19,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:28:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:19,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:28:19,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:19,726 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 04:28:19,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:28:19,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075809696] [2023-12-16 04:28:19,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075809696] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:28:19,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:28:19,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:28:19,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487961181] [2023-12-16 04:28:19,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:28:19,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:28:19,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:28:19,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:28:19,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:28:19,727 INFO L87 Difference]: Start difference. First operand 970 states and 1414 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:28:20,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:28:20,053 INFO L93 Difference]: Finished difference Result 2202 states and 3202 transitions. [2023-12-16 04:28:20,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:28:20,053 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2023-12-16 04:28:20,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:28:20,057 INFO L225 Difference]: With dead ends: 2202 [2023-12-16 04:28:20,058 INFO L226 Difference]: Without dead ends: 1233 [2023-12-16 04:28:20,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 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-16 04:28:20,060 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 195 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:28:20,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 820 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:28:20,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2023-12-16 04:28:20,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1088. [2023-12-16 04:28:20,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 979 states have (on average 1.414708886618999) internal successors, (1385), 984 states have internal predecessors, (1385), 96 states have call successors, (96), 12 states have call predecessors, (96), 12 states have return successors, (96), 91 states have call predecessors, (96), 96 states have call successors, (96) [2023-12-16 04:28:20,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1577 transitions. [2023-12-16 04:28:20,099 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1577 transitions. Word has length 134 [2023-12-16 04:28:20,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:28:20,099 INFO L495 AbstractCegarLoop]: Abstraction has 1088 states and 1577 transitions. [2023-12-16 04:28:20,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:28:20,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1577 transitions. [2023-12-16 04:28:20,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-16 04:28:20,101 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:28:20,101 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:28:20,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-16 04:28:20,101 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:28:20,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:28:20,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1848697297, now seen corresponding path program 1 times [2023-12-16 04:28:20,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:28:20,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301819969] [2023-12-16 04:28:20,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:28:20,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:28:20,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:20,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:28:20,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:20,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:28:20,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:20,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:28:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:20,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:28:20,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:20,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:28:20,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:20,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:28:20,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:20,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:28:20,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:20,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:28:20,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:20,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:28:20,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:20,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:28:20,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:20,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:28:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:20,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:28:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:20,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:28:20,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:20,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:28:20,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:20,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:28:20,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:20,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:28:20,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:20,432 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 04:28:20,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:28:20,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301819969] [2023-12-16 04:28:20,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301819969] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:28:20,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:28:20,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:28:20,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663795006] [2023-12-16 04:28:20,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:28:20,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:28:20,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:28:20,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:28:20,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:28:20,433 INFO L87 Difference]: Start difference. First operand 1088 states and 1577 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:28:20,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:28:20,794 INFO L93 Difference]: Finished difference Result 2262 states and 3270 transitions. [2023-12-16 04:28:20,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:28:20,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2023-12-16 04:28:20,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:28:20,799 INFO L225 Difference]: With dead ends: 2262 [2023-12-16 04:28:20,800 INFO L226 Difference]: Without dead ends: 1183 [2023-12-16 04:28:20,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 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-16 04:28:20,802 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 220 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:28:20,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 779 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:28:20,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2023-12-16 04:28:20,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1088. [2023-12-16 04:28:20,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 981 states have (on average 1.4118246687054026) internal successors, (1385), 985 states have internal predecessors, (1385), 92 states have call successors, (92), 14 states have call predecessors, (92), 14 states have return successors, (92), 88 states have call predecessors, (92), 92 states have call successors, (92) [2023-12-16 04:28:20,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1569 transitions. [2023-12-16 04:28:20,837 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1569 transitions. Word has length 134 [2023-12-16 04:28:20,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:28:20,837 INFO L495 AbstractCegarLoop]: Abstraction has 1088 states and 1569 transitions. [2023-12-16 04:28:20,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:28:20,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1569 transitions. [2023-12-16 04:28:20,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-16 04:28:20,838 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:28:20,838 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:28:20,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-16 04:28:20,839 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:28:20,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:28:20,839 INFO L85 PathProgramCache]: Analyzing trace with hash 2053242989, now seen corresponding path program 1 times [2023-12-16 04:28:20,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:28:20,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571335476] [2023-12-16 04:28:20,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:28:20,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:28:20,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:21,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:28:21,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:21,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:28:21,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:21,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:28:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:21,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:28:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:21,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:28:21,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:21,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:28:21,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:21,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:28:21,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:21,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:28:21,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:21,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:28:21,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:21,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:28:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:21,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:28:21,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:21,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:28:21,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:21,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:28:21,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:21,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:28:21,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:21,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:28:21,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:21,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:28:21,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:21,770 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 04:28:21,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:28:21,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571335476] [2023-12-16 04:28:21,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571335476] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:28:21,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:28:21,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-16 04:28:21,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804364799] [2023-12-16 04:28:21,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:28:21,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-16 04:28:21,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:28:21,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-16 04:28:21,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-12-16 04:28:21,771 INFO L87 Difference]: Start difference. First operand 1088 states and 1569 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:28:22,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:28:22,583 INFO L93 Difference]: Finished difference Result 2268 states and 3264 transitions. [2023-12-16 04:28:22,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 04:28:22,583 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2023-12-16 04:28:22,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:28:22,587 INFO L225 Difference]: With dead ends: 2268 [2023-12-16 04:28:22,587 INFO L226 Difference]: Without dead ends: 1181 [2023-12-16 04:28:22,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2023-12-16 04:28:22,590 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 368 mSDsluCounter, 1552 mSDsCounter, 0 mSdLazyCounter, 1435 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 1794 SdHoareTripleChecker+Invalid, 1446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-16 04:28:22,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 1794 Invalid, 1446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1435 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-16 04:28:22,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2023-12-16 04:28:22,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 903. [2023-12-16 04:28:22,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 903 states, 814 states have (on average 1.414004914004914) internal successors, (1151), 816 states have internal predecessors, (1151), 76 states have call successors, (76), 12 states have call predecessors, (76), 12 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2023-12-16 04:28:22,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1303 transitions. [2023-12-16 04:28:22,623 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1303 transitions. Word has length 134 [2023-12-16 04:28:22,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:28:22,623 INFO L495 AbstractCegarLoop]: Abstraction has 903 states and 1303 transitions. [2023-12-16 04:28:22,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:28:22,623 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1303 transitions. [2023-12-16 04:28:22,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-16 04:28:22,625 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:28:22,625 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:28:22,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-16 04:28:22,625 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:28:22,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:28:22,626 INFO L85 PathProgramCache]: Analyzing trace with hash -493287894, now seen corresponding path program 1 times [2023-12-16 04:28:22,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:28:22,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198414211] [2023-12-16 04:28:22,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:28:22,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:28:22,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:22,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:28:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:22,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:28:22,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:22,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:28:22,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:22,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:28:22,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:22,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:28:22,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:22,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:28:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:22,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:28:22,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:22,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:28:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:22,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:28:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:22,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:28:22,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:22,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:28:22,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:22,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:28:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:22,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:28:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:22,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:28:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:22,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:28:22,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:22,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:28:22,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:22,695 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 04:28:22,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:28:22,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198414211] [2023-12-16 04:28:22,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198414211] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:28:22,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:28:22,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 04:28:22,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095323822] [2023-12-16 04:28:22,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:28:22,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 04:28:22,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:28:22,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 04:28:22,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:28:22,698 INFO L87 Difference]: Start difference. First operand 903 states and 1303 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:28:22,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:28:22,734 INFO L93 Difference]: Finished difference Result 1719 states and 2474 transitions. [2023-12-16 04:28:22,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 04:28:22,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2023-12-16 04:28:22,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:28:22,737 INFO L225 Difference]: With dead ends: 1719 [2023-12-16 04:28:22,737 INFO L226 Difference]: Without dead ends: 775 [2023-12-16 04:28:22,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-16 04:28:22,739 INFO L413 NwaCegarLoop]: 300 mSDtfsCounter, 102 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:28:22,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 489 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:28:22,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2023-12-16 04:28:22,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 635. [2023-12-16 04:28:22,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 574 states have (on average 1.3937282229965158) internal successors, (800), 575 states have internal predecessors, (800), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2023-12-16 04:28:22,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 904 transitions. [2023-12-16 04:28:22,775 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 904 transitions. Word has length 134 [2023-12-16 04:28:22,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:28:22,776 INFO L495 AbstractCegarLoop]: Abstraction has 635 states and 904 transitions. [2023-12-16 04:28:22,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:28:22,776 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 904 transitions. [2023-12-16 04:28:22,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-16 04:28:22,777 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:28:22,777 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:28:22,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-16 04:28:22,778 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:28:22,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:28:22,778 INFO L85 PathProgramCache]: Analyzing trace with hash -48657067, now seen corresponding path program 1 times [2023-12-16 04:28:22,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:28:22,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281994961] [2023-12-16 04:28:22,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:28:22,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:28:22,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:23,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:28:23,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:23,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:28:23,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:23,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:28:23,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:23,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:28:23,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:23,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:28:23,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:23,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:28:23,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:23,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:28:23,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:23,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:28:23,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:23,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:28:23,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:23,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:28:23,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:23,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:28:23,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:23,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:28:23,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:23,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:28:23,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:23,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:28:23,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:23,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:28:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:23,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:28:23,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:23,814 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 04:28:23,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:28:23,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281994961] [2023-12-16 04:28:23,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281994961] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:28:23,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:28:23,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-16 04:28:23,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707874828] [2023-12-16 04:28:23,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:28:23,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 04:28:23,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:28:23,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 04:28:23,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:28:23,815 INFO L87 Difference]: Start difference. First operand 635 states and 904 transitions. Second operand has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-16 04:28:24,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:28:24,817 INFO L93 Difference]: Finished difference Result 1439 states and 2060 transitions. [2023-12-16 04:28:24,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-16 04:28:24,817 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 135 [2023-12-16 04:28:24,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:28:24,820 INFO L225 Difference]: With dead ends: 1439 [2023-12-16 04:28:24,820 INFO L226 Difference]: Without dead ends: 1039 [2023-12-16 04:28:24,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=172, Invalid=428, Unknown=0, NotChecked=0, Total=600 [2023-12-16 04:28:24,821 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 820 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 04:28:24,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 1070 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 04:28:24,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2023-12-16 04:28:24,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 898. [2023-12-16 04:28:24,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 830 states have (on average 1.4048192771084338) internal successors, (1166), 833 states have internal predecessors, (1166), 56 states have call successors, (56), 11 states have call predecessors, (56), 11 states have return successors, (56), 53 states have call predecessors, (56), 56 states have call successors, (56) [2023-12-16 04:28:24,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1278 transitions. [2023-12-16 04:28:24,844 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1278 transitions. Word has length 135 [2023-12-16 04:28:24,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:28:24,844 INFO L495 AbstractCegarLoop]: Abstraction has 898 states and 1278 transitions. [2023-12-16 04:28:24,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-16 04:28:24,845 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1278 transitions. [2023-12-16 04:28:24,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-16 04:28:24,846 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:28:24,846 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:28:24,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-16 04:28:24,846 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:28:24,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:28:24,846 INFO L85 PathProgramCache]: Analyzing trace with hash 255361899, now seen corresponding path program 1 times [2023-12-16 04:28:24,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:28:24,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200146099] [2023-12-16 04:28:24,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:28:24,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:28:24,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:25,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:28:25,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:25,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:28:25,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:25,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:28:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:25,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:28:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:25,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:28:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:25,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:28:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:25,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:28:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:25,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:28:25,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:25,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:28:25,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:25,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:28:25,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:25,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:28:25,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:25,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:28:25,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:25,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:28:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:25,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:28:25,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:25,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:28:25,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:25,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:28:25,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:25,537 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 04:28:25,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:28:25,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200146099] [2023-12-16 04:28:25,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200146099] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:28:25,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:28:25,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:28:25,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555098074] [2023-12-16 04:28:25,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:28:25,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:28:25,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:28:25,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:28:25,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:28:25,539 INFO L87 Difference]: Start difference. First operand 898 states and 1278 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:28:25,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:28:25,830 INFO L93 Difference]: Finished difference Result 1880 states and 2691 transitions. [2023-12-16 04:28:25,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:28:25,831 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2023-12-16 04:28:25,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:28:25,836 INFO L225 Difference]: With dead ends: 1880 [2023-12-16 04:28:25,836 INFO L226 Difference]: Without dead ends: 1221 [2023-12-16 04:28:25,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:28:25,837 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 193 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:28:25,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 535 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:28:25,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2023-12-16 04:28:25,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 1065. [2023-12-16 04:28:25,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1065 states, 997 states have (on average 1.4092276830491475) internal successors, (1405), 1000 states have internal predecessors, (1405), 56 states have call successors, (56), 11 states have call predecessors, (56), 11 states have return successors, (56), 53 states have call predecessors, (56), 56 states have call successors, (56) [2023-12-16 04:28:25,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1517 transitions. [2023-12-16 04:28:25,872 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1517 transitions. Word has length 135 [2023-12-16 04:28:25,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:28:25,873 INFO L495 AbstractCegarLoop]: Abstraction has 1065 states and 1517 transitions. [2023-12-16 04:28:25,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:28:25,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1517 transitions. [2023-12-16 04:28:25,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-12-16 04:28:25,875 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:28:25,875 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:28:25,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-16 04:28:25,876 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:28:25,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:28:25,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1945718394, now seen corresponding path program 1 times [2023-12-16 04:28:25,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:28:25,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997956048] [2023-12-16 04:28:25,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:28:25,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:28:25,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:26,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:28:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:26,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:28:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:26,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:28:26,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:26,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:28:26,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:26,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:28:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:26,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:28:26,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:26,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:28:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:26,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:28:26,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:26,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:28:26,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:26,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:28:26,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:26,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:28:26,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:26,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:28:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:26,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:28:26,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:26,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:28:26,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:26,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:28:26,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:26,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:28:26,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:26,498 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-12-16 04:28:26,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:28:26,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997956048] [2023-12-16 04:28:26,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997956048] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:28:26,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880024415] [2023-12-16 04:28:26,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:28:26,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:28:26,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:28:26,514 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-16 04:28:26,529 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-16 04:28:26,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:26,756 INFO L262 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-16 04:28:26,767 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:28:26,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-12-16 04:28:26,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-12-16 04:28:26,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-12-16 04:28:27,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-12-16 04:28:27,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-12-16 04:28:27,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-12-16 04:28:27,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-12-16 04:28:27,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-12-16 04:28:27,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-12-16 04:28:27,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 58 [2023-12-16 04:28:27,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 72 [2023-12-16 04:28:27,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:28:27,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 34 [2023-12-16 04:28:27,307 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 165 proven. 36 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2023-12-16 04:28:27,307 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:28:27,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-12-16 04:28:27,870 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-12-16 04:28:27,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880024415] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:28:27,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:28:27,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 23 [2023-12-16 04:28:27,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823551832] [2023-12-16 04:28:27,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:28:27,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-16 04:28:27,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:28:27,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-16 04:28:27,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2023-12-16 04:28:27,872 INFO L87 Difference]: Start difference. First operand 1065 states and 1517 transitions. Second operand has 23 states, 20 states have (on average 7.1) internal successors, (142), 23 states have internal predecessors, (142), 8 states have call successors, (45), 3 states have call predecessors, (45), 6 states have return successors, (45), 5 states have call predecessors, (45), 8 states have call successors, (45) [2023-12-16 04:28:29,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:28:29,132 INFO L93 Difference]: Finished difference Result 2434 states and 3443 transitions. [2023-12-16 04:28:29,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-16 04:28:29,133 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 7.1) internal successors, (142), 23 states have internal predecessors, (142), 8 states have call successors, (45), 3 states have call predecessors, (45), 6 states have return successors, (45), 5 states have call predecessors, (45), 8 states have call successors, (45) Word has length 137 [2023-12-16 04:28:29,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:28:29,137 INFO L225 Difference]: With dead ends: 2434 [2023-12-16 04:28:29,137 INFO L226 Difference]: Without dead ends: 1382 [2023-12-16 04:28:29,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 297 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=297, Invalid=1263, Unknown=0, NotChecked=0, Total=1560 [2023-12-16 04:28:29,139 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 1413 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 1494 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1416 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 1659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 1494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:28:29,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1416 Valid, 965 Invalid, 1659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 1494 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-16 04:28:29,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2023-12-16 04:28:29,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 870. [2023-12-16 04:28:29,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 810 states have (on average 1.3987654320987655) internal successors, (1133), 810 states have internal predecessors, (1133), 48 states have call successors, (48), 11 states have call predecessors, (48), 11 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-16 04:28:29,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1229 transitions. [2023-12-16 04:28:29,175 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1229 transitions. Word has length 137 [2023-12-16 04:28:29,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:28:29,175 INFO L495 AbstractCegarLoop]: Abstraction has 870 states and 1229 transitions. [2023-12-16 04:28:29,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 7.1) internal successors, (142), 23 states have internal predecessors, (142), 8 states have call successors, (45), 3 states have call predecessors, (45), 6 states have return successors, (45), 5 states have call predecessors, (45), 8 states have call successors, (45) [2023-12-16 04:28:29,175 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1229 transitions. [2023-12-16 04:28:29,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-12-16 04:28:29,177 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:28:29,177 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:28:29,200 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-16 04:28:29,384 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-16 04:28:29,384 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:28:29,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:28:29,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1766298673, now seen corresponding path program 1 times [2023-12-16 04:28:29,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:28:29,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235103879] [2023-12-16 04:28:29,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:28:29,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:28:29,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:29,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:28:29,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:29,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:28:29,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:29,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:28:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:29,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:28:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:29,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:28:29,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:29,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:28:29,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:29,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:28:29,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:29,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:28:29,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:29,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:28:29,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:29,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:28:29,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:29,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:28:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:29,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:28:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:29,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:28:29,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:29,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:28:29,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:29,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:28:29,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:29,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:28:29,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:29,511 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 04:28:29,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:28:29,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235103879] [2023-12-16 04:28:29,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235103879] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:28:29,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:28:29,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:28:29,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636471852] [2023-12-16 04:28:29,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:28:29,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:28:29,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:28:29,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:28:29,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:28:29,513 INFO L87 Difference]: Start difference. First operand 870 states and 1229 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:28:29,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:28:29,791 INFO L93 Difference]: Finished difference Result 2272 states and 3206 transitions. [2023-12-16 04:28:29,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:28:29,792 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2023-12-16 04:28:29,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:28:29,795 INFO L225 Difference]: With dead ends: 2272 [2023-12-16 04:28:29,795 INFO L226 Difference]: Without dead ends: 1403 [2023-12-16 04:28:29,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 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-16 04:28:29,797 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 182 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:28:29,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 459 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:28:29,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2023-12-16 04:28:29,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 876. [2023-12-16 04:28:29,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 816 states have (on average 1.3958333333333333) internal successors, (1139), 816 states have internal predecessors, (1139), 48 states have call successors, (48), 11 states have call predecessors, (48), 11 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-16 04:28:29,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1235 transitions. [2023-12-16 04:28:29,826 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1235 transitions. Word has length 137 [2023-12-16 04:28:29,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:28:29,826 INFO L495 AbstractCegarLoop]: Abstraction has 876 states and 1235 transitions. [2023-12-16 04:28:29,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:28:29,826 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1235 transitions. [2023-12-16 04:28:29,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-12-16 04:28:29,827 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:28:29,827 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:28:29,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-16 04:28:29,827 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:28:29,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:28:29,827 INFO L85 PathProgramCache]: Analyzing trace with hash 723230289, now seen corresponding path program 1 times [2023-12-16 04:28:29,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:28:29,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014007194] [2023-12-16 04:28:29,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:28:29,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:28:29,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:30,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:28:30,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:30,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:28:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:30,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:28:30,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:30,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:28:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:30,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:28:30,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:30,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:28:30,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:30,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:28:30,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:30,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:28:30,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:30,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:28:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:30,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:28:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:30,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:28:30,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:30,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:28:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:30,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:28:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:30,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:28:30,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:30,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:28:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:30,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:28:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:30,282 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 04:28:30,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:28:30,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014007194] [2023-12-16 04:28:30,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014007194] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:28:30,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:28:30,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:28:30,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694934447] [2023-12-16 04:28:30,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:28:30,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:28:30,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:28:30,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:28:30,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:28:30,285 INFO L87 Difference]: Start difference. First operand 876 states and 1235 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:28:30,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:28:30,694 INFO L93 Difference]: Finished difference Result 1980 states and 2783 transitions. [2023-12-16 04:28:30,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 04:28:30,694 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2023-12-16 04:28:30,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:28:30,697 INFO L225 Difference]: With dead ends: 1980 [2023-12-16 04:28:30,697 INFO L226 Difference]: Without dead ends: 1105 [2023-12-16 04:28:30,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-16 04:28:30,699 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 235 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:28:30,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 695 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:28:30,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2023-12-16 04:28:30,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 936. [2023-12-16 04:28:30,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 936 states, 865 states have (on average 1.3907514450867051) internal successors, (1203), 866 states have internal predecessors, (1203), 56 states have call successors, (56), 14 states have call predecessors, (56), 14 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2023-12-16 04:28:30,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1315 transitions. [2023-12-16 04:28:30,727 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1315 transitions. Word has length 137 [2023-12-16 04:28:30,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:28:30,727 INFO L495 AbstractCegarLoop]: Abstraction has 936 states and 1315 transitions. [2023-12-16 04:28:30,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:28:30,727 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1315 transitions. [2023-12-16 04:28:30,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-16 04:28:30,728 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:28:30,728 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:28:30,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-16 04:28:30,729 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:28:30,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:28:30,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1735766333, now seen corresponding path program 1 times [2023-12-16 04:28:30,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:28:30,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027127715] [2023-12-16 04:28:30,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:28:30,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:28:30,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:31,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:28:31,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:31,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:28:31,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:31,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:28:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:31,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:28:31,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:31,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:28:31,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:31,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:28:31,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:31,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:28:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:31,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:28:31,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:31,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:28:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:31,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:28:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:31,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:28:31,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:31,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:28:31,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:31,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:28:31,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:31,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:28:31,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:31,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 04:28:31,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:31,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:28:31,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:28:31,356 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 04:28:31,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:28:31,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027127715] [2023-12-16 04:28:31,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027127715] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:28:31,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:28:31,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:28:31,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485844434] [2023-12-16 04:28:31,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:28:31,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:28:31,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:28:31,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:28:31,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:28:31,358 INFO L87 Difference]: Start difference. First operand 936 states and 1315 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:28:31,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:28:31,617 INFO L93 Difference]: Finished difference Result 1947 states and 2730 transitions. [2023-12-16 04:28:31,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:28:31,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2023-12-16 04:28:31,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:28:31,621 INFO L225 Difference]: With dead ends: 1947 [2023-12-16 04:28:31,621 INFO L226 Difference]: Without dead ends: 1012 [2023-12-16 04:28:31,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:28:31,623 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 129 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:28:31,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 489 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:28:31,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2023-12-16 04:28:31,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 928. [2023-12-16 04:28:31,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 857 states have (on average 1.3862310385064178) internal successors, (1188), 858 states have internal predecessors, (1188), 56 states have call successors, (56), 14 states have call predecessors, (56), 14 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2023-12-16 04:28:31,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1300 transitions. [2023-12-16 04:28:31,652 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1300 transitions. Word has length 138 [2023-12-16 04:28:31,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:28:31,653 INFO L495 AbstractCegarLoop]: Abstraction has 928 states and 1300 transitions. [2023-12-16 04:28:31,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 04:28:31,653 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1300 transitions. [2023-12-16 04:28:31,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-16 04:28:31,654 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:28:31,654 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:28:31,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-16 04:28:31,654 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:28:31,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:28:31,655 INFO L85 PathProgramCache]: Analyzing trace with hash 2039785299, now seen corresponding path program 1 times [2023-12-16 04:28:31,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:28:31,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856563493] [2023-12-16 04:28:31,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:28:31,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:28:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 04:28:31,700 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 04:28:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 04:28:31,786 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 04:28:31,786 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 04:28:31,787 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 04:28:31,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-16 04:28:31,790 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, 1, 1, 1, 1] [2023-12-16 04:28:31,793 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 04:28:31,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:28:31 BoogieIcfgContainer [2023-12-16 04:28:31,861 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 04:28:31,864 INFO L158 Benchmark]: Toolchain (without parser) took 22761.94ms. Allocated memory was 219.2MB in the beginning and 821.0MB in the end (delta: 601.9MB). Free memory was 165.7MB in the beginning and 669.9MB in the end (delta: -504.2MB). Peak memory consumption was 98.5MB. Max. memory is 8.0GB. [2023-12-16 04:28:31,866 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 176.2MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 04:28:31,867 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.46ms. Allocated memory is still 219.2MB. Free memory was 165.4MB in the beginning and 148.2MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-16 04:28:31,867 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.07ms. Allocated memory is still 219.2MB. Free memory was 148.2MB in the beginning and 143.7MB in the end (delta: 4.5MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-16 04:28:31,867 INFO L158 Benchmark]: Boogie Preprocessor took 83.18ms. Allocated memory is still 219.2MB. Free memory was 143.7MB in the beginning and 138.4MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-16 04:28:31,867 INFO L158 Benchmark]: RCFGBuilder took 732.92ms. Allocated memory is still 219.2MB. Free memory was 138.4MB in the beginning and 162.6MB in the end (delta: -24.2MB). Peak memory consumption was 22.8MB. Max. memory is 8.0GB. [2023-12-16 04:28:31,868 INFO L158 Benchmark]: TraceAbstraction took 21588.44ms. Allocated memory was 219.2MB in the beginning and 821.0MB in the end (delta: 601.9MB). Free memory was 162.1MB in the beginning and 669.9MB in the end (delta: -507.8MB). Peak memory consumption was 94.6MB. Max. memory is 8.0GB. [2023-12-16 04:28:31,868 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 176.2MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 299.46ms. Allocated memory is still 219.2MB. Free memory was 165.4MB in the beginning and 148.2MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.07ms. Allocated memory is still 219.2MB. Free memory was 148.2MB in the beginning and 143.7MB in the end (delta: 4.5MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 83.18ms. Allocated memory is still 219.2MB. Free memory was 143.7MB in the beginning and 138.4MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 732.92ms. Allocated memory is still 219.2MB. Free memory was 138.4MB in the beginning and 162.6MB in the end (delta: -24.2MB). Peak memory consumption was 22.8MB. Max. memory is 8.0GB. * TraceAbstraction took 21588.44ms. Allocated memory was 219.2MB in the beginning and 821.0MB in the end (delta: 601.9MB). Free memory was 162.1MB in the beginning and 669.9MB in the end (delta: -507.8MB). Peak memory consumption was 94.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 117, overapproximation of someUnaryDOUBLEoperation at line 51. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, -64, -5, 500, -5, -100, 1, 127.5, 15.75, -0.5, 5.25, 8.5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, -64, -5, 500, -5, -100, 1, 127.5, 15.75, -0.5, 5.25, 8.5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, -64, -5, 500, -5, -100, 1, 127.5, 15.75, -0.5, 5.25, 8.5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, -64, -5, 500, -5, -100, 1, 127.5, 15.75, -0.5, 5.25, 8.5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, -64, -5, 500, -5, -100, 1, 127.5, 15.75, -0.5, 5.25, 8.5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, -64, -5, 500, -5, -100, 1, 127.5, 15.75, -0.5, 5.25, 8.5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, -64, -5, 500, -5, -100, 1, 127.5, 15.75, -0.5, 5.25, 8.5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, -64, -5, 500, -5, -100, 1, 127.5, 15.75, -0.5, 5.25, 8.5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, -64, -5, 500, -5, -100, 1, 127.5, 15.75, -0.5, 5.25, 8.5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, -64, -5, 500, -5, -100, 1, 127.5, 15.75, -0.5, 5.25, 8.5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, -64, -5, 500, -5, -100, 1, 127.5, 15.75, -0.5, 5.25, 8.5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, -64, -5, 500, -5, -100, 1, 127.5, 15.75, -0.5, 5.25, 8.5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, -64, -5, 500, -5, -100, 1, 127.5, 15.75, -0.5, 5.25, 8.5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, -64, -5, 500, -5, -100, 1, 127.5, 15.75, -0.5, 5.25, 8.5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, -64, -5, 500, -5, -100, 1, 127.5, 15.75, -0.5, 5.25, 8.5 }; [L55] unsigned char last_1_WrapperStruct00_var_1_11 = 1; [L121] isInitial = 1 [L122] FCALL initially() [L123] COND TRUE 1 [L124] CALL updateLastVariables() [L114] EXPR WrapperStruct00.var_1_11 [L114] last_1_WrapperStruct00_var_1_11 = WrapperStruct00.var_1_11 [L124] RET updateLastVariables() [L125] CALL updateVariables() [L86] WrapperStruct00.var_1_4 = __VERIFIER_nondet_uchar() [L87] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L88] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L89] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L90] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L91] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L92] WrapperStruct00.var_1_7 = __VERIFIER_nondet_long() [L93] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= -1073741823) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= -1073741823) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L94] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 1073741823) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 1073741823) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L95] WrapperStruct00.var_1_8 = __VERIFIER_nondet_long() [L96] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= -1073741823) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= -1073741823) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L97] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 1073741823) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 1073741823) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L98] WrapperStruct00.var_1_9 = __VERIFIER_nondet_long() [L99] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= -536870912) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= -536870912) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L100] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 536870912) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 536870912) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L101] WrapperStruct00.var_1_10 = __VERIFIER_nondet_long() [L102] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= -536870911) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= -536870911) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L103] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 536870911) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 536870911) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L104] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L105] EXPR WrapperStruct00.var_1_13 [L105] EXPR WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L105] EXPR WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L105] EXPR WrapperStruct00.var_1_13 [L105] EXPR WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L105] EXPR (WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L105] EXPR (WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L105] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L105] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L106] WrapperStruct00.var_1_14 = __VERIFIER_nondet_double() [L107] EXPR WrapperStruct00.var_1_14 [L107] EXPR WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L107] EXPR WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F [L107] EXPR WrapperStruct00.var_1_14 [L107] EXPR WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L107] EXPR (WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L107] EXPR (WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L107] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L107] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L108] WrapperStruct00.var_1_15 = __VERIFIER_nondet_double() [L109] EXPR WrapperStruct00.var_1_15 [L109] EXPR WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L109] EXPR WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F [L109] EXPR WrapperStruct00.var_1_15 [L109] EXPR WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L109] EXPR (WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L109] EXPR (WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L109] CALL assume_abort_if_not((WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L109] RET assume_abort_if_not((WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L110] WrapperStruct00.var_1_16 = __VERIFIER_nondet_double() [L111] EXPR WrapperStruct00.var_1_16 [L111] EXPR WrapperStruct00.var_1_16 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L111] EXPR WrapperStruct00.var_1_16 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F [L111] EXPR WrapperStruct00.var_1_16 [L111] EXPR WrapperStruct00.var_1_16 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L111] EXPR (WrapperStruct00.var_1_16 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L111] EXPR (WrapperStruct00.var_1_16 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L111] CALL assume_abort_if_not((WrapperStruct00.var_1_16 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L111] RET assume_abort_if_not((WrapperStruct00.var_1_16 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L125] RET updateVariables() [L126] CALL step() [L59] unsigned char stepLocal_0 = last_1_WrapperStruct00_var_1_11; VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1, stepLocal_0=1] [L60] COND FALSE !(! last_1_WrapperStruct00_var_1_11) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L65] EXPR WrapperStruct00.var_1_7 [L65] signed long int stepLocal_2 = WrapperStruct00.var_1_7; [L66] EXPR WrapperStruct00.var_1_10 [L66] signed long int stepLocal_1 = WrapperStruct00.var_1_10; [L67] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L67] COND FALSE !(WrapperStruct00.var_1_8 <= stepLocal_2) [L74] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L74] COND FALSE !(! WrapperStruct00.var_1_11) [L77] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L77] EXPR ((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9) [L77] EXPR WrapperStruct00.var_1_9 [L77] EXPR ((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1, stepLocal_0=1, stepLocal_1=536870911, stepLocal_2=-1073741818] [L77] EXPR WrapperStruct00.var_1_10 [L77] EXPR WrapperStruct00.var_1_7 [L77] WrapperStruct00.var_1_6 = ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7) [L79] WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L79] COND FALSE !(WrapperStruct00.var_1_4) [L82] EXPR WrapperStruct00.var_1_15 [L82] WrapperStruct00.var_1_12 = WrapperStruct00.var_1_15 [L126] RET step() [L127] CALL, EXPR property() [L117] EXPR (! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1 [L117] EXPR (! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117] EXPR ((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117] EXPR ((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7)))) [L117] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117] EXPR (! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7))) [L117] EXPR WrapperStruct00.var_1_6 [L117] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117] EXPR ((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9) [L117] EXPR WrapperStruct00.var_1_9 [L117] EXPR ((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117] EXPR WrapperStruct00.var_1_10 [L117] EXPR WrapperStruct00.var_1_7 [L117] EXPR (! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117] EXPR ((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117] EXPR (((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_7) ? ((WrapperStruct00.var_1_10 >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((unsigned char) (! WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_1 || (! WrapperStruct00.var_1_5))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117] EXPR (((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_7) ? ((WrapperStruct00.var_1_10 >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((unsigned char) (! WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_1 || (! WrapperStruct00.var_1_5))))) : 1) [L117] EXPR WrapperStruct00.var_1_8 [L117] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117] EXPR (WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_7) ? ((WrapperStruct00.var_1_10 >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((unsigned char) (! WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_1 || (! WrapperStruct00.var_1_5))))) : 1 [L117] EXPR (WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_7) ? ((WrapperStruct00.var_1_10 >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((unsigned char) (! WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_1 || (! WrapperStruct00.var_1_5))))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117] EXPR (((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_7) ? ((WrapperStruct00.var_1_10 >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((unsigned char) (! WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_1 || (! WrapperStruct00.var_1_5))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117] EXPR ((((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_7) ? ((WrapperStruct00.var_1_10 >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((unsigned char) (! WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_1 || (! WrapperStruct00.var_1_5))))) : 1)) && (WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_12 == ((double) (((((((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))) + WrapperStruct00.var_1_15)) < ((((((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) < 0 ) ? -((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) : ((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))))))) ? ((((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))) + WrapperStruct00.var_1_15)) : ((((((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) < 0 ) ? -((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) : ((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16)))))))))) : (WrapperStruct00.var_1_12 == ((double) WrapperStruct00.var_1_15))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117] EXPR ((((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_7) ? ((WrapperStruct00.var_1_10 >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((unsigned char) (! WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_1 || (! WrapperStruct00.var_1_5))))) : 1)) && (WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_12 == ((double) (((((((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))) + WrapperStruct00.var_1_15)) < ((((((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) < 0 ) ? -((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) : ((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))))))) ? ((((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))) + WrapperStruct00.var_1_15)) : ((((((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) < 0 ) ? -((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) : ((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16)))))))))) : (WrapperStruct00.var_1_12 == ((double) WrapperStruct00.var_1_15))) [L117] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117] EXPR WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_12 == ((double) (((((((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))) + WrapperStruct00.var_1_15)) < ((((((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) < 0 ) ? -((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) : ((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))))))) ? ((((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))) + WrapperStruct00.var_1_15)) : ((((((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) < 0 ) ? -((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) : ((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16)))))))))) : (WrapperStruct00.var_1_12 == ((double) WrapperStruct00.var_1_15)) [L117] EXPR WrapperStruct00.var_1_12 [L117] EXPR WrapperStruct00.var_1_15 [L117] EXPR WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_12 == ((double) (((((((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))) + WrapperStruct00.var_1_15)) < ((((((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) < 0 ) ? -((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) : ((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))))))) ? ((((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))) + WrapperStruct00.var_1_15)) : ((((((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) < 0 ) ? -((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) : ((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16)))))))))) : (WrapperStruct00.var_1_12 == ((double) WrapperStruct00.var_1_15)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117] EXPR ((((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_7) ? ((WrapperStruct00.var_1_10 >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((unsigned char) (! WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_1 || (! WrapperStruct00.var_1_5))))) : 1)) && (WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_12 == ((double) (((((((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))) + WrapperStruct00.var_1_15)) < ((((((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) < 0 ) ? -((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) : ((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))))))) ? ((((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))) + WrapperStruct00.var_1_15)) : ((((((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) < 0 ) ? -((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) : ((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16)))))))))) : (WrapperStruct00.var_1_12 == ((double) WrapperStruct00.var_1_15))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117-L118] return ((((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_7) ? ((WrapperStruct00.var_1_10 >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((unsigned char) (! WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_1 || (! WrapperStruct00.var_1_5))))) : 1)) && (WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_12 == ((double) (((((((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))) + WrapperStruct00.var_1_15)) < ((((((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) < 0 ) ? -((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) : ((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))))))) ? ((((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))) + WrapperStruct00.var_1_15)) : ((((((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) < 0 ) ? -((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) : ((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16)))))))))) : (WrapperStruct00.var_1_12 == ((double) WrapperStruct00.var_1_15))) ; [L127] RET, EXPR property() [L127] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_11=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 142 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.5s, OverallIterations: 23, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6300 SdHoareTripleChecker+Valid, 6.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6294 mSDsluCounter, 16582 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12087 mSDsCounter, 334 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10383 IncrementalHoareTripleChecker+Invalid, 10717 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 334 mSolverCounterUnsat, 4495 mSDtfsCounter, 10383 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1320 GetRequests, 1141 SyntacticMatches, 3 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1088occurred in iteration=13, InterpolantAutomatonStates: 180, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 22 MinimizatonAttempts, 3079 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 11.0s InterpolantComputationTime, 3202 NumberOfCodeBlocks, 3202 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 3177 ConstructedInterpolants, 0 QuantifiedInterpolants, 9900 SizeOfPredicates, 9 NumberOfNonLiveVariables, 456 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 24 InterpolantComputations, 21 PerfectInterpolantSequences, 11412/11520 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-16 04:28:31,892 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...