/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-3.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 14:59:58,346 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 14:59:58,485 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-19 14:59:58,488 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 14:59:58,488 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 14:59:58,499 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 14:59:58,499 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 14:59:58,499 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 14:59:58,500 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 14:59:58,500 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 14:59:58,500 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 14:59:58,500 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 14:59:58,501 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 14:59:58,501 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 14:59:58,501 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 14:59:58,501 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 14:59:58,502 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 14:59:58,502 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 14:59:58,502 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 14:59:58,502 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 14:59:58,502 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 14:59:58,503 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 14:59:58,503 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 14:59:58,503 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 14:59:58,503 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 14:59:58,503 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 14:59:58,504 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 14:59:58,504 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 14:59:58,504 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 14:59:58,504 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 14:59:58,504 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 14:59:58,504 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 14:59:58,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 14:59:58,505 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 14:59:58,505 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 14:59:58,505 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 14:59:58,505 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 14:59:58,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 14:59:58,506 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 14:59:58,506 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 14:59:58,506 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 14:59:58,506 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 14:59:58,506 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 14:59:58,506 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-19 14:59:58,689 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 14:59:58,707 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 14:59:58,709 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 14:59:58,710 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 14:59:58,710 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 14:59:58,710 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-3.i [2023-12-19 14:59:59,668 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 14:59:59,838 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 14:59:59,838 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-3.i [2023-12-19 14:59:59,846 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55abf2cb4/4b7f37d67ca84974b5f1fa0f2b119b9d/FLAG1bd231afe [2023-12-19 14:59:59,855 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55abf2cb4/4b7f37d67ca84974b5f1fa0f2b119b9d [2023-12-19 14:59:59,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 14:59:59,857 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 14:59:59,858 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 14:59:59,858 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 14:59:59,861 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 14:59:59,862 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 02:59:59" (1/1) ... [2023-12-19 14:59:59,862 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4019f81b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:59:59, skipping insertion in model container [2023-12-19 14:59:59,862 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 02:59:59" (1/1) ... [2023-12-19 14:59:59,893 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 14:59:59,982 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-a_file-3.i[915,928] [2023-12-19 15:00:00,028 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 15:00:00,038 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 15:00:00,046 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-a_file-3.i[915,928] [2023-12-19 15:00:00,089 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 15:00:00,108 INFO L206 MainTranslator]: Completed translation [2023-12-19 15:00:00,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:00:00 WrapperNode [2023-12-19 15:00:00,109 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 15:00:00,110 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 15:00:00,110 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 15:00:00,110 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 15:00:00,115 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:00:00" (1/1) ... [2023-12-19 15:00:00,135 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:00:00" (1/1) ... [2023-12-19 15:00:00,182 INFO L138 Inliner]: procedures = 29, calls = 181, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 629 [2023-12-19 15:00:00,182 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 15:00:00,183 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 15:00:00,183 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 15:00:00,183 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 15:00:00,190 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:00:00" (1/1) ... [2023-12-19 15:00:00,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:00:00" (1/1) ... [2023-12-19 15:00:00,194 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:00:00" (1/1) ... [2023-12-19 15:00:00,223 INFO L175 MemorySlicer]: Split 151 memory accesses to 4 slices as follows [2, 31, 75, 43]. 50 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 4, 5, 5]. The 17 writes are split as follows [0, 5, 6, 6]. [2023-12-19 15:00:00,224 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:00:00" (1/1) ... [2023-12-19 15:00:00,224 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:00:00" (1/1) ... [2023-12-19 15:00:00,243 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:00:00" (1/1) ... [2023-12-19 15:00:00,252 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:00:00" (1/1) ... [2023-12-19 15:00:00,254 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:00:00" (1/1) ... [2023-12-19 15:00:00,256 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:00:00" (1/1) ... [2023-12-19 15:00:00,260 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 15:00:00,261 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 15:00:00,261 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 15:00:00,261 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 15:00:00,262 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:00:00" (1/1) ... [2023-12-19 15:00:00,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 15:00:00,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:00:00,315 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-19 15:00:00,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-19 15:00:00,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 15:00:00,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-19 15:00:00,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-19 15:00:00,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-19 15:00:00,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-19 15:00:00,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-19 15:00:00,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-19 15:00:00,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-19 15:00:00,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-19 15:00:00,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-19 15:00:00,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-19 15:00:00,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-19 15:00:00,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-19 15:00:00,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-19 15:00:00,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-19 15:00:00,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-19 15:00:00,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-19 15:00:00,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-19 15:00:00,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-19 15:00:00,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-19 15:00:00,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-19 15:00:00,348 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 15:00:00,348 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 15:00:00,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 15:00:00,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-19 15:00:00,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-19 15:00:00,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-19 15:00:00,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 15:00:00,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 15:00:00,467 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 15:00:00,468 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 15:00:00,878 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 15:00:00,897 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 15:00:00,897 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 15:00:00,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:00:00 BoogieIcfgContainer [2023-12-19 15:00:00,898 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 15:00:00,899 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 15:00:00,899 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 15:00:00,901 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 15:00:00,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 02:59:59" (1/3) ... [2023-12-19 15:00:00,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73c34f3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:00:00, skipping insertion in model container [2023-12-19 15:00:00,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:00:00" (2/3) ... [2023-12-19 15:00:00,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73c34f3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:00:00, skipping insertion in model container [2023-12-19 15:00:00,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:00:00" (3/3) ... [2023-12-19 15:00:00,903 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-3.i [2023-12-19 15:00:00,915 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 15:00:00,916 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 15:00:00,955 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 15:00:00,960 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;@195ea98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 15:00:00,960 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 15:00:00,964 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-19 15:00:00,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-19 15:00:00,978 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:00:00,979 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-19 15:00:00,979 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:00:00,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:00:00,983 INFO L85 PathProgramCache]: Analyzing trace with hash -33667426, now seen corresponding path program 1 times [2023-12-19 15:00:00,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:00:00,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709735201] [2023-12-19 15:00:00,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:00:00,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:00:01,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:00:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:00:01,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:00:01,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:00:01,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:00:01,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:00:01,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:00:01,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:00:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:00:01,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:00:01,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:00:01,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:00:01,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:00:01,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:00:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:00:01,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:00:01,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,243 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-19 15:00:01,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:00:01,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709735201] [2023-12-19 15:00:01,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709735201] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:00:01,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:00:01,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 15:00:01,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72144269] [2023-12-19 15:00:01,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:00:01,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 15:00:01,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:00:01,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 15:00:01,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 15:00:01,274 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-19 15:00:01,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:00:01,321 INFO L93 Difference]: Finished difference Result 281 states and 444 transitions. [2023-12-19 15:00:01,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 15:00:01,323 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-19 15:00:01,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:00:01,331 INFO L225 Difference]: With dead ends: 281 [2023-12-19 15:00:01,331 INFO L226 Difference]: Without dead ends: 140 [2023-12-19 15:00:01,334 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-19 15:00:01,336 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-19 15:00:01,338 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-19 15:00:01,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-12-19 15:00:01,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2023-12-19 15:00:01,382 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-19 15:00:01,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 210 transitions. [2023-12-19 15:00:01,384 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 210 transitions. Word has length 128 [2023-12-19 15:00:01,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:00:01,384 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 210 transitions. [2023-12-19 15:00:01,384 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-19 15:00:01,385 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 210 transitions. [2023-12-19 15:00:01,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-19 15:00:01,388 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:00:01,389 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-19 15:00:01,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 15:00:01,389 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:00:01,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:00:01,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1613584390, now seen corresponding path program 1 times [2023-12-19 15:00:01,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:00:01,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136370246] [2023-12-19 15:00:01,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:00:01,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:00:01,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:00:01,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:00:01,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:00:01,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:00:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:00:01,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:00:01,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:00:01,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:00:01,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:00:01,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:00:01,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:00:01,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:00:01,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:00:01,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:00:01,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:00:01,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:00:01,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,604 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-19 15:00:01,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:00:01,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136370246] [2023-12-19 15:00:01,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136370246] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:00:01,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:00:01,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 15:00:01,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394434471] [2023-12-19 15:00:01,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:00:01,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 15:00:01,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:00:01,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 15:00:01,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 15:00:01,607 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-19 15:00:01,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:00:01,647 INFO L93 Difference]: Finished difference Result 285 states and 428 transitions. [2023-12-19 15:00:01,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:00:01,647 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-19 15:00:01,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:00:01,648 INFO L225 Difference]: With dead ends: 285 [2023-12-19 15:00:01,648 INFO L226 Difference]: Without dead ends: 146 [2023-12-19 15:00:01,649 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-19 15:00:01,650 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 10 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:00:01,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 607 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:00:01,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-12-19 15:00:01,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 142. [2023-12-19 15:00:01,658 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-19 15:00:01,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 212 transitions. [2023-12-19 15:00:01,659 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 212 transitions. Word has length 128 [2023-12-19 15:00:01,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:00:01,659 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 212 transitions. [2023-12-19 15:00:01,660 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-19 15:00:01,660 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 212 transitions. [2023-12-19 15:00:01,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-19 15:00:01,687 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:00:01,687 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-19 15:00:01,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 15:00:01,687 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:00:01,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:00:01,688 INFO L85 PathProgramCache]: Analyzing trace with hash -802251960, now seen corresponding path program 1 times [2023-12-19 15:00:01,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:00:01,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166033257] [2023-12-19 15:00:01,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:00:01,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:00:01,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:00:01,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:00:01,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:00:01,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:00:01,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:00:01,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:00:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:00:01,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:00:01,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:00:01,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:00:01,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:00:01,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:00:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:00:01,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:00:01,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:00:01,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:00:01,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:01,878 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-19 15:00:01,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:00:01,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166033257] [2023-12-19 15:00:01,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166033257] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:00:01,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:00:01,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 15:00:01,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165542057] [2023-12-19 15:00:01,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:00:01,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 15:00:01,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:00:01,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 15:00:01,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 15:00:01,880 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-19 15:00:01,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:00:01,917 INFO L93 Difference]: Finished difference Result 321 states and 481 transitions. [2023-12-19 15:00:01,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:00:01,917 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-19 15:00:01,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:00:01,920 INFO L225 Difference]: With dead ends: 321 [2023-12-19 15:00:01,921 INFO L226 Difference]: Without dead ends: 180 [2023-12-19 15:00:01,923 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-19 15:00:01,926 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-19 15:00:01,927 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-19 15:00:01,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-12-19 15:00:01,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 144. [2023-12-19 15:00:01,944 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-19 15:00:01,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 214 transitions. [2023-12-19 15:00:01,944 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 214 transitions. Word has length 128 [2023-12-19 15:00:01,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:00:01,945 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 214 transitions. [2023-12-19 15:00:01,945 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-19 15:00:01,945 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 214 transitions. [2023-12-19 15:00:01,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-19 15:00:01,946 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:00:01,946 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-19 15:00:01,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 15:00:01,946 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:00:01,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:00:01,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1500969418, now seen corresponding path program 1 times [2023-12-19 15:00:01,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:00:01,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207916415] [2023-12-19 15:00:01,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:00:01,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:00:01,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:02,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:00:02,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:02,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:00:02,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:02,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:00:02,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:02,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:00:02,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:02,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:00:02,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:02,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:00:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:02,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:00:02,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:02,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:00:02,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:02,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:00:02,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:02,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:00:02,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:02,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:00:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:02,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:00:02,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:02,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:00:02,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:02,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:00:02,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:02,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:00:02,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:02,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:00:02,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:02,049 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-19 15:00:02,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:00:02,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207916415] [2023-12-19 15:00:02,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207916415] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:00:02,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:00:02,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 15:00:02,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599287593] [2023-12-19 15:00:02,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:00:02,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 15:00:02,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:00:02,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 15:00:02,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 15:00:02,052 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-19 15:00:02,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:00:02,079 INFO L93 Difference]: Finished difference Result 363 states and 541 transitions. [2023-12-19 15:00:02,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 15:00:02,079 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-19 15:00:02,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:00:02,082 INFO L225 Difference]: With dead ends: 363 [2023-12-19 15:00:02,082 INFO L226 Difference]: Without dead ends: 220 [2023-12-19 15:00:02,086 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-19 15:00:02,091 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-19 15:00:02,092 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-19 15:00:02,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2023-12-19 15:00:02,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 176. [2023-12-19 15:00:02,107 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-19 15:00:02,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 263 transitions. [2023-12-19 15:00:02,108 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 263 transitions. Word has length 130 [2023-12-19 15:00:02,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:00:02,109 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 263 transitions. [2023-12-19 15:00:02,109 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-19 15:00:02,110 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 263 transitions. [2023-12-19 15:00:02,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-19 15:00:02,110 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:00:02,111 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-19 15:00:02,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 15:00:02,111 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:00:02,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:00:02,112 INFO L85 PathProgramCache]: Analyzing trace with hash -153492275, now seen corresponding path program 1 times [2023-12-19 15:00:02,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:00:02,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364466974] [2023-12-19 15:00:02,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:00:02,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:00:02,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:02,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:00:02,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:02,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:00:02,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:02,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:00:02,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:02,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:00:02,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:02,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:00:02,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:02,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:00:02,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:02,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:00:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:02,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:00:02,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:02,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:00:02,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:02,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:00:02,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:02,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:00:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:02,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:00:02,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:02,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:00:02,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:02,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:00:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:02,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:00:02,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:02,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:00:02,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:02,428 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-19 15:00:02,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:00:02,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364466974] [2023-12-19 15:00:02,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364466974] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:00:02,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:00:02,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 15:00:02,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154295883] [2023-12-19 15:00:02,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:00:02,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 15:00:02,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:00:02,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 15:00:02,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 15:00:02,435 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-19 15:00:02,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:00:02,518 INFO L93 Difference]: Finished difference Result 526 states and 787 transitions. [2023-12-19 15:00:02,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 15:00:02,519 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-19 15:00:02,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:00:02,522 INFO L225 Difference]: With dead ends: 526 [2023-12-19 15:00:02,522 INFO L226 Difference]: Without dead ends: 351 [2023-12-19 15:00:02,522 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-19 15:00:02,524 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 157 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:00:02,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 762 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:00:02,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2023-12-19 15:00:02,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 343. [2023-12-19 15:00:02,537 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-19 15:00:02,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 512 transitions. [2023-12-19 15:00:02,539 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 512 transitions. Word has length 130 [2023-12-19 15:00:02,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:00:02,540 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 512 transitions. [2023-12-19 15:00:02,541 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-19 15:00:02,541 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 512 transitions. [2023-12-19 15:00:02,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-19 15:00:02,542 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:00:02,543 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-19 15:00:02,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-19 15:00:02,543 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:00:02,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:00:02,543 INFO L85 PathProgramCache]: Analyzing trace with hash 821857413, now seen corresponding path program 1 times [2023-12-19 15:00:02,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:00:02,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082395268] [2023-12-19 15:00:02,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:00:02,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:00:02,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:03,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:00:03,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:03,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:00:03,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:03,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:00:03,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:03,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:00:03,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:03,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:00:03,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:03,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:00:03,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:03,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:00:03,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:03,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:00:03,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:03,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:00:03,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:03,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:00:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:03,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:00:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:03,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:00:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:03,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:00:03,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:03,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:00:03,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:03,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:00:03,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:03,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:00:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:03,269 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-19 15:00:03,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:00:03,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082395268] [2023-12-19 15:00:03,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082395268] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:00:03,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:00:03,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 15:00:03,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211354627] [2023-12-19 15:00:03,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:00:03,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 15:00:03,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:00:03,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 15:00:03,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-19 15:00:03,272 INFO L87 Difference]: Start difference. First operand 343 states and 512 transitions. Second operand has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 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-19 15:00:03,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:00:03,516 INFO L93 Difference]: Finished difference Result 696 states and 1039 transitions. [2023-12-19 15:00:03,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-19 15:00:03,516 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 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 131 [2023-12-19 15:00:03,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:00:03,519 INFO L225 Difference]: With dead ends: 696 [2023-12-19 15:00:03,519 INFO L226 Difference]: Without dead ends: 521 [2023-12-19 15:00:03,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-12-19 15:00:03,521 INFO L413 NwaCegarLoop]: 337 mSDtfsCounter, 301 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 2055 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:00:03,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 2055 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 15:00:03,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2023-12-19 15:00:03,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 488. [2023-12-19 15:00:03,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 440 states have (on average 1.4545454545454546) internal successors, (640), 441 states have internal predecessors, (640), 44 states have call successors, (44), 3 states have call predecessors, (44), 3 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2023-12-19 15:00:03,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 728 transitions. [2023-12-19 15:00:03,540 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 728 transitions. Word has length 131 [2023-12-19 15:00:03,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:00:03,540 INFO L495 AbstractCegarLoop]: Abstraction has 488 states and 728 transitions. [2023-12-19 15:00:03,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 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-19 15:00:03,540 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 728 transitions. [2023-12-19 15:00:03,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-19 15:00:03,541 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:00:03,542 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-19 15:00:03,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 15:00:03,542 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:00:03,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:00:03,542 INFO L85 PathProgramCache]: Analyzing trace with hash 607847271, now seen corresponding path program 1 times [2023-12-19 15:00:03,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:00:03,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242310170] [2023-12-19 15:00:03,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:00:03,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:00:03,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:03,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:00:03,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:03,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:00:03,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:03,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:00:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:03,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:00:03,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:03,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:00:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:03,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:00:03,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:03,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:00:03,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:03,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:00:03,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:03,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:00:03,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:03,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:00:03,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:03,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:00:03,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:03,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:00:03,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:03,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:00:03,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:03,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:00:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:03,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:00:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:03,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:00:03,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:03,844 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-19 15:00:03,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:00:03,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242310170] [2023-12-19 15:00:03,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242310170] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:00:03,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:00:03,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:00:03,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840734911] [2023-12-19 15:00:03,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:00:03,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:00:03,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:00:03,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:00:03,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:00:03,846 INFO L87 Difference]: Start difference. First operand 488 states and 728 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-19 15:00:03,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:00:03,994 INFO L93 Difference]: Finished difference Result 1015 states and 1515 transitions. [2023-12-19 15:00:03,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:00:03,994 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-19 15:00:03,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:00:03,998 INFO L225 Difference]: With dead ends: 1015 [2023-12-19 15:00:03,998 INFO L226 Difference]: Without dead ends: 528 [2023-12-19 15:00:03,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:00:04,000 INFO L413 NwaCegarLoop]: 331 mSDtfsCounter, 200 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:00:04,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 990 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:00:04,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2023-12-19 15:00:04,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 488. [2023-12-19 15:00:04,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 440 states have (on average 1.4522727272727274) internal successors, (639), 441 states have internal predecessors, (639), 44 states have call successors, (44), 3 states have call predecessors, (44), 3 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2023-12-19 15:00:04,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 727 transitions. [2023-12-19 15:00:04,014 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 727 transitions. Word has length 132 [2023-12-19 15:00:04,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:00:04,014 INFO L495 AbstractCegarLoop]: Abstraction has 488 states and 727 transitions. [2023-12-19 15:00:04,014 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-19 15:00:04,015 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 727 transitions. [2023-12-19 15:00:04,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-19 15:00:04,016 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:00:04,016 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-19 15:00:04,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-19 15:00:04,016 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:00:04,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:00:04,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1222486961, now seen corresponding path program 1 times [2023-12-19 15:00:04,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:00:04,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617009403] [2023-12-19 15:00:04,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:00:04,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:00:04,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:00:04,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:00:04,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:00:04,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:00:04,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:00:04,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:00:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:00:04,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:00:04,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:00:04,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:00:04,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:00:04,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:00:04,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:00:04,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:00:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:00:04,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:00:04,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,142 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-19 15:00:04,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:00:04,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617009403] [2023-12-19 15:00:04,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617009403] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:00:04,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:00:04,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:00:04,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447201476] [2023-12-19 15:00:04,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:00:04,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:00:04,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:00:04,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:00:04,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:00:04,144 INFO L87 Difference]: Start difference. First operand 488 states and 727 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-19 15:00:04,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:00:04,191 INFO L93 Difference]: Finished difference Result 1206 states and 1799 transitions. [2023-12-19 15:00:04,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 15:00:04,192 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-19 15:00:04,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:00:04,194 INFO L225 Difference]: With dead ends: 1206 [2023-12-19 15:00:04,194 INFO L226 Difference]: Without dead ends: 719 [2023-12-19 15:00:04,195 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-19 15:00:04,195 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-19 15:00:04,196 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-19 15:00:04,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2023-12-19 15:00:04,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 491. [2023-12-19 15:00:04,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 443 states have (on average 1.4492099322799097) internal successors, (642), 444 states have internal predecessors, (642), 44 states have call successors, (44), 3 states have call predecessors, (44), 3 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2023-12-19 15:00:04,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 730 transitions. [2023-12-19 15:00:04,209 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 730 transitions. Word has length 132 [2023-12-19 15:00:04,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:00:04,209 INFO L495 AbstractCegarLoop]: Abstraction has 491 states and 730 transitions. [2023-12-19 15:00:04,209 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-19 15:00:04,210 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 730 transitions. [2023-12-19 15:00:04,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-19 15:00:04,211 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:00:04,211 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-19 15:00:04,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-19 15:00:04,211 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:00:04,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:00:04,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1341018566, now seen corresponding path program 1 times [2023-12-19 15:00:04,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:00:04,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984919027] [2023-12-19 15:00:04,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:00:04,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:00:04,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:00:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:00:04,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:00:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:00:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:00:04,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:00:04,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:00:04,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:00:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:00:04,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:00:04,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:00:04,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:00:04,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:00:04,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:00:04,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:00:04,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:00:04,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,348 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-19 15:00:04,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:00:04,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984919027] [2023-12-19 15:00:04,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984919027] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:00:04,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:00:04,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:00:04,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913143130] [2023-12-19 15:00:04,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:00:04,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:00:04,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:00:04,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:00:04,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:00:04,349 INFO L87 Difference]: Start difference. First operand 491 states and 730 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-19 15:00:04,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:00:04,385 INFO L93 Difference]: Finished difference Result 1056 states and 1573 transitions. [2023-12-19 15:00:04,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 15:00:04,386 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-19 15:00:04,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:00:04,388 INFO L225 Difference]: With dead ends: 1056 [2023-12-19 15:00:04,388 INFO L226 Difference]: Without dead ends: 566 [2023-12-19 15:00:04,389 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-19 15:00:04,389 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-19 15:00:04,389 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-19 15:00:04,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2023-12-19 15:00:04,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 500. [2023-12-19 15:00:04,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 452 states have (on average 1.4402654867256637) internal successors, (651), 453 states have internal predecessors, (651), 44 states have call successors, (44), 3 states have call predecessors, (44), 3 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2023-12-19 15:00:04,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 739 transitions. [2023-12-19 15:00:04,402 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 739 transitions. Word has length 133 [2023-12-19 15:00:04,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:00:04,402 INFO L495 AbstractCegarLoop]: Abstraction has 500 states and 739 transitions. [2023-12-19 15:00:04,402 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-19 15:00:04,402 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 739 transitions. [2023-12-19 15:00:04,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-19 15:00:04,403 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:00:04,403 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-19 15:00:04,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-19 15:00:04,404 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:00:04,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:00:04,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1191195275, now seen corresponding path program 1 times [2023-12-19 15:00:04,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:00:04,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685939708] [2023-12-19 15:00:04,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:00:04,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:00:04,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:00:04,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:00:04,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:00:04,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:00:04,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:00:04,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:00:04,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:00:04,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:00:04,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:00:04,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:00:04,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:00:04,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:00:04,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:00:04,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:00:04,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:00:04,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:00:04,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:04,766 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-19 15:00:04,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:00:04,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685939708] [2023-12-19 15:00:04,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685939708] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:00:04,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:00:04,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 15:00:04,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839017213] [2023-12-19 15:00:04,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:00:04,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 15:00:04,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:00:04,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 15:00:04,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:00:04,768 INFO L87 Difference]: Start difference. First operand 500 states and 739 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-19 15:00:04,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:00:04,990 INFO L93 Difference]: Finished difference Result 891 states and 1316 transitions. [2023-12-19 15:00:04,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 15:00:04,990 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-19 15:00:04,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:00:04,992 INFO L225 Difference]: With dead ends: 891 [2023-12-19 15:00:04,992 INFO L226 Difference]: Without dead ends: 563 [2023-12-19 15:00:04,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 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-19 15:00:04,993 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 488 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:00:04,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 961 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 15:00:04,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2023-12-19 15:00:05,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 522. [2023-12-19 15:00:05,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 469 states have (on average 1.4307036247334755) internal successors, (671), 469 states have internal predecessors, (671), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-19 15:00:05,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 767 transitions. [2023-12-19 15:00:05,009 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 767 transitions. Word has length 133 [2023-12-19 15:00:05,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:00:05,009 INFO L495 AbstractCegarLoop]: Abstraction has 522 states and 767 transitions. [2023-12-19 15:00:05,009 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-19 15:00:05,009 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 767 transitions. [2023-12-19 15:00:05,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-19 15:00:05,011 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:00:05,011 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-19 15:00:05,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-19 15:00:05,011 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:00:05,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:00:05,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1616026911, now seen corresponding path program 1 times [2023-12-19 15:00:05,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:00:05,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890083905] [2023-12-19 15:00:05,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:00:05,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:00:05,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:05,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:00:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:05,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:00:05,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:05,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:00:05,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:05,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:00:05,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:05,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:00:05,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:05,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:00:05,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:05,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:00:05,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:05,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:00:05,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:05,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:00:05,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:05,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:00:05,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:05,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:00:05,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:05,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:00:05,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:05,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:00:05,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:05,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:00:05,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:05,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:00:05,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:05,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:00:05,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:05,346 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-19 15:00:05,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:00:05,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890083905] [2023-12-19 15:00:05,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890083905] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:00:05,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:00:05,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 15:00:05,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883769398] [2023-12-19 15:00:05,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:00:05,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 15:00:05,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:00:05,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 15:00:05,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:00:05,348 INFO L87 Difference]: Start difference. First operand 522 states and 767 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-19 15:00:05,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:00:05,518 INFO L93 Difference]: Finished difference Result 954 states and 1402 transitions. [2023-12-19 15:00:05,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 15:00:05,519 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-19 15:00:05,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:00:05,523 INFO L225 Difference]: With dead ends: 954 [2023-12-19 15:00:05,523 INFO L226 Difference]: Without dead ends: 604 [2023-12-19 15:00:05,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-12-19 15:00:05,524 INFO L413 NwaCegarLoop]: 268 mSDtfsCounter, 491 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:00:05,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 911 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:00:05,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2023-12-19 15:00:05,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 355. [2023-12-19 15:00:05,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 319 states have (on average 1.4231974921630095) internal successors, (454), 319 states have internal predecessors, (454), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-19 15:00:05,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 518 transitions. [2023-12-19 15:00:05,538 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 518 transitions. Word has length 133 [2023-12-19 15:00:05,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:00:05,539 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 518 transitions. [2023-12-19 15:00:05,539 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-19 15:00:05,539 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 518 transitions. [2023-12-19 15:00:05,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-19 15:00:05,541 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:00:05,541 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-19 15:00:05,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-19 15:00:05,541 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:00:05,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:00:05,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1685879021, now seen corresponding path program 1 times [2023-12-19 15:00:05,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:00:05,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958739886] [2023-12-19 15:00:05,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:00:05,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:00:05,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:06,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:00:06,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:06,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:00:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:06,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:00:06,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:06,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:00:06,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:06,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:00:06,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:06,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:00:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:06,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:00:06,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:06,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:00:06,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:06,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:00:06,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:06,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:00:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:06,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:00:06,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:06,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:00:06,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:06,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:00:06,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:06,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:00:06,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:06,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:00:06,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:06,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:00:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:06,443 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-19 15:00:06,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:00:06,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958739886] [2023-12-19 15:00:06,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958739886] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:00:06,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:00:06,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-19 15:00:06,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108375431] [2023-12-19 15:00:06,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:00:06,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-19 15:00:06,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:00:06,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-19 15:00:06,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-12-19 15:00:06,444 INFO L87 Difference]: Start difference. First operand 355 states and 518 transitions. Second operand has 11 states, 10 states have (on average 5.7) internal successors, (57), 11 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-19 15:00:06,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:00:06,799 INFO L93 Difference]: Finished difference Result 924 states and 1349 transitions. [2023-12-19 15:00:06,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-19 15:00:06,800 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.7) internal successors, (57), 11 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-19 15:00:06,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:00:06,802 INFO L225 Difference]: With dead ends: 924 [2023-12-19 15:00:06,802 INFO L226 Difference]: Without dead ends: 570 [2023-12-19 15:00:06,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2023-12-19 15:00:06,803 INFO L413 NwaCegarLoop]: 380 mSDtfsCounter, 447 mSDsluCounter, 2876 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 3256 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:00:06,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 3256 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 15:00:06,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2023-12-19 15:00:06,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 499. [2023-12-19 15:00:06,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 454 states have (on average 1.4273127753303965) internal successors, (648), 455 states have internal predecessors, (648), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-19 15:00:06,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 728 transitions. [2023-12-19 15:00:06,816 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 728 transitions. Word has length 134 [2023-12-19 15:00:06,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:00:06,816 INFO L495 AbstractCegarLoop]: Abstraction has 499 states and 728 transitions. [2023-12-19 15:00:06,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.7) internal successors, (57), 11 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-19 15:00:06,817 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 728 transitions. [2023-12-19 15:00:06,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-19 15:00:06,818 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:00:06,818 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-19 15:00:06,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-19 15:00:06,818 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:00:06,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:00:06,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1292852011, now seen corresponding path program 1 times [2023-12-19 15:00:06,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:00:06,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417392364] [2023-12-19 15:00:06,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:00:06,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:00:06,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:07,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:00:07,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:07,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:00:07,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:07,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:00:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:07,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:00:07,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:07,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:00:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:07,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:00:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:07,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:00:07,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:07,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:00:07,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:07,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:00:07,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:07,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:00:07,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:07,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:00:07,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:07,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:00:07,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:07,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:00:07,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:07,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:00:07,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:07,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:00:07,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:07,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:00:07,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:07,161 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-19 15:00:07,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:00:07,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417392364] [2023-12-19 15:00:07,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417392364] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:00:07,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:00:07,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:00:07,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819641879] [2023-12-19 15:00:07,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:00:07,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:00:07,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:00:07,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:00:07,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:00:07,163 INFO L87 Difference]: Start difference. First operand 499 states and 728 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-19 15:00:07,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:00:07,250 INFO L93 Difference]: Finished difference Result 1073 states and 1565 transitions. [2023-12-19 15:00:07,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 15:00:07,250 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-19 15:00:07,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:00:07,252 INFO L225 Difference]: With dead ends: 1073 [2023-12-19 15:00:07,252 INFO L226 Difference]: Without dead ends: 575 [2023-12-19 15:00:07,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:00:07,254 INFO L413 NwaCegarLoop]: 331 mSDtfsCounter, 217 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:00:07,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 949 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:00:07,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2023-12-19 15:00:07,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 497. [2023-12-19 15:00:07,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 452 states have (on average 1.426991150442478) internal successors, (645), 453 states have internal predecessors, (645), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-19 15:00:07,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 725 transitions. [2023-12-19 15:00:07,268 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 725 transitions. Word has length 134 [2023-12-19 15:00:07,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:00:07,268 INFO L495 AbstractCegarLoop]: Abstraction has 497 states and 725 transitions. [2023-12-19 15:00:07,268 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-19 15:00:07,268 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 725 transitions. [2023-12-19 15:00:07,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-19 15:00:07,269 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:00:07,269 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-19 15:00:07,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-19 15:00:07,269 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:00:07,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:00:07,270 INFO L85 PathProgramCache]: Analyzing trace with hash -3064721, now seen corresponding path program 1 times [2023-12-19 15:00:07,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:00:07,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969093009] [2023-12-19 15:00:07,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:00:07,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:00:07,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:07,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:00:07,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:07,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:00:07,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:07,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:00:07,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:07,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:00:07,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:07,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:00:07,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:07,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:00:07,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:07,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:00:07,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:07,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:00:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:07,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:00:07,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:07,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:00:07,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:07,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:00:07,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:07,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:00:07,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:07,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:00:07,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:07,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:00:07,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:07,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:00:07,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:07,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:00:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:07,616 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-19 15:00:07,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:00:07,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969093009] [2023-12-19 15:00:07,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969093009] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:00:07,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:00:07,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:00:07,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113630124] [2023-12-19 15:00:07,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:00:07,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:00:07,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:00:07,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:00:07,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:00:07,618 INFO L87 Difference]: Start difference. First operand 497 states and 725 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-19 15:00:07,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:00:07,706 INFO L93 Difference]: Finished difference Result 1035 states and 1506 transitions. [2023-12-19 15:00:07,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 15:00:07,706 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-19 15:00:07,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:00:07,708 INFO L225 Difference]: With dead ends: 1035 [2023-12-19 15:00:07,708 INFO L226 Difference]: Without dead ends: 539 [2023-12-19 15:00:07,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 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-19 15:00:07,709 INFO L413 NwaCegarLoop]: 350 mSDtfsCounter, 257 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:00:07,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 1195 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:00:07,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2023-12-19 15:00:07,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 422. [2023-12-19 15:00:07,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 385 states have (on average 1.4207792207792207) internal successors, (547), 385 states have internal predecessors, (547), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-19 15:00:07,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 611 transitions. [2023-12-19 15:00:07,725 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 611 transitions. Word has length 134 [2023-12-19 15:00:07,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:00:07,725 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 611 transitions. [2023-12-19 15:00:07,725 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-19 15:00:07,725 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 611 transitions. [2023-12-19 15:00:07,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-19 15:00:07,726 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:00:07,726 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-19 15:00:07,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-19 15:00:07,726 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:00:07,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:00:07,727 INFO L85 PathProgramCache]: Analyzing trace with hash -396091731, now seen corresponding path program 1 times [2023-12-19 15:00:07,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:00:07,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356193344] [2023-12-19 15:00:07,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:00:07,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:00:07,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:08,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:00:08,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:08,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:00:08,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:08,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:00:08,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:08,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:00:08,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:08,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:00:08,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:08,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:00:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:08,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:00:08,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:08,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:00:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:08,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:00:08,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:08,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:00:08,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:08,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:00:08,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:08,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:00:08,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:08,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:00:08,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:08,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:00:08,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:08,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:00:08,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:08,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:00:08,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:08,493 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-19 15:00:08,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:00:08,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356193344] [2023-12-19 15:00:08,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356193344] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:00:08,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:00:08,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-19 15:00:08,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88014045] [2023-12-19 15:00:08,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:00:08,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-19 15:00:08,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:00:08,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-19 15:00:08,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2023-12-19 15:00:08,495 INFO L87 Difference]: Start difference. First operand 422 states and 611 transitions. Second operand has 12 states, 10 states have (on average 5.7) internal successors, (57), 12 states have internal predecessors, (57), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2023-12-19 15:00:08,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:00:08,815 INFO L93 Difference]: Finished difference Result 960 states and 1391 transitions. [2023-12-19 15:00:08,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-19 15:00:08,816 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.7) internal successors, (57), 12 states have internal predecessors, (57), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) Word has length 134 [2023-12-19 15:00:08,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:00:08,818 INFO L225 Difference]: With dead ends: 960 [2023-12-19 15:00:08,818 INFO L226 Difference]: Without dead ends: 539 [2023-12-19 15:00:08,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2023-12-19 15:00:08,819 INFO L413 NwaCegarLoop]: 388 mSDtfsCounter, 375 mSDsluCounter, 3262 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 3650 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:00:08,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 3650 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 15:00:08,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2023-12-19 15:00:08,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 420. [2023-12-19 15:00:08,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 383 states have (on average 1.422976501305483) internal successors, (545), 383 states have internal predecessors, (545), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-19 15:00:08,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 609 transitions. [2023-12-19 15:00:08,831 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 609 transitions. Word has length 134 [2023-12-19 15:00:08,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:00:08,831 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 609 transitions. [2023-12-19 15:00:08,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.7) internal successors, (57), 12 states have internal predecessors, (57), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2023-12-19 15:00:08,831 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 609 transitions. [2023-12-19 15:00:08,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-19 15:00:08,832 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:00:08,832 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-19 15:00:08,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-19 15:00:08,833 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:00:08,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:00:08,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1352344682, now seen corresponding path program 1 times [2023-12-19 15:00:08,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:00:08,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019498771] [2023-12-19 15:00:08,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:00:08,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:00:08,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:08,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:00:08,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:08,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:00:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:08,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:00:08,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:08,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:00:08,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:08,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:00:08,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:08,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:00:08,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:08,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:00:08,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:08,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:00:08,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:08,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:00:08,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:08,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:00:08,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:08,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:00:08,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:08,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:00:08,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:08,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:00:08,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:08,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:00:08,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:08,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:00:08,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:08,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:00:08,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:08,895 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-19 15:00:08,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:00:08,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019498771] [2023-12-19 15:00:08,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019498771] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:00:08,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:00:08,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 15:00:08,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7056783] [2023-12-19 15:00:08,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:00:08,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 15:00:08,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:00:08,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 15:00:08,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 15:00:08,898 INFO L87 Difference]: Start difference. First operand 420 states and 609 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-19 15:00:08,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:00:08,924 INFO L93 Difference]: Finished difference Result 908 states and 1309 transitions. [2023-12-19 15:00:08,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 15:00:08,924 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-19 15:00:08,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:00:08,926 INFO L225 Difference]: With dead ends: 908 [2023-12-19 15:00:08,926 INFO L226 Difference]: Without dead ends: 489 [2023-12-19 15:00:08,927 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-19 15:00:08,927 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-19 15:00:08,927 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-19 15:00:08,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2023-12-19 15:00:08,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 397. [2023-12-19 15:00:08,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 360 states have (on average 1.4) internal successors, (504), 360 states have internal predecessors, (504), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-19 15:00:08,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 568 transitions. [2023-12-19 15:00:08,941 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 568 transitions. Word has length 134 [2023-12-19 15:00:08,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:00:08,941 INFO L495 AbstractCegarLoop]: Abstraction has 397 states and 568 transitions. [2023-12-19 15:00:08,941 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-19 15:00:08,941 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 568 transitions. [2023-12-19 15:00:08,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-19 15:00:08,942 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:00:08,943 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-19 15:00:08,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-19 15:00:08,943 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:00:08,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:00:08,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1331377941, now seen corresponding path program 1 times [2023-12-19 15:00:08,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:00:08,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559186715] [2023-12-19 15:00:08,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:00:08,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:00:08,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:09,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:00:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:09,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:00:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:09,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:00:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:09,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:00:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:09,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:00:09,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:09,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:00:09,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:09,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:00:09,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:09,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:00:09,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:09,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:00:09,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:09,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:00:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:09,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:00:09,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:09,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:00:09,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:09,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:00:09,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:09,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:00:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:09,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:00:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:09,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:00:09,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:09,654 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-19 15:00:09,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:00:09,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559186715] [2023-12-19 15:00:09,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559186715] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:00:09,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:00:09,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-19 15:00:09,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461600538] [2023-12-19 15:00:09,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:00:09,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 15:00:09,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:00:09,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 15:00:09,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-12-19 15:00:09,655 INFO L87 Difference]: Start difference. First operand 397 states and 568 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-19 15:00:10,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:00:10,019 INFO L93 Difference]: Finished difference Result 1155 states and 1666 transitions. [2023-12-19 15:00:10,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-19 15:00:10,019 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-19 15:00:10,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:00:10,022 INFO L225 Difference]: With dead ends: 1155 [2023-12-19 15:00:10,022 INFO L226 Difference]: Without dead ends: 759 [2023-12-19 15:00:10,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2023-12-19 15:00:10,024 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 585 mSDsluCounter, 1600 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 1825 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:00:10,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 1825 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:00:10,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2023-12-19 15:00:10,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 458. [2023-12-19 15:00:10,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 421 states have (on average 1.4085510688836105) internal successors, (593), 421 states have internal predecessors, (593), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-19 15:00:10,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 657 transitions. [2023-12-19 15:00:10,043 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 657 transitions. Word has length 135 [2023-12-19 15:00:10,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:00:10,043 INFO L495 AbstractCegarLoop]: Abstraction has 458 states and 657 transitions. [2023-12-19 15:00:10,044 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-19 15:00:10,044 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 657 transitions. [2023-12-19 15:00:10,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-19 15:00:10,046 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:00:10,046 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-19 15:00:10,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-19 15:00:10,046 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:00:10,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:00:10,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1635396907, now seen corresponding path program 1 times [2023-12-19 15:00:10,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:00:10,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847484681] [2023-12-19 15:00:10,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:00:10,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:00:10,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:10,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:00:10,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:10,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:00:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:10,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:00:10,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:10,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:00:10,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:10,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:00:10,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:10,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:00:10,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:10,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:00:10,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:10,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:00:10,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:10,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:00:10,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:10,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:00:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:10,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:00:10,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:10,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:00:10,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:10,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:00:10,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:10,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:00:10,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:10,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:00:10,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:10,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:00:10,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:10,417 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-19 15:00:10,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:00:10,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847484681] [2023-12-19 15:00:10,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847484681] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:00:10,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:00:10,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:00:10,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789836102] [2023-12-19 15:00:10,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:00:10,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:00:10,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:00:10,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:00:10,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:00:10,420 INFO L87 Difference]: Start difference. First operand 458 states and 657 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-19 15:00:10,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:00:10,552 INFO L93 Difference]: Finished difference Result 1302 states and 1876 transitions. [2023-12-19 15:00:10,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 15:00:10,553 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-19 15:00:10,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:00:10,556 INFO L225 Difference]: With dead ends: 1302 [2023-12-19 15:00:10,556 INFO L226 Difference]: Without dead ends: 845 [2023-12-19 15:00:10,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 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-19 15:00:10,557 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 251 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:00:10,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 924 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:00:10,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2023-12-19 15:00:10,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 713. [2023-12-19 15:00:10,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 662 states have (on average 1.4123867069486404) internal successors, (935), 663 states have internal predecessors, (935), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2023-12-19 15:00:10,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1023 transitions. [2023-12-19 15:00:10,583 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1023 transitions. Word has length 135 [2023-12-19 15:00:10,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:00:10,584 INFO L495 AbstractCegarLoop]: Abstraction has 713 states and 1023 transitions. [2023-12-19 15:00:10,585 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-19 15:00:10,585 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1023 transitions. [2023-12-19 15:00:10,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-12-19 15:00:10,587 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:00:10,587 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-19 15:00:10,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-19 15:00:10,587 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:00:10,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:00:10,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1417997126, now seen corresponding path program 1 times [2023-12-19 15:00:10,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:00:10,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796246993] [2023-12-19 15:00:10,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:00:10,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:00:10,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:11,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:00:11,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:11,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:00:11,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:11,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:00:11,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:11,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:00:11,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:11,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:00:11,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:11,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:00:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:11,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:00:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:11,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:00:11,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:11,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:00:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:11,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:00:11,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:11,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:00:11,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:11,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:00:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:11,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:00:11,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:11,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:00:11,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:11,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:00:11,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:11,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:00:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:11,143 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-12-19 15:00:11,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:00:11,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796246993] [2023-12-19 15:00:11,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796246993] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 15:00:11,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571592007] [2023-12-19 15:00:11,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:00:11,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:00:11,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:00:11,146 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 15:00:11,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-19 15:00:11,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:11,380 INFO L262 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-19 15:00:11,399 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:00:11,448 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 7 treesize of output 3 [2023-12-19 15:00:11,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-19 15:00:12,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-19 15:00:12,250 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 15:00:12,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 65 [2023-12-19 15:00:12,307 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 73 proven. 42 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2023-12-19 15:00:12,308 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 15:00:12,885 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-12-19 15:00:12,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571592007] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 15:00:12,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 15:00:12,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14, 14] total 28 [2023-12-19 15:00:12,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7895187] [2023-12-19 15:00:12,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 15:00:12,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-19 15:00:12,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:00:12,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-19 15:00:12,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=644, Unknown=0, NotChecked=0, Total=756 [2023-12-19 15:00:12,890 INFO L87 Difference]: Start difference. First operand 713 states and 1023 transitions. Second operand has 28 states, 25 states have (on average 6.84) internal successors, (171), 28 states have internal predecessors, (171), 8 states have call successors, (47), 3 states have call predecessors, (47), 6 states have return successors, (47), 5 states have call predecessors, (47), 8 states have call successors, (47) [2023-12-19 15:00:14,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:00:14,478 INFO L93 Difference]: Finished difference Result 2364 states and 3344 transitions. [2023-12-19 15:00:14,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-12-19 15:00:14,480 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 6.84) internal successors, (171), 28 states have internal predecessors, (171), 8 states have call successors, (47), 3 states have call predecessors, (47), 6 states have return successors, (47), 5 states have call predecessors, (47), 8 states have call successors, (47) Word has length 137 [2023-12-19 15:00:14,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:00:14,485 INFO L225 Difference]: With dead ends: 2364 [2023-12-19 15:00:14,485 INFO L226 Difference]: Without dead ends: 1652 [2023-12-19 15:00:14,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 287 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1678 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=899, Invalid=5263, Unknown=0, NotChecked=0, Total=6162 [2023-12-19 15:00:14,488 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 1806 mSDsluCounter, 3353 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1809 SdHoareTripleChecker+Valid, 3564 SdHoareTripleChecker+Invalid, 1370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-19 15:00:14,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1809 Valid, 3564 Invalid, 1370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-19 15:00:14,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1652 states. [2023-12-19 15:00:14,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1652 to 994. [2023-12-19 15:00:14,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 906 states have (on average 1.3918322295805738) internal successors, (1261), 908 states have internal predecessors, (1261), 72 states have call successors, (72), 15 states have call predecessors, (72), 15 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2023-12-19 15:00:14,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1405 transitions. [2023-12-19 15:00:14,530 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1405 transitions. Word has length 137 [2023-12-19 15:00:14,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:00:14,530 INFO L495 AbstractCegarLoop]: Abstraction has 994 states and 1405 transitions. [2023-12-19 15:00:14,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 6.84) internal successors, (171), 28 states have internal predecessors, (171), 8 states have call successors, (47), 3 states have call predecessors, (47), 6 states have return successors, (47), 5 states have call predecessors, (47), 8 states have call successors, (47) [2023-12-19 15:00:14,530 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1405 transitions. [2023-12-19 15:00:14,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-12-19 15:00:14,531 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:00:14,532 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-19 15:00:14,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-19 15:00:14,739 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-19 15:00:14,739 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:00:14,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:00:14,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1597416847, now seen corresponding path program 1 times [2023-12-19 15:00:14,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:00:14,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297590761] [2023-12-19 15:00:14,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:00:14,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:00:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:14,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:00:14,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:14,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:00:14,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:14,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:00:14,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:14,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:00:14,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:14,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:00:14,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:14,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:00:14,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:14,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:00:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:14,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:00:14,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:14,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:00:14,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:14,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:00:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:14,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:00:14,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:14,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:00:14,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:14,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:00:14,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:14,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:00:14,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:14,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:00:14,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:14,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:00:14,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:14,897 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-19 15:00:14,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:00:14,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297590761] [2023-12-19 15:00:14,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297590761] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:00:14,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:00:14,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:00:14,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752738751] [2023-12-19 15:00:14,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:00:14,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:00:14,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:00:14,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:00:14,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:00:14,898 INFO L87 Difference]: Start difference. First operand 994 states and 1405 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-19 15:00:15,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:00:15,006 INFO L93 Difference]: Finished difference Result 2280 states and 3227 transitions. [2023-12-19 15:00:15,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 15:00:15,007 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-19 15:00:15,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:00:15,012 INFO L225 Difference]: With dead ends: 2280 [2023-12-19 15:00:15,012 INFO L226 Difference]: Without dead ends: 1609 [2023-12-19 15:00:15,013 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-19 15:00:15,014 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 193 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:00:15,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 766 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:00:15,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states. [2023-12-19 15:00:15,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 996. [2023-12-19 15:00:15,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 996 states, 908 states have (on average 1.3909691629955947) internal successors, (1263), 910 states have internal predecessors, (1263), 72 states have call successors, (72), 15 states have call predecessors, (72), 15 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2023-12-19 15:00:15,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1407 transitions. [2023-12-19 15:00:15,058 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1407 transitions. Word has length 137 [2023-12-19 15:00:15,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:00:15,059 INFO L495 AbstractCegarLoop]: Abstraction has 996 states and 1407 transitions. [2023-12-19 15:00:15,059 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-19 15:00:15,059 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1407 transitions. [2023-12-19 15:00:15,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-12-19 15:00:15,060 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:00:15,060 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-19 15:00:15,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-19 15:00:15,060 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:00:15,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:00:15,061 INFO L85 PathProgramCache]: Analyzing trace with hash -208021487, now seen corresponding path program 1 times [2023-12-19 15:00:15,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:00:15,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798520807] [2023-12-19 15:00:15,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:00:15,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:00:15,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:15,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:00:15,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:15,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:00:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:15,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:00:15,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:15,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:00:15,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:15,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:00:15,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:15,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:00:15,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:15,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:00:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:15,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:00:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:15,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:00:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:15,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:00:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:15,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:00:15,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:15,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:00:15,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:15,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:00:15,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:15,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:00:15,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:15,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:00:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:15,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:00:15,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:15,464 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-19 15:00:15,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:00:15,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798520807] [2023-12-19 15:00:15,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798520807] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:00:15,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:00:15,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 15:00:15,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615379351] [2023-12-19 15:00:15,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:00:15,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 15:00:15,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:00:15,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 15:00:15,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:00:15,466 INFO L87 Difference]: Start difference. First operand 996 states and 1407 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-19 15:00:15,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:00:15,624 INFO L93 Difference]: Finished difference Result 2119 states and 3009 transitions. [2023-12-19 15:00:15,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 15:00:15,625 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-19 15:00:15,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:00:15,630 INFO L225 Difference]: With dead ends: 2119 [2023-12-19 15:00:15,630 INFO L226 Difference]: Without dead ends: 1446 [2023-12-19 15:00:15,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 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-19 15:00:15,632 INFO L413 NwaCegarLoop]: 266 mSDtfsCounter, 276 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:00:15,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 1095 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:00:15,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2023-12-19 15:00:15,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 1193. [2023-12-19 15:00:15,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1193 states, 1095 states have (on average 1.3945205479452054) internal successors, (1527), 1098 states have internal predecessors, (1527), 80 states have call successors, (80), 17 states have call predecessors, (80), 17 states have return successors, (80), 77 states have call predecessors, (80), 80 states have call successors, (80) [2023-12-19 15:00:15,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1687 transitions. [2023-12-19 15:00:15,682 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1687 transitions. Word has length 137 [2023-12-19 15:00:15,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:00:15,682 INFO L495 AbstractCegarLoop]: Abstraction has 1193 states and 1687 transitions. [2023-12-19 15:00:15,682 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-19 15:00:15,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1687 transitions. [2023-12-19 15:00:15,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-19 15:00:15,683 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:00:15,683 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-19 15:00:15,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-19 15:00:15,684 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:00:15,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:00:15,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1363234947, now seen corresponding path program 1 times [2023-12-19 15:00:15,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:00:15,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421182274] [2023-12-19 15:00:15,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:00:15,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:00:15,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:16,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:00:16,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:16,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:00:16,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:16,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:00:16,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:16,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:00:16,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:16,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:00:16,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:16,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:00:16,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:16,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:00:16,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:16,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:00:16,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:16,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:00:16,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:16,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:00:16,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:16,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:00:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:16,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:00:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:16,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:00:16,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:16,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 15:00:16,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:16,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 15:00:16,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:16,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 15:00:16,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:00:16,064 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-19 15:00:16,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:00:16,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421182274] [2023-12-19 15:00:16,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421182274] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:00:16,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:00:16,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 15:00:16,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753116113] [2023-12-19 15:00:16,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:00:16,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 15:00:16,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:00:16,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 15:00:16,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:00:16,066 INFO L87 Difference]: Start difference. First operand 1193 states and 1687 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 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-19 15:00:16,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:00:16,213 INFO L93 Difference]: Finished difference Result 2385 states and 3364 transitions. [2023-12-19 15:00:16,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 15:00:16,214 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 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 138 [2023-12-19 15:00:16,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:00:16,218 INFO L225 Difference]: With dead ends: 2385 [2023-12-19 15:00:16,218 INFO L226 Difference]: Without dead ends: 1193 [2023-12-19 15:00:16,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-19 15:00:16,221 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 186 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:00:16,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 824 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:00:16,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2023-12-19 15:00:16,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1024. [2023-12-19 15:00:16,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 949 states have (on average 1.3898840885142254) internal successors, (1319), 950 states have internal predecessors, (1319), 60 states have call successors, (60), 14 states have call predecessors, (60), 14 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-19 15:00:16,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1439 transitions. [2023-12-19 15:00:16,261 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1439 transitions. Word has length 138 [2023-12-19 15:00:16,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:00:16,261 INFO L495 AbstractCegarLoop]: Abstraction has 1024 states and 1439 transitions. [2023-12-19 15:00:16,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 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-19 15:00:16,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1439 transitions. [2023-12-19 15:00:16,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-19 15:00:16,262 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:00:16,262 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-19 15:00:16,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-19 15:00:16,262 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:00:16,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:00:16,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1059215981, now seen corresponding path program 1 times [2023-12-19 15:00:16,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:00:16,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16673394] [2023-12-19 15:00:16,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:00:16,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:00:16,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 15:00:16,297 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 15:00:16,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 15:00:16,377 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 15:00:16,378 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 15:00:16,378 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 15:00:16,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-19 15:00:16,382 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-19 15:00:16,384 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 15:00:16,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 03:00:16 BoogieIcfgContainer [2023-12-19 15:00:16,454 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 15:00:16,455 INFO L158 Benchmark]: Toolchain (without parser) took 16597.45ms. Allocated memory was 247.5MB in the beginning and 582.0MB in the end (delta: 334.5MB). Free memory was 202.9MB in the beginning and 329.9MB in the end (delta: -127.1MB). Peak memory consumption was 208.2MB. Max. memory is 8.0GB. [2023-12-19 15:00:16,455 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 203.4MB. Free memory is still 154.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 15:00:16,455 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.25ms. Allocated memory is still 247.5MB. Free memory was 202.6MB in the beginning and 187.1MB in the end (delta: 15.4MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-19 15:00:16,455 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.28ms. Allocated memory is still 247.5MB. Free memory was 187.1MB in the beginning and 182.7MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-19 15:00:16,455 INFO L158 Benchmark]: Boogie Preprocessor took 78.01ms. Allocated memory is still 247.5MB. Free memory was 182.7MB in the beginning and 177.1MB in the end (delta: 5.6MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-19 15:00:16,455 INFO L158 Benchmark]: RCFGBuilder took 636.60ms. Allocated memory is still 247.5MB. Free memory was 177.1MB in the beginning and 193.9MB in the end (delta: -16.8MB). Peak memory consumption was 25.5MB. Max. memory is 8.0GB. [2023-12-19 15:00:16,456 INFO L158 Benchmark]: TraceAbstraction took 15555.20ms. Allocated memory was 247.5MB in the beginning and 582.0MB in the end (delta: 334.5MB). Free memory was 192.9MB in the beginning and 329.9MB in the end (delta: -137.1MB). Peak memory consumption was 197.4MB. Max. memory is 8.0GB. [2023-12-19 15:00:16,456 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.11ms. Allocated memory is still 203.4MB. Free memory is still 154.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 251.25ms. Allocated memory is still 247.5MB. Free memory was 202.6MB in the beginning and 187.1MB in the end (delta: 15.4MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 72.28ms. Allocated memory is still 247.5MB. Free memory was 187.1MB in the beginning and 182.7MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 78.01ms. Allocated memory is still 247.5MB. Free memory was 182.7MB in the beginning and 177.1MB in the end (delta: 5.6MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 636.60ms. Allocated memory is still 247.5MB. Free memory was 177.1MB in the beginning and 193.9MB in the end (delta: -16.8MB). Peak memory consumption was 25.5MB. Max. memory is 8.0GB. * TraceAbstraction took 15555.20ms. Allocated memory was 247.5MB in the beginning and 582.0MB in the end (delta: 334.5MB). Free memory was 192.9MB in the beginning and 329.9MB in the end (delta: -137.1MB). Peak memory consumption was 197.4MB. 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 93, overapproximation of someUnaryDOUBLEoperation at line 26. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 0}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 0}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 0}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 0}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 0}, {0, 0} }; [L25-L27] double double_Array_0[5] = { 127.5, 15.75, 8.5, -0.5, 5.25 }; [L25-L27] double double_Array_0[5] = { 127.5, 15.75, 8.5, -0.5, 5.25 }; [L25-L27] double double_Array_0[5] = { 127.5, 15.75, 8.5, -0.5, 5.25 }; [L25-L27] double double_Array_0[5] = { 127.5, 15.75, 8.5, -0.5, 5.25 }; [L25-L27] double double_Array_0[5] = { 127.5, 15.75, 8.5, -0.5, 5.25 }; [L25-L27] double double_Array_0[5] = { 127.5, 15.75, 8.5, -0.5, 5.25 }; [L28-L30] signed long int signed_long_int_Array_0[5] = { -5, -100, 500, -5, -64 }; [L28-L30] signed long int signed_long_int_Array_0[5] = { -5, -100, 500, -5, -64 }; [L28-L30] signed long int signed_long_int_Array_0[5] = { -5, -100, 500, -5, -64 }; [L28-L30] signed long int signed_long_int_Array_0[5] = { -5, -100, 500, -5, -64 }; [L28-L30] signed long int signed_long_int_Array_0[5] = { -5, -100, 500, -5, -64 }; [L28-L30] signed long int signed_long_int_Array_0[5] = { -5, -100, 500, -5, -64 }; [L31] unsigned char last_1_BOOL_unsigned_char_Array_0_0__0_ = 1; [L97] isInitial = 1 [L98] FCALL initially() [L99] COND TRUE 1 [L100] CALL updateLastVariables() [L90] EXPR BOOL_unsigned_char_Array_0[0][0] [L90] last_1_BOOL_unsigned_char_Array_0_0__0_ = BOOL_unsigned_char_Array_0[0][0] [L100] RET updateLastVariables() [L101] CALL updateVariables() [L62] BOOL_unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L63] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L63] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L63] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L64] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L64] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L64] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L65] BOOL_unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L66] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L67] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L67] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L67] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L68] double_Array_0[1] = __VERIFIER_nondet_double() [L69] EXPR double_Array_0[1] [L69] EXPR double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L69] EXPR double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F [L69] EXPR double_Array_0[1] [L69] EXPR double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L69] EXPR (double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L69] EXPR (double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L69] CALL assume_abort_if_not((double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L69] RET assume_abort_if_not((double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L70] double_Array_0[2] = __VERIFIER_nondet_double() [L71] EXPR double_Array_0[2] [L71] EXPR double_Array_0[2] >= -922337.2036854765600e+13F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L71] EXPR double_Array_0[2] >= -922337.2036854765600e+13F && double_Array_0[2] <= -1.0e-20F [L71] EXPR double_Array_0[2] [L71] EXPR double_Array_0[2] >= -922337.2036854765600e+13F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L71] EXPR (double_Array_0[2] >= -922337.2036854765600e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854765600e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L71] EXPR (double_Array_0[2] >= -922337.2036854765600e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854765600e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L71] CALL assume_abort_if_not((double_Array_0[2] >= -922337.2036854765600e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854765600e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L71] RET assume_abort_if_not((double_Array_0[2] >= -922337.2036854765600e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854765600e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L72] double_Array_0[3] = __VERIFIER_nondet_double() [L73] EXPR double_Array_0[3] [L73] EXPR double_Array_0[3] >= -461168.6018427382800e+13F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L73] EXPR double_Array_0[3] >= -461168.6018427382800e+13F && double_Array_0[3] <= -1.0e-20F [L73] EXPR double_Array_0[3] [L73] EXPR double_Array_0[3] >= -461168.6018427382800e+13F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L73] EXPR (double_Array_0[3] >= -461168.6018427382800e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L73] EXPR (double_Array_0[3] >= -461168.6018427382800e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L73] CALL assume_abort_if_not((double_Array_0[3] >= -461168.6018427382800e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L73] RET assume_abort_if_not((double_Array_0[3] >= -461168.6018427382800e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L74] double_Array_0[4] = __VERIFIER_nondet_double() [L75] EXPR double_Array_0[4] [L75] EXPR double_Array_0[4] >= -461168.6018427382800e+13F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L75] EXPR double_Array_0[4] >= -461168.6018427382800e+13F && double_Array_0[4] <= -1.0e-20F [L75] EXPR double_Array_0[4] [L75] EXPR double_Array_0[4] >= -461168.6018427382800e+13F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L75] EXPR (double_Array_0[4] >= -461168.6018427382800e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L75] EXPR (double_Array_0[4] >= -461168.6018427382800e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L75] CALL assume_abort_if_not((double_Array_0[4] >= -461168.6018427382800e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L75] RET assume_abort_if_not((double_Array_0[4] >= -461168.6018427382800e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L76] signed_long_int_Array_0[0] = __VERIFIER_nondet_long() [L77] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L77] CALL assume_abort_if_not(signed_long_int_Array_0[0] >= -536870912) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L77] RET assume_abort_if_not(signed_long_int_Array_0[0] >= -536870912) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L78] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L78] CALL assume_abort_if_not(signed_long_int_Array_0[0] <= 536870912) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L78] RET assume_abort_if_not(signed_long_int_Array_0[0] <= 536870912) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L79] signed_long_int_Array_0[1] = __VERIFIER_nondet_long() [L80] EXPR signed_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L80] CALL assume_abort_if_not(signed_long_int_Array_0[1] >= -536870911) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L80] RET assume_abort_if_not(signed_long_int_Array_0[1] >= -536870911) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L81] EXPR signed_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L81] CALL assume_abort_if_not(signed_long_int_Array_0[1] <= 536870911) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L81] RET assume_abort_if_not(signed_long_int_Array_0[1] <= 536870911) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L82] signed_long_int_Array_0[2] = __VERIFIER_nondet_long() [L83] EXPR signed_long_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L83] CALL assume_abort_if_not(signed_long_int_Array_0[2] >= -1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L83] RET assume_abort_if_not(signed_long_int_Array_0[2] >= -1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L84] EXPR signed_long_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L84] CALL assume_abort_if_not(signed_long_int_Array_0[2] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L84] RET assume_abort_if_not(signed_long_int_Array_0[2] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L85] signed_long_int_Array_0[3] = __VERIFIER_nondet_long() [L86] EXPR signed_long_int_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L86] CALL assume_abort_if_not(signed_long_int_Array_0[3] >= -1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L86] RET assume_abort_if_not(signed_long_int_Array_0[3] >= -1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L87] EXPR signed_long_int_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L87] CALL assume_abort_if_not(signed_long_int_Array_0[3] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L87] RET assume_abort_if_not(signed_long_int_Array_0[3] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L101] RET updateVariables() [L102] CALL step() [L35] unsigned char stepLocal_0 = last_1_BOOL_unsigned_char_Array_0_0__0_; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}, stepLocal_0=1] [L36] COND FALSE !(! last_1_BOOL_unsigned_char_Array_0_0__0_) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L41] EXPR signed_long_int_Array_0[3] [L41] signed long int stepLocal_2 = signed_long_int_Array_0[3]; [L42] EXPR signed_long_int_Array_0[1] [L42] signed long int stepLocal_1 = signed_long_int_Array_0[1]; [L43] EXPR signed_long_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L43] COND FALSE !(signed_long_int_Array_0[2] <= stepLocal_2) [L50] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L50] COND FALSE !(! BOOL_unsigned_char_Array_0[0][0]) [L53] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L53] EXPR ((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]) [L53] EXPR signed_long_int_Array_0[0] [L53] EXPR ((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}, stepLocal_0=1, stepLocal_1=536870911, stepLocal_2=-1073741823] [L53] EXPR signed_long_int_Array_0[1] [L53] EXPR signed_long_int_Array_0[3] [L53] signed_long_int_Array_0[4] = ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) + signed_long_int_Array_0[1]) + signed_long_int_Array_0[3]) [L55] BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L55] COND FALSE !(BOOL_unsigned_char_Array_0[0][1]) [L58] EXPR double_Array_0[4] [L58] double_Array_0[0] = double_Array_0[4] [L102] RET step() [L103] CALL, EXPR property() [L93] EXPR (! last_1_BOOL_unsigned_char_Array_0_0__0_) ? ((last_1_BOOL_unsigned_char_Array_0_0__0_ && last_1_BOOL_unsigned_char_Array_0_0__0_) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1 [L93] EXPR (! last_1_BOOL_unsigned_char_Array_0_0__0_) ? ((last_1_BOOL_unsigned_char_Array_0_0__0_ && last_1_BOOL_unsigned_char_Array_0_0__0_) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L93] EXPR ((! last_1_BOOL_unsigned_char_Array_0_0__0_) ? ((last_1_BOOL_unsigned_char_Array_0_0__0_ && last_1_BOOL_unsigned_char_Array_0_0__0_) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) && ((! BOOL_unsigned_char_Array_0[0][0]) ? (signed_long_int_Array_0[4] == ((signed long int) (signed_long_int_Array_0[3] + signed_long_int_Array_0[2]))) : (signed_long_int_Array_0[4] == ((signed long int) ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) + signed_long_int_Array_0[1]) + signed_long_int_Array_0[3])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L93] EXPR ((! last_1_BOOL_unsigned_char_Array_0_0__0_) ? ((last_1_BOOL_unsigned_char_Array_0_0__0_ && last_1_BOOL_unsigned_char_Array_0_0__0_) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) && ((! BOOL_unsigned_char_Array_0[0][0]) ? (signed_long_int_Array_0[4] == ((signed long int) (signed_long_int_Array_0[3] + signed_long_int_Array_0[2]))) : (signed_long_int_Array_0[4] == ((signed long int) ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) + signed_long_int_Array_0[1]) + signed_long_int_Array_0[3])))) [L93] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L93] EXPR (! BOOL_unsigned_char_Array_0[0][0]) ? (signed_long_int_Array_0[4] == ((signed long int) (signed_long_int_Array_0[3] + signed_long_int_Array_0[2]))) : (signed_long_int_Array_0[4] == ((signed long int) ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) + signed_long_int_Array_0[1]) + signed_long_int_Array_0[3]))) [L93] EXPR signed_long_int_Array_0[4] [L93] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L93] EXPR ((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]) [L93] EXPR signed_long_int_Array_0[0] [L93] EXPR ((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L93] EXPR signed_long_int_Array_0[1] [L93] EXPR signed_long_int_Array_0[3] [L93] EXPR (! BOOL_unsigned_char_Array_0[0][0]) ? (signed_long_int_Array_0[4] == ((signed long int) (signed_long_int_Array_0[3] + signed_long_int_Array_0[2]))) : (signed_long_int_Array_0[4] == ((signed long int) ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) + signed_long_int_Array_0[1]) + signed_long_int_Array_0[3]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L93] EXPR ((! last_1_BOOL_unsigned_char_Array_0_0__0_) ? ((last_1_BOOL_unsigned_char_Array_0_0__0_ && last_1_BOOL_unsigned_char_Array_0_0__0_) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) && ((! BOOL_unsigned_char_Array_0[0][0]) ? (signed_long_int_Array_0[4] == ((signed long int) (signed_long_int_Array_0[3] + signed_long_int_Array_0[2]))) : (signed_long_int_Array_0[4] == ((signed long int) ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) + signed_long_int_Array_0[1]) + signed_long_int_Array_0[3])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L93] EXPR (((! last_1_BOOL_unsigned_char_Array_0_0__0_) ? ((last_1_BOOL_unsigned_char_Array_0_0__0_ && last_1_BOOL_unsigned_char_Array_0_0__0_) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) && ((! BOOL_unsigned_char_Array_0[0][0]) ? (signed_long_int_Array_0[4] == ((signed long int) (signed_long_int_Array_0[3] + signed_long_int_Array_0[2]))) : (signed_long_int_Array_0[4] == ((signed long int) ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) + signed_long_int_Array_0[1]) + signed_long_int_Array_0[3]))))) && ((signed_long_int_Array_0[2] <= signed_long_int_Array_0[3]) ? ((signed_long_int_Array_0[1] >= signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][1] || (! BOOL_unsigned_char_Array_0[1][0]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L93] EXPR (((! last_1_BOOL_unsigned_char_Array_0_0__0_) ? ((last_1_BOOL_unsigned_char_Array_0_0__0_ && last_1_BOOL_unsigned_char_Array_0_0__0_) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) && ((! BOOL_unsigned_char_Array_0[0][0]) ? (signed_long_int_Array_0[4] == ((signed long int) (signed_long_int_Array_0[3] + signed_long_int_Array_0[2]))) : (signed_long_int_Array_0[4] == ((signed long int) ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) + signed_long_int_Array_0[1]) + signed_long_int_Array_0[3]))))) && ((signed_long_int_Array_0[2] <= signed_long_int_Array_0[3]) ? ((signed_long_int_Array_0[1] >= signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][1] || (! BOOL_unsigned_char_Array_0[1][0]))))) : 1) [L93] EXPR signed_long_int_Array_0[2] [L93] EXPR signed_long_int_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L93] EXPR (signed_long_int_Array_0[2] <= signed_long_int_Array_0[3]) ? ((signed_long_int_Array_0[1] >= signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][1] || (! BOOL_unsigned_char_Array_0[1][0]))))) : 1 [L93] EXPR (signed_long_int_Array_0[2] <= signed_long_int_Array_0[3]) ? ((signed_long_int_Array_0[1] >= signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][1] || (! BOOL_unsigned_char_Array_0[1][0]))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L93] EXPR (((! last_1_BOOL_unsigned_char_Array_0_0__0_) ? ((last_1_BOOL_unsigned_char_Array_0_0__0_ && last_1_BOOL_unsigned_char_Array_0_0__0_) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) && ((! BOOL_unsigned_char_Array_0[0][0]) ? (signed_long_int_Array_0[4] == ((signed long int) (signed_long_int_Array_0[3] + signed_long_int_Array_0[2]))) : (signed_long_int_Array_0[4] == ((signed long int) ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) + signed_long_int_Array_0[1]) + signed_long_int_Array_0[3]))))) && ((signed_long_int_Array_0[2] <= signed_long_int_Array_0[3]) ? ((signed_long_int_Array_0[1] >= signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][1] || (! BOOL_unsigned_char_Array_0[1][0]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L93] EXPR ((((! last_1_BOOL_unsigned_char_Array_0_0__0_) ? ((last_1_BOOL_unsigned_char_Array_0_0__0_ && last_1_BOOL_unsigned_char_Array_0_0__0_) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) && ((! BOOL_unsigned_char_Array_0[0][0]) ? (signed_long_int_Array_0[4] == ((signed long int) (signed_long_int_Array_0[3] + signed_long_int_Array_0[2]))) : (signed_long_int_Array_0[4] == ((signed long int) ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) + signed_long_int_Array_0[1]) + signed_long_int_Array_0[3]))))) && ((signed_long_int_Array_0[2] <= signed_long_int_Array_0[3]) ? ((signed_long_int_Array_0[1] >= signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][1] || (! BOOL_unsigned_char_Array_0[1][0]))))) : 1)) && (BOOL_unsigned_char_Array_0[0][1] ? (double_Array_0[0] == ((double) (((((((((double_Array_0[1]) > (double_Array_0[3])) ? (double_Array_0[1]) : (double_Array_0[3]))) + double_Array_0[4])) < ((((((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) < 0 ) ? -((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) : ((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))))))) ? ((((((double_Array_0[1]) > (double_Array_0[3])) ? (double_Array_0[1]) : (double_Array_0[3]))) + double_Array_0[4])) : ((((((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) < 0 ) ? -((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) : ((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2])))))))))) : (double_Array_0[0] == ((double) double_Array_0[4]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L93] EXPR ((((! last_1_BOOL_unsigned_char_Array_0_0__0_) ? ((last_1_BOOL_unsigned_char_Array_0_0__0_ && last_1_BOOL_unsigned_char_Array_0_0__0_) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) && ((! BOOL_unsigned_char_Array_0[0][0]) ? (signed_long_int_Array_0[4] == ((signed long int) (signed_long_int_Array_0[3] + signed_long_int_Array_0[2]))) : (signed_long_int_Array_0[4] == ((signed long int) ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) + signed_long_int_Array_0[1]) + signed_long_int_Array_0[3]))))) && ((signed_long_int_Array_0[2] <= signed_long_int_Array_0[3]) ? ((signed_long_int_Array_0[1] >= signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][1] || (! BOOL_unsigned_char_Array_0[1][0]))))) : 1)) && (BOOL_unsigned_char_Array_0[0][1] ? (double_Array_0[0] == ((double) (((((((((double_Array_0[1]) > (double_Array_0[3])) ? (double_Array_0[1]) : (double_Array_0[3]))) + double_Array_0[4])) < ((((((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) < 0 ) ? -((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) : ((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))))))) ? ((((((double_Array_0[1]) > (double_Array_0[3])) ? (double_Array_0[1]) : (double_Array_0[3]))) + double_Array_0[4])) : ((((((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) < 0 ) ? -((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) : ((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2])))))))))) : (double_Array_0[0] == ((double) double_Array_0[4]))) [L93] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L93] EXPR BOOL_unsigned_char_Array_0[0][1] ? (double_Array_0[0] == ((double) (((((((((double_Array_0[1]) > (double_Array_0[3])) ? (double_Array_0[1]) : (double_Array_0[3]))) + double_Array_0[4])) < ((((((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) < 0 ) ? -((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) : ((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))))))) ? ((((((double_Array_0[1]) > (double_Array_0[3])) ? (double_Array_0[1]) : (double_Array_0[3]))) + double_Array_0[4])) : ((((((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) < 0 ) ? -((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) : ((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2])))))))))) : (double_Array_0[0] == ((double) double_Array_0[4])) [L93] EXPR double_Array_0[0] [L93] EXPR double_Array_0[4] [L93] EXPR BOOL_unsigned_char_Array_0[0][1] ? (double_Array_0[0] == ((double) (((((((((double_Array_0[1]) > (double_Array_0[3])) ? (double_Array_0[1]) : (double_Array_0[3]))) + double_Array_0[4])) < ((((((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) < 0 ) ? -((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) : ((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))))))) ? ((((((double_Array_0[1]) > (double_Array_0[3])) ? (double_Array_0[1]) : (double_Array_0[3]))) + double_Array_0[4])) : ((((((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) < 0 ) ? -((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) : ((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2])))))))))) : (double_Array_0[0] == ((double) double_Array_0[4])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L93] EXPR ((((! last_1_BOOL_unsigned_char_Array_0_0__0_) ? ((last_1_BOOL_unsigned_char_Array_0_0__0_ && last_1_BOOL_unsigned_char_Array_0_0__0_) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) && ((! BOOL_unsigned_char_Array_0[0][0]) ? (signed_long_int_Array_0[4] == ((signed long int) (signed_long_int_Array_0[3] + signed_long_int_Array_0[2]))) : (signed_long_int_Array_0[4] == ((signed long int) ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) + signed_long_int_Array_0[1]) + signed_long_int_Array_0[3]))))) && ((signed_long_int_Array_0[2] <= signed_long_int_Array_0[3]) ? ((signed_long_int_Array_0[1] >= signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][1] || (! BOOL_unsigned_char_Array_0[1][0]))))) : 1)) && (BOOL_unsigned_char_Array_0[0][1] ? (double_Array_0[0] == ((double) (((((((((double_Array_0[1]) > (double_Array_0[3])) ? (double_Array_0[1]) : (double_Array_0[3]))) + double_Array_0[4])) < ((((((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) < 0 ) ? -((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) : ((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))))))) ? ((((((double_Array_0[1]) > (double_Array_0[3])) ? (double_Array_0[1]) : (double_Array_0[3]))) + double_Array_0[4])) : ((((((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) < 0 ) ? -((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) : ((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2])))))))))) : (double_Array_0[0] == ((double) double_Array_0[4]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L93-L94] return ((((! last_1_BOOL_unsigned_char_Array_0_0__0_) ? ((last_1_BOOL_unsigned_char_Array_0_0__0_ && last_1_BOOL_unsigned_char_Array_0_0__0_) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) && ((! BOOL_unsigned_char_Array_0[0][0]) ? (signed_long_int_Array_0[4] == ((signed long int) (signed_long_int_Array_0[3] + signed_long_int_Array_0[2]))) : (signed_long_int_Array_0[4] == ((signed long int) ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) + signed_long_int_Array_0[1]) + signed_long_int_Array_0[3]))))) && ((signed_long_int_Array_0[2] <= signed_long_int_Array_0[3]) ? ((signed_long_int_Array_0[1] >= signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][1] || (! BOOL_unsigned_char_Array_0[1][0]))))) : 1)) && (BOOL_unsigned_char_Array_0[0][1] ? (double_Array_0[0] == ((double) (((((((((double_Array_0[1]) > (double_Array_0[3])) ? (double_Array_0[1]) : (double_Array_0[3]))) + double_Array_0[4])) < ((((((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) < 0 ) ? -((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) : ((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))))))) ? ((((((double_Array_0[1]) > (double_Array_0[3])) ? (double_Array_0[1]) : (double_Array_0[3]))) + double_Array_0[4])) : ((((((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) < 0 ) ? -((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) : ((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2])))))))))) : (double_Array_0[0] == ((double) double_Array_0[4]))) ; [L103] RET, EXPR property() [L103] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 142 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.4s, OverallIterations: 23, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6798 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6788 mSDsluCounter, 27789 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21871 mSDsCounter, 233 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4135 IncrementalHoareTripleChecker+Invalid, 4368 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 233 mSolverCounterUnsat, 5918 mSDtfsCounter, 4135 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1273 GetRequests, 1058 SyntacticMatches, 2 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1823 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1193occurred in iteration=21, InterpolantAutomatonStates: 216, 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, 3352 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 3202 NumberOfCodeBlocks, 3202 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 3177 ConstructedInterpolants, 0 QuantifiedInterpolants, 10637 SizeOfPredicates, 13 NumberOfNonLiveVariables, 472 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 24 InterpolantComputations, 21 PerfectInterpolantSequences, 11394/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-19 15:00:16,475 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...