./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-90.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-90.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 018e436f7a98b5e0faa97a2819a6cebbd0a6f7e6f554350f973b951d0d48d577 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 09:13:03,019 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 09:13:03,095 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 09:13:03,102 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 09:13:03,103 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 09:13:03,129 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 09:13:03,130 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 09:13:03,131 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 09:13:03,131 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 09:13:03,132 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 09:13:03,133 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 09:13:03,134 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 09:13:03,134 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 09:13:03,136 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 09:13:03,137 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 09:13:03,137 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 09:13:03,138 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 09:13:03,138 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 09:13:03,138 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 09:13:03,138 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 09:13:03,142 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 09:13:03,143 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 09:13:03,143 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 09:13:03,143 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 09:13:03,144 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 09:13:03,144 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 09:13:03,144 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 09:13:03,144 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 09:13:03,145 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 09:13:03,145 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 09:13:03,145 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 09:13:03,145 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 09:13:03,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:13:03,146 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 09:13:03,146 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 09:13:03,147 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 09:13:03,147 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 09:13:03,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 09:13:03,148 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 09:13:03,148 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 09:13:03,148 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 09:13:03,149 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 09:13:03,149 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 018e436f7a98b5e0faa97a2819a6cebbd0a6f7e6f554350f973b951d0d48d577 [2024-11-20 09:13:03,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 09:13:03,440 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 09:13:03,443 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 09:13:03,444 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 09:13:03,445 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 09:13:03,447 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-90.i [2024-11-20 09:13:04,877 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 09:13:05,124 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 09:13:05,125 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-90.i [2024-11-20 09:13:05,136 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e83feac8f/cc01e6da8e3043a2a82f449365e27fa5/FLAG50bddd257 [2024-11-20 09:13:05,151 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e83feac8f/cc01e6da8e3043a2a82f449365e27fa5 [2024-11-20 09:13:05,153 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 09:13:05,154 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 09:13:05,156 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 09:13:05,156 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 09:13:05,161 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 09:13:05,161 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:13:05" (1/1) ... [2024-11-20 09:13:05,162 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23aef45a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:13:05, skipping insertion in model container [2024-11-20 09:13:05,162 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:13:05" (1/1) ... [2024-11-20 09:13:05,195 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 09:13:05,392 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-90.i[917,930] [2024-11-20 09:13:05,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:13:05,508 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 09:13:05,522 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-90.i[917,930] [2024-11-20 09:13:05,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:13:05,598 INFO L204 MainTranslator]: Completed translation [2024-11-20 09:13:05,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:13:05 WrapperNode [2024-11-20 09:13:05,598 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 09:13:05,599 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 09:13:05,601 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 09:13:05,601 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 09:13:05,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:13:05" (1/1) ... [2024-11-20 09:13:05,625 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:13:05" (1/1) ... [2024-11-20 09:13:05,661 INFO L138 Inliner]: procedures = 27, calls = 162, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 479 [2024-11-20 09:13:05,661 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 09:13:05,666 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 09:13:05,666 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 09:13:05,666 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 09:13:05,681 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:13:05" (1/1) ... [2024-11-20 09:13:05,681 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:13:05" (1/1) ... [2024-11-20 09:13:05,687 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:13:05" (1/1) ... [2024-11-20 09:13:05,709 INFO L175 MemorySlicer]: Split 131 memory accesses to 2 slices as follows [2, 129]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 35 writes are split as follows [0, 35]. [2024-11-20 09:13:05,710 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:13:05" (1/1) ... [2024-11-20 09:13:05,710 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:13:05" (1/1) ... [2024-11-20 09:13:05,729 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:13:05" (1/1) ... [2024-11-20 09:13:05,735 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:13:05" (1/1) ... [2024-11-20 09:13:05,740 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:13:05" (1/1) ... [2024-11-20 09:13:05,742 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:13:05" (1/1) ... [2024-11-20 09:13:05,749 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 09:13:05,750 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 09:13:05,750 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 09:13:05,751 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 09:13:05,751 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:13:05" (1/1) ... [2024-11-20 09:13:05,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:13:05,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:13:05,805 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) [2024-11-20 09:13:05,814 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 [2024-11-20 09:13:05,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 09:13:05,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-11-20 09:13:05,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-11-20 09:13:05,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 09:13:05,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 09:13:05,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 09:13:05,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 09:13:05,872 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 09:13:05,872 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 09:13:05,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 09:13:05,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 09:13:05,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 09:13:05,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 09:13:06,011 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 09:13:06,013 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 09:13:06,588 INFO L? ?]: Removed 112 outVars from TransFormulas that were not future-live. [2024-11-20 09:13:06,588 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 09:13:06,604 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 09:13:06,604 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 09:13:06,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:13:06 BoogieIcfgContainer [2024-11-20 09:13:06,607 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 09:13:06,610 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 09:13:06,610 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 09:13:06,621 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 09:13:06,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:13:05" (1/3) ... [2024-11-20 09:13:06,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75b21ba0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:13:06, skipping insertion in model container [2024-11-20 09:13:06,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:13:05" (2/3) ... [2024-11-20 09:13:06,623 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75b21ba0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:13:06, skipping insertion in model container [2024-11-20 09:13:06,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:13:06" (3/3) ... [2024-11-20 09:13:06,625 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-90.i [2024-11-20 09:13:06,643 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 09:13:06,643 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 09:13:06,706 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 09:13:06,715 INFO L333 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, 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;@153e8b62, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 09:13:06,716 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 09:13:06,721 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 88 states have (on average 1.375) internal successors, (121), 89 states have internal predecessors, (121), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 09:13:06,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-20 09:13:06,735 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:13:06,736 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:13:06,737 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:13:06,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:13:06,742 INFO L85 PathProgramCache]: Analyzing trace with hash -28564899, now seen corresponding path program 1 times [2024-11-20 09:13:06,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:13:06,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492021637] [2024-11-20 09:13:06,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:13:06,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:13:06,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:07,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:13:07,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:07,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:13:07,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:07,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:13:07,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:07,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:13:07,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:07,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:13:07,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:07,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:13:07,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:07,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:13:07,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:07,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:13:07,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:07,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:13:07,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:07,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:13:07,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:07,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:13:07,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:07,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:13:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:07,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:13:07,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:07,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:13:07,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:07,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 09:13:07,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:07,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 09:13:07,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:07,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 09:13:07,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:07,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 09:13:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:07,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 09:13:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:07,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 09:13:07,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:07,245 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 09:13:07,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:13:07,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492021637] [2024-11-20 09:13:07,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492021637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:13:07,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:13:07,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 09:13:07,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155467602] [2024-11-20 09:13:07,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:13:07,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 09:13:07,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:13:07,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 09:13:07,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 09:13:07,292 INFO L87 Difference]: Start difference. First operand has 111 states, 88 states have (on average 1.375) internal successors, (121), 89 states have internal predecessors, (121), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-20 09:13:07,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:13:07,325 INFO L93 Difference]: Finished difference Result 215 states and 336 transitions. [2024-11-20 09:13:07,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 09:13:07,328 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 153 [2024-11-20 09:13:07,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:13:07,335 INFO L225 Difference]: With dead ends: 215 [2024-11-20 09:13:07,335 INFO L226 Difference]: Without dead ends: 107 [2024-11-20 09:13:07,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 09:13:07,342 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 09:13:07,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:13:07,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-20 09:13:07,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-20 09:13:07,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 85 states have (on average 1.3411764705882352) internal successors, (114), 85 states have internal predecessors, (114), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 09:13:07,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 154 transitions. [2024-11-20 09:13:07,391 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 154 transitions. Word has length 153 [2024-11-20 09:13:07,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:13:07,392 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 154 transitions. [2024-11-20 09:13:07,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-20 09:13:07,392 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 154 transitions. [2024-11-20 09:13:07,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-20 09:13:07,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:13:07,396 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:13:07,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 09:13:07,397 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:13:07,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:13:07,397 INFO L85 PathProgramCache]: Analyzing trace with hash 856508981, now seen corresponding path program 1 times [2024-11-20 09:13:07,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:13:07,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164093966] [2024-11-20 09:13:07,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:13:07,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:13:07,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:07,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:13:07,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:07,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:13:07,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:07,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:13:07,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:07,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:13:07,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:07,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:13:07,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:07,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:13:07,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:07,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:13:07,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:07,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:13:07,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:07,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:13:07,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:07,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:13:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:07,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:13:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:07,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:13:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:07,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:13:07,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:07,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:13:07,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:07,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 09:13:07,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:07,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 09:13:07,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:07,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 09:13:07,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:07,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 09:13:07,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:07,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 09:13:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:07,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 09:13:07,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:07,991 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 09:13:07,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:13:07,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164093966] [2024-11-20 09:13:07,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164093966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:13:07,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:13:07,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 09:13:07,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964016737] [2024-11-20 09:13:07,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:13:07,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 09:13:07,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:13:07,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 09:13:07,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:13:07,998 INFO L87 Difference]: Start difference. First operand 107 states and 154 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 09:13:08,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:13:08,054 INFO L93 Difference]: Finished difference Result 213 states and 308 transitions. [2024-11-20 09:13:08,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 09:13:08,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 153 [2024-11-20 09:13:08,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:13:08,057 INFO L225 Difference]: With dead ends: 213 [2024-11-20 09:13:08,058 INFO L226 Difference]: Without dead ends: 109 [2024-11-20 09:13:08,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:13:08,060 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 09:13:08,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 445 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:13:08,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-20 09:13:08,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-20 09:13:08,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 87 states have (on average 1.3333333333333333) internal successors, (116), 87 states have internal predecessors, (116), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 09:13:08,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 156 transitions. [2024-11-20 09:13:08,085 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 156 transitions. Word has length 153 [2024-11-20 09:13:08,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:13:08,089 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 156 transitions. [2024-11-20 09:13:08,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 09:13:08,091 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 156 transitions. [2024-11-20 09:13:08,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-20 09:13:08,096 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:13:08,096 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:13:08,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 09:13:08,097 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:13:08,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:13:08,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1758725136, now seen corresponding path program 1 times [2024-11-20 09:13:08,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:13:08,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749850195] [2024-11-20 09:13:08,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:13:08,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:13:08,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:08,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:13:08,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:08,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:13:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:08,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:13:08,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:08,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:13:08,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:08,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:13:08,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:08,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:13:08,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:08,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:13:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:08,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:13:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:08,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:13:08,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:08,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:13:08,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:08,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:13:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:08,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:13:08,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:08,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:13:08,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:08,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:13:08,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:08,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 09:13:08,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:08,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 09:13:08,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:08,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 09:13:08,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:08,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 09:13:08,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:08,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 09:13:08,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:08,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 09:13:08,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:08,957 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 09:13:08,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:13:08,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749850195] [2024-11-20 09:13:08,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749850195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:13:08,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:13:08,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 09:13:08,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218920335] [2024-11-20 09:13:08,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:13:08,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 09:13:08,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:13:08,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 09:13:08,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:13:08,960 INFO L87 Difference]: Start difference. First operand 109 states and 156 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 09:13:09,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:13:09,281 INFO L93 Difference]: Finished difference Result 222 states and 319 transitions. [2024-11-20 09:13:09,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 09:13:09,282 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 155 [2024-11-20 09:13:09,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:13:09,284 INFO L225 Difference]: With dead ends: 222 [2024-11-20 09:13:09,284 INFO L226 Difference]: Without dead ends: 116 [2024-11-20 09:13:09,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-20 09:13:09,286 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 110 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 09:13:09,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 417 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 09:13:09,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-20 09:13:09,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2024-11-20 09:13:09,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 92 states have (on average 1.326086956521739) internal successors, (122), 92 states have internal predecessors, (122), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 09:13:09,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 162 transitions. [2024-11-20 09:13:09,298 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 162 transitions. Word has length 155 [2024-11-20 09:13:09,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:13:09,299 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 162 transitions. [2024-11-20 09:13:09,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 09:13:09,299 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 162 transitions. [2024-11-20 09:13:09,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-20 09:13:09,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:13:09,302 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:13:09,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 09:13:09,302 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:13:09,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:13:09,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1539870418, now seen corresponding path program 1 times [2024-11-20 09:13:09,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:13:09,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116488960] [2024-11-20 09:13:09,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:13:09,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:13:09,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:10,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:13:10,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:10,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:13:10,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:10,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:13:10,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:10,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:13:10,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:10,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:13:10,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:10,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:13:10,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:10,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:13:10,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:10,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:13:10,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:10,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:13:10,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:10,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:13:10,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:10,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:13:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:10,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:13:10,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:10,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:13:10,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:10,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:13:10,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:10,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 09:13:10,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:10,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 09:13:10,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:10,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 09:13:10,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:10,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 09:13:10,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:10,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 09:13:10,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:10,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 09:13:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:10,221 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 09:13:10,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:13:10,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116488960] [2024-11-20 09:13:10,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116488960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:13:10,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:13:10,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 09:13:10,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075752241] [2024-11-20 09:13:10,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:13:10,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 09:13:10,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:13:10,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 09:13:10,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 09:13:10,227 INFO L87 Difference]: Start difference. First operand 114 states and 162 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 09:13:10,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:13:10,715 INFO L93 Difference]: Finished difference Result 262 states and 372 transitions. [2024-11-20 09:13:10,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 09:13:10,716 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 155 [2024-11-20 09:13:10,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:13:10,718 INFO L225 Difference]: With dead ends: 262 [2024-11-20 09:13:10,718 INFO L226 Difference]: Without dead ends: 151 [2024-11-20 09:13:10,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-20 09:13:10,719 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 197 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 09:13:10,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 361 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 09:13:10,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-20 09:13:10,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 116. [2024-11-20 09:13:10,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 94 states have (on average 1.3191489361702127) internal successors, (124), 94 states have internal predecessors, (124), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 09:13:10,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 164 transitions. [2024-11-20 09:13:10,738 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 164 transitions. Word has length 155 [2024-11-20 09:13:10,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:13:10,739 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 164 transitions. [2024-11-20 09:13:10,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 09:13:10,741 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 164 transitions. [2024-11-20 09:13:10,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-20 09:13:10,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:13:10,743 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:13:10,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 09:13:10,743 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:13:10,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:13:10,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1839204390, now seen corresponding path program 1 times [2024-11-20 09:13:10,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:13:10,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420631911] [2024-11-20 09:13:10,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:13:10,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:13:10,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:12,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:13:12,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:12,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:13:12,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:12,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:13:12,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:12,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:13:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:12,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:13:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:12,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:13:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:12,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:13:12,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:12,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:13:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:12,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:13:12,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:12,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:13:12,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:12,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:13:12,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:12,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:13:12,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:12,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:13:12,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:13,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:13:13,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:13,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 09:13:13,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:13,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 09:13:13,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:13,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 09:13:13,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:13,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 09:13:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:13,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 09:13:13,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:13,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 09:13:13,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:13,073 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 09:13:13,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:13:13,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420631911] [2024-11-20 09:13:13,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420631911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:13:13,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:13:13,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-20 09:13:13,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499825587] [2024-11-20 09:13:13,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:13:13,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 09:13:13,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:13:13,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 09:13:13,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-20 09:13:13,078 INFO L87 Difference]: Start difference. First operand 116 states and 164 transitions. Second operand has 13 states, 12 states have (on average 4.916666666666667) internal successors, (59), 13 states have internal predecessors, (59), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-20 09:13:14,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:13:14,032 INFO L93 Difference]: Finished difference Result 290 states and 410 transitions. [2024-11-20 09:13:14,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 09:13:14,034 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.916666666666667) internal successors, (59), 13 states have internal predecessors, (59), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 156 [2024-11-20 09:13:14,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:13:14,036 INFO L225 Difference]: With dead ends: 290 [2024-11-20 09:13:14,036 INFO L226 Difference]: Without dead ends: 177 [2024-11-20 09:13:14,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2024-11-20 09:13:14,039 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 419 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 09:13:14,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 409 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 09:13:14,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-20 09:13:14,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 137. [2024-11-20 09:13:14,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 115 states have (on average 1.3391304347826087) internal successors, (154), 115 states have internal predecessors, (154), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 09:13:14,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 194 transitions. [2024-11-20 09:13:14,067 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 194 transitions. Word has length 156 [2024-11-20 09:13:14,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:13:14,069 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 194 transitions. [2024-11-20 09:13:14,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.916666666666667) internal successors, (59), 13 states have internal predecessors, (59), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-20 09:13:14,070 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 194 transitions. [2024-11-20 09:13:14,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-20 09:13:14,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:13:14,072 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:13:14,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 09:13:14,072 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:13:14,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:13:14,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1868956892, now seen corresponding path program 1 times [2024-11-20 09:13:14,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:13:14,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669187092] [2024-11-20 09:13:14,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:13:14,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:13:14,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:15,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:13:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:15,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:13:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:15,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:13:15,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:15,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:13:15,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:15,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:13:15,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:15,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:13:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:15,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:13:15,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:15,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:13:15,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:15,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:13:15,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:16,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:13:16,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:16,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:13:16,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:16,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:13:16,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:16,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:13:16,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:16,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:13:16,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:16,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 09:13:16,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:16,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 09:13:16,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:16,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 09:13:16,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:16,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 09:13:16,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:16,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 09:13:16,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:16,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 09:13:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:16,108 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 09:13:16,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:13:16,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669187092] [2024-11-20 09:13:16,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669187092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:13:16,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:13:16,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 09:13:16,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884036876] [2024-11-20 09:13:16,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:13:16,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 09:13:16,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:13:16,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 09:13:16,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-20 09:13:16,113 INFO L87 Difference]: Start difference. First operand 137 states and 194 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 09:13:16,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:13:16,901 INFO L93 Difference]: Finished difference Result 401 states and 563 transitions. [2024-11-20 09:13:16,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 09:13:16,902 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 156 [2024-11-20 09:13:16,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:13:16,904 INFO L225 Difference]: With dead ends: 401 [2024-11-20 09:13:16,904 INFO L226 Difference]: Without dead ends: 267 [2024-11-20 09:13:16,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2024-11-20 09:13:16,905 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 292 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 09:13:16,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 622 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 09:13:16,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-11-20 09:13:16,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 156. [2024-11-20 09:13:16,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 134 states have (on average 1.3432835820895523) internal successors, (180), 134 states have internal predecessors, (180), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 09:13:16,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 220 transitions. [2024-11-20 09:13:16,923 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 220 transitions. Word has length 156 [2024-11-20 09:13:16,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:13:16,924 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 220 transitions. [2024-11-20 09:13:16,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 09:13:16,924 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 220 transitions. [2024-11-20 09:13:16,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-20 09:13:16,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:13:16,926 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:13:16,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 09:13:16,926 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:13:16,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:13:16,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1084467217, now seen corresponding path program 1 times [2024-11-20 09:13:16,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:13:16,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804394156] [2024-11-20 09:13:16,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:13:16,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:13:16,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:18,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:13:18,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:18,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:13:18,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:18,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:13:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:18,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:13:18,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:18,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:13:18,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:18,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:13:18,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:18,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:13:18,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:18,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:13:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:18,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:13:18,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:18,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:13:18,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:18,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:13:18,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:18,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:13:18,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:18,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:13:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:18,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:13:18,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:18,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 09:13:18,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:18,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 09:13:18,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:18,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 09:13:18,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:18,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 09:13:18,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:18,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 09:13:18,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:18,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 09:13:18,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:18,848 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 09:13:18,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:13:18,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804394156] [2024-11-20 09:13:18,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804394156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:13:18,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:13:18,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-20 09:13:18,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669733749] [2024-11-20 09:13:18,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:13:18,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 09:13:18,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:13:18,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 09:13:18,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-20 09:13:18,851 INFO L87 Difference]: Start difference. First operand 156 states and 220 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-20 09:13:19,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:13:19,652 INFO L93 Difference]: Finished difference Result 369 states and 519 transitions. [2024-11-20 09:13:19,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 09:13:19,653 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 157 [2024-11-20 09:13:19,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:13:19,654 INFO L225 Difference]: With dead ends: 369 [2024-11-20 09:13:19,655 INFO L226 Difference]: Without dead ends: 216 [2024-11-20 09:13:19,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2024-11-20 09:13:19,656 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 702 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 09:13:19,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 329 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 09:13:19,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-20 09:13:19,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 171. [2024-11-20 09:13:19,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 149 states have (on average 1.348993288590604) internal successors, (201), 149 states have internal predecessors, (201), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 09:13:19,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 241 transitions. [2024-11-20 09:13:19,682 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 241 transitions. Word has length 157 [2024-11-20 09:13:19,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:13:19,682 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 241 transitions. [2024-11-20 09:13:19,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-20 09:13:19,683 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 241 transitions. [2024-11-20 09:13:19,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-20 09:13:19,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:13:19,684 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:13:19,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 09:13:19,685 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:13:19,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:13:19,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1671273231, now seen corresponding path program 1 times [2024-11-20 09:13:19,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:13:19,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957215726] [2024-11-20 09:13:19,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:13:19,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:13:19,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:22,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:13:22,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:22,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:13:22,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:22,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:13:22,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:22,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:13:22,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:22,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:13:22,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:22,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:13:22,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:22,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:13:22,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:22,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:13:22,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:22,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:13:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:22,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:13:22,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:22,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:13:22,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:22,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:13:22,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:22,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:13:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:22,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:13:22,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:22,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 09:13:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:22,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 09:13:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:22,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 09:13:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:22,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 09:13:22,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:22,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 09:13:22,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:23,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 09:13:23,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:23,025 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 09:13:23,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:13:23,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957215726] [2024-11-20 09:13:23,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957215726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:13:23,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:13:23,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-20 09:13:23,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971285116] [2024-11-20 09:13:23,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:13:23,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 09:13:23,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:13:23,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 09:13:23,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-20 09:13:23,028 INFO L87 Difference]: Start difference. First operand 171 states and 241 transitions. Second operand has 13 states, 12 states have (on average 5.0) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-20 09:13:25,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:13:25,032 INFO L93 Difference]: Finished difference Result 416 states and 583 transitions. [2024-11-20 09:13:25,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 09:13:25,033 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.0) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 157 [2024-11-20 09:13:25,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:13:25,035 INFO L225 Difference]: With dead ends: 416 [2024-11-20 09:13:25,035 INFO L226 Difference]: Without dead ends: 248 [2024-11-20 09:13:25,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2024-11-20 09:13:25,038 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 390 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 09:13:25,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 793 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 09:13:25,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-11-20 09:13:25,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 144. [2024-11-20 09:13:25,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 122 states have (on average 1.3360655737704918) internal successors, (163), 122 states have internal predecessors, (163), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 09:13:25,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 203 transitions. [2024-11-20 09:13:25,057 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 203 transitions. Word has length 157 [2024-11-20 09:13:25,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:13:25,058 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 203 transitions. [2024-11-20 09:13:25,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.0) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-20 09:13:25,059 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 203 transitions. [2024-11-20 09:13:25,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-20 09:13:25,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:13:25,060 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:13:25,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 09:13:25,060 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:13:25,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:13:25,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1149188459, now seen corresponding path program 1 times [2024-11-20 09:13:25,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:13:25,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19033576] [2024-11-20 09:13:25,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:13:25,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:13:25,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:30,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:13:30,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:30,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:13:30,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:30,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:13:30,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:30,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:13:30,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:30,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:13:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:30,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:13:30,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:30,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:13:30,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:30,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:13:30,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:30,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:13:30,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:30,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:13:30,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:30,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:13:30,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:30,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:13:30,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:30,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:13:30,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:30,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:13:30,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:30,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 09:13:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:30,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 09:13:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:30,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 09:13:30,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:30,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 09:13:30,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:30,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 09:13:30,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:30,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 09:13:30,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:30,785 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 09:13:30,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:13:30,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19033576] [2024-11-20 09:13:30,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19033576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:13:30,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:13:30,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2024-11-20 09:13:30,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121535172] [2024-11-20 09:13:30,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:13:30,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-20 09:13:30,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:13:30,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-20 09:13:30,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2024-11-20 09:13:30,788 INFO L87 Difference]: Start difference. First operand 144 states and 203 transitions. Second operand has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 23 states have internal predecessors, (60), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 4 states have call predecessors, (20), 5 states have call successors, (20) [2024-11-20 09:13:34,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:13:34,900 INFO L93 Difference]: Finished difference Result 606 states and 850 transitions. [2024-11-20 09:13:34,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-20 09:13:34,901 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 23 states have internal predecessors, (60), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 4 states have call predecessors, (20), 5 states have call successors, (20) Word has length 157 [2024-11-20 09:13:34,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:13:34,904 INFO L225 Difference]: With dead ends: 606 [2024-11-20 09:13:34,904 INFO L226 Difference]: Without dead ends: 465 [2024-11-20 09:13:34,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=370, Invalid=1700, Unknown=0, NotChecked=0, Total=2070 [2024-11-20 09:13:34,906 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 1181 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 1918 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1181 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 2130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 1918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-20 09:13:34,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1181 Valid, 1181 Invalid, 2130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 1918 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-20 09:13:34,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2024-11-20 09:13:34,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 218. [2024-11-20 09:13:34,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 175 states have (on average 1.3085714285714285) internal successors, (229), 175 states have internal predecessors, (229), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-20 09:13:34,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 309 transitions. [2024-11-20 09:13:34,949 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 309 transitions. Word has length 157 [2024-11-20 09:13:34,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:13:34,949 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 309 transitions. [2024-11-20 09:13:34,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 23 states have internal predecessors, (60), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 4 states have call predecessors, (20), 5 states have call successors, (20) [2024-11-20 09:13:34,950 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 309 transitions. [2024-11-20 09:13:34,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-20 09:13:34,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:13:34,951 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:13:34,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 09:13:34,952 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:13:34,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:13:34,952 INFO L85 PathProgramCache]: Analyzing trace with hash 138071209, now seen corresponding path program 1 times [2024-11-20 09:13:34,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:13:34,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889287159] [2024-11-20 09:13:34,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:13:34,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:13:34,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:35,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:13:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:35,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:13:35,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:35,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:13:35,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:35,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:13:35,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:35,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:13:35,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:35,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:13:35,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:35,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:13:35,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:35,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:13:35,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:35,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:13:35,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:35,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:13:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:35,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:13:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:35,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:13:35,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:35,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:13:35,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:35,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:13:35,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:35,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 09:13:35,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:35,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 09:13:35,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:35,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 09:13:35,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:35,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 09:13:35,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:35,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 09:13:35,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:35,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 09:13:35,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:35,565 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 09:13:35,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:13:35,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889287159] [2024-11-20 09:13:35,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889287159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:13:35,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:13:35,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 09:13:35,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207743974] [2024-11-20 09:13:35,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:13:35,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 09:13:35,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:13:35,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 09:13:35,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-20 09:13:35,568 INFO L87 Difference]: Start difference. First operand 218 states and 309 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 09:13:35,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:13:35,962 INFO L93 Difference]: Finished difference Result 401 states and 567 transitions. [2024-11-20 09:13:35,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 09:13:35,962 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 157 [2024-11-20 09:13:35,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:13:35,964 INFO L225 Difference]: With dead ends: 401 [2024-11-20 09:13:35,964 INFO L226 Difference]: Without dead ends: 260 [2024-11-20 09:13:35,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-20 09:13:35,966 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 207 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 09:13:35,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 438 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 09:13:35,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-20 09:13:35,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 222. [2024-11-20 09:13:36,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 179 states have (on average 1.3016759776536313) internal successors, (233), 179 states have internal predecessors, (233), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-20 09:13:36,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 313 transitions. [2024-11-20 09:13:36,001 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 313 transitions. Word has length 157 [2024-11-20 09:13:36,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:13:36,002 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 313 transitions. [2024-11-20 09:13:36,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 09:13:36,002 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 313 transitions. [2024-11-20 09:13:36,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-20 09:13:36,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:13:36,004 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:13:36,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 09:13:36,004 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:13:36,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:13:36,004 INFO L85 PathProgramCache]: Analyzing trace with hash -844956247, now seen corresponding path program 1 times [2024-11-20 09:13:36,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:13:36,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147337125] [2024-11-20 09:13:36,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:13:36,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:13:36,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:38,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:13:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:38,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:13:38,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:38,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:13:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:38,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:13:38,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:38,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:13:38,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:38,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:13:38,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:38,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:13:38,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:38,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:13:38,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:38,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:13:38,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:38,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:13:38,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:38,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:13:38,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:38,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:13:38,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:38,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:13:38,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:38,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:13:38,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:38,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 09:13:38,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:38,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 09:13:38,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:38,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 09:13:38,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:38,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 09:13:38,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:38,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 09:13:38,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:38,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 09:13:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:38,590 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 09:13:38,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:13:38,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147337125] [2024-11-20 09:13:38,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147337125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:13:38,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:13:38,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-20 09:13:38,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922155678] [2024-11-20 09:13:38,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:13:38,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 09:13:38,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:13:38,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 09:13:38,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-20 09:13:38,592 INFO L87 Difference]: Start difference. First operand 222 states and 313 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-20 09:13:39,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:13:39,404 INFO L93 Difference]: Finished difference Result 405 states and 570 transitions. [2024-11-20 09:13:39,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 09:13:39,405 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 157 [2024-11-20 09:13:39,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:13:39,407 INFO L225 Difference]: With dead ends: 405 [2024-11-20 09:13:39,407 INFO L226 Difference]: Without dead ends: 260 [2024-11-20 09:13:39,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-11-20 09:13:39,408 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 357 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 09:13:39,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 417 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 09:13:39,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-20 09:13:39,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 222. [2024-11-20 09:13:39,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 179 states have (on average 1.2960893854748603) internal successors, (232), 179 states have internal predecessors, (232), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-20 09:13:39,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 312 transitions. [2024-11-20 09:13:39,449 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 312 transitions. Word has length 157 [2024-11-20 09:13:39,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:13:39,450 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 312 transitions. [2024-11-20 09:13:39,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-20 09:13:39,450 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 312 transitions. [2024-11-20 09:13:39,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-20 09:13:39,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:13:39,452 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:13:39,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 09:13:39,454 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:13:39,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:13:39,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1856073497, now seen corresponding path program 1 times [2024-11-20 09:13:39,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:13:39,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567485454] [2024-11-20 09:13:39,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:13:39,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:13:39,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:44,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:13:44,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:44,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:13:44,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:44,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:13:44,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:44,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:13:44,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:44,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:13:44,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:44,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:13:44,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:45,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:13:45,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:45,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:13:45,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:45,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:13:45,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:45,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:13:45,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:45,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:13:45,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:45,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 09:13:45,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:45,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 09:13:45,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:45,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 09:13:45,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:45,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 09:13:45,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:45,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 09:13:45,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:45,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 09:13:45,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:45,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 09:13:45,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:45,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 09:13:45,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:45,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 09:13:45,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:45,267 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 15 proven. 42 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-20 09:13:45,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:13:45,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567485454] [2024-11-20 09:13:45,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567485454] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 09:13:45,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674000115] [2024-11-20 09:13:45,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:13:45,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 09:13:45,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:13:45,271 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) [2024-11-20 09:13:45,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 09:13:45,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:13:45,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 86 conjuncts are in the unsatisfiable core [2024-11-20 09:13:45,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:13:45,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 51 [2024-11-20 09:13:45,964 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 99 treesize of output 75 [2024-11-20 09:13:47,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 09:13:47,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 09:13:47,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 09:13:48,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 09:13:48,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 09:13:48,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 09:13:49,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 09:13:49,945 INFO L349 Elim1Store]: treesize reduction 40, result has 46.7 percent of original size [2024-11-20 09:13:49,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 47