./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-s_file-80.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-80.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 511db833c8808b53f89aa03d82cf934769dba4f9f9153f0cd5ce6daaa43720ad --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:53:05,894 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:53:05,949 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:53:05,953 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:53:05,954 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:53:05,976 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:53:05,976 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:53:05,977 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:53:05,977 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:53:05,978 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:53:05,979 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:53:05,979 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:53:05,980 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:53:05,981 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:53:05,981 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:53:05,981 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:53:05,981 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:53:05,982 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:53:05,982 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:53:05,982 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:53:05,982 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:53:05,984 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:53:05,984 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:53:05,984 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:53:05,984 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:53:05,985 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:53:05,985 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:53:05,985 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:53:05,985 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:53:05,985 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:53:05,985 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:53:05,986 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:53:05,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:53:05,986 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:53:05,986 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:53:05,986 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:53:05,986 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:53:05,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:53:05,986 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:53:05,987 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:53:05,987 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:53:05,988 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:53:05,988 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-clean/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-clean/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 -> 511db833c8808b53f89aa03d82cf934769dba4f9f9153f0cd5ce6daaa43720ad [2024-10-11 13:53:06,165 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:53:06,181 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:53:06,183 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:53:06,184 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:53:06,184 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:53:06,185 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-80.i [2024-10-11 13:53:07,400 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:53:07,545 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:53:07,545 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-80.i [2024-10-11 13:53:07,556 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ad6775a01/d8e0731354c948a9b9a5b880c708e538/FLAG7cba50c49 [2024-10-11 13:53:07,567 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ad6775a01/d8e0731354c948a9b9a5b880c708e538 [2024-10-11 13:53:07,569 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:53:07,570 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:53:07,571 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:53:07,571 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:53:07,576 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:53:07,577 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:53:07" (1/1) ... [2024-10-11 13:53:07,579 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a3bcb4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:53:07, skipping insertion in model container [2024-10-11 13:53:07,579 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:53:07" (1/1) ... [2024-10-11 13:53:07,612 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:53:07,751 WARN L248 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-s_file-80.i[916,929] [2024-10-11 13:53:07,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:53:07,830 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:53:07,840 WARN L248 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-s_file-80.i[916,929] [2024-10-11 13:53:07,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:53:07,901 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:53:07,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:53:07 WrapperNode [2024-10-11 13:53:07,902 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:53:07,903 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:53:07,904 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:53:07,904 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:53:07,909 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:53:07" (1/1) ... [2024-10-11 13:53:07,932 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:53:07" (1/1) ... [2024-10-11 13:53:07,982 INFO L138 Inliner]: procedures = 29, calls = 228, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 762 [2024-10-11 13:53:07,982 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:53:07,983 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:53:07,983 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:53:07,983 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:53:07,991 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:53:07" (1/1) ... [2024-10-11 13:53:07,991 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:53:07" (1/1) ... [2024-10-11 13:53:08,000 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:53:07" (1/1) ... [2024-10-11 13:53:08,024 INFO L175 MemorySlicer]: Split 199 memory accesses to 2 slices as follows [2, 197]. 99 percent of accesses are in the largest equivalence class. The 19 initializations are split as follows [2, 17]. The 19 writes are split as follows [0, 19]. [2024-10-11 13:53:08,024 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:53:07" (1/1) ... [2024-10-11 13:53:08,025 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:53:07" (1/1) ... [2024-10-11 13:53:08,045 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:53:07" (1/1) ... [2024-10-11 13:53:08,053 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:53:07" (1/1) ... [2024-10-11 13:53:08,057 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:53:07" (1/1) ... [2024-10-11 13:53:08,059 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:53:07" (1/1) ... [2024-10-11 13:53:08,068 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:53:08,069 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:53:08,069 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:53:08,070 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:53:08,070 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:53:07" (1/1) ... [2024-10-11 13:53:08,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:53:08,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:53:08,099 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:53:08,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:53:08,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:53:08,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 13:53:08,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 13:53:08,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 13:53:08,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 13:53:08,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 13:53:08,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 13:53:08,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 13:53:08,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 13:53:08,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 13:53:08,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 13:53:08,177 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:53:08,178 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:53:08,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:53:08,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 13:53:08,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:53:08,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:53:08,268 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:53:08,269 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:53:08,710 INFO L? ?]: Removed 236 outVars from TransFormulas that were not future-live. [2024-10-11 13:53:08,710 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:53:08,743 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:53:08,743 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:53:08,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:53:08 BoogieIcfgContainer [2024-10-11 13:53:08,743 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:53:08,746 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:53:08,746 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:53:08,749 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:53:08,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:53:07" (1/3) ... [2024-10-11 13:53:08,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@186e9e35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:53:08, skipping insertion in model container [2024-10-11 13:53:08,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:53:07" (2/3) ... [2024-10-11 13:53:08,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@186e9e35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:53:08, skipping insertion in model container [2024-10-11 13:53:08,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:53:08" (3/3) ... [2024-10-11 13:53:08,752 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-80.i [2024-10-11 13:53:08,764 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:53:08,764 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:53:08,810 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:53:08,815 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;@4724a727, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:53:08,816 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:53:08,819 INFO L276 IsEmpty]: Start isEmpty. Operand has 147 states, 127 states have (on average 1.4803149606299213) internal successors, (188), 128 states have internal predecessors, (188), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:53:08,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-11 13:53:08,828 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:53:08,829 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:53:08,829 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:53:08,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:53:08,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1172314152, now seen corresponding path program 1 times [2024-10-11 13:53:08,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:53:08,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398527745] [2024-10-11 13:53:08,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:53:08,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:53:08,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:53:09,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:53:09,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:53:09,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:53:09,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:53:09,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:53:09,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:53:09,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:53:09,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:53:09,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:53:09,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:53:09,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:53:09,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:53:09,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:53:09,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:53:09,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:53:09,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:53:09,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,179 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:53:09,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:53:09,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398527745] [2024-10-11 13:53:09,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398527745] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:53:09,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:53:09,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:53:09,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225569490] [2024-10-11 13:53:09,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:53:09,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:53:09,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:53:09,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:53:09,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:53:09,211 INFO L87 Difference]: Start difference. First operand has 147 states, 127 states have (on average 1.4803149606299213) internal successors, (188), 128 states have internal predecessors, (188), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:53:09,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:53:09,259 INFO L93 Difference]: Finished difference Result 291 states and 459 transitions. [2024-10-11 13:53:09,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:53:09,261 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 148 [2024-10-11 13:53:09,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:53:09,269 INFO L225 Difference]: With dead ends: 291 [2024-10-11 13:53:09,269 INFO L226 Difference]: Without dead ends: 145 [2024-10-11 13:53:09,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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-10-11 13:53:09,277 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:53:09,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 213 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:53:09,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-10-11 13:53:09,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-10-11 13:53:09,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 126 states have (on average 1.4523809523809523) internal successors, (183), 126 states have internal predecessors, (183), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:53:09,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 217 transitions. [2024-10-11 13:53:09,314 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 217 transitions. Word has length 148 [2024-10-11 13:53:09,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:53:09,315 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 217 transitions. [2024-10-11 13:53:09,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:53:09,316 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 217 transitions. [2024-10-11 13:53:09,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-11 13:53:09,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:53:09,318 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:53:09,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:53:09,318 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:53:09,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:53:09,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1918906386, now seen corresponding path program 1 times [2024-10-11 13:53:09,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:53:09,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387200829] [2024-10-11 13:53:09,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:53:09,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:53:09,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:53:09,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:53:09,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:53:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:53:09,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:53:09,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:53:09,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:53:09,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:53:09,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:53:09,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:53:09,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:53:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:53:09,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:53:09,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:53:09,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:53:09,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:53:09,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:53:09,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,615 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:53:09,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:53:09,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387200829] [2024-10-11 13:53:09,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387200829] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:53:09,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:53:09,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:53:09,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106411910] [2024-10-11 13:53:09,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:53:09,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:53:09,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:53:09,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:53:09,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:53:09,617 INFO L87 Difference]: Start difference. First operand 145 states and 217 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:53:09,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:53:09,664 INFO L93 Difference]: Finished difference Result 291 states and 436 transitions. [2024-10-11 13:53:09,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:53:09,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 148 [2024-10-11 13:53:09,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:53:09,667 INFO L225 Difference]: With dead ends: 291 [2024-10-11 13:53:09,667 INFO L226 Difference]: Without dead ends: 147 [2024-10-11 13:53:09,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 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-10-11 13:53:09,668 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 0 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:53:09,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 628 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:53:09,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-10-11 13:53:09,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-10-11 13:53:09,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 128 states have (on average 1.4453125) internal successors, (185), 128 states have internal predecessors, (185), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:53:09,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 219 transitions. [2024-10-11 13:53:09,678 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 219 transitions. Word has length 148 [2024-10-11 13:53:09,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:53:09,679 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 219 transitions. [2024-10-11 13:53:09,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:53:09,679 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 219 transitions. [2024-10-11 13:53:09,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-11 13:53:09,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:53:09,681 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:53:09,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:53:09,682 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:53:09,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:53:09,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1532055408, now seen corresponding path program 1 times [2024-10-11 13:53:09,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:53:09,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225029502] [2024-10-11 13:53:09,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:53:09,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:53:09,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:53:09,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:53:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:53:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:53:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:53:09,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:53:09,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:53:09,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:53:09,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:53:09,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:53:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:53:09,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:53:09,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:53:09,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:53:09,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:53:09,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:53:09,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:53:09,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:09,915 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:53:09,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:53:09,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225029502] [2024-10-11 13:53:09,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225029502] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:53:09,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:53:09,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:53:09,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770433541] [2024-10-11 13:53:09,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:53:09,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:53:09,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:53:09,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:53:09,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:53:09,917 INFO L87 Difference]: Start difference. First operand 147 states and 219 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:53:09,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:53:09,969 INFO L93 Difference]: Finished difference Result 295 states and 440 transitions. [2024-10-11 13:53:09,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:53:09,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2024-10-11 13:53:09,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:53:09,977 INFO L225 Difference]: With dead ends: 295 [2024-10-11 13:53:09,977 INFO L226 Difference]: Without dead ends: 149 [2024-10-11 13:53:09,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 37 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-10-11 13:53:09,984 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 0 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:53:09,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 626 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:53:09,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-10-11 13:53:09,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2024-10-11 13:53:09,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 130 states have (on average 1.4384615384615385) internal successors, (187), 130 states have internal predecessors, (187), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:53:10,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 221 transitions. [2024-10-11 13:53:10,001 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 221 transitions. Word has length 148 [2024-10-11 13:53:10,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:53:10,002 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 221 transitions. [2024-10-11 13:53:10,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:53:10,002 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 221 transitions. [2024-10-11 13:53:10,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 13:53:10,004 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:53:10,004 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:53:10,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 13:53:10,005 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:53:10,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:53:10,005 INFO L85 PathProgramCache]: Analyzing trace with hash 269753589, now seen corresponding path program 1 times [2024-10-11 13:53:10,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:53:10,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981840622] [2024-10-11 13:53:10,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:53:10,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:53:10,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:53:10,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:53:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:53:10,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:53:10,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:53:10,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:53:10,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:53:10,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:53:10,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:53:10,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:53:10,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:53:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:53:10,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:53:10,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:53:10,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:53:10,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:53:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:53:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,197 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:53:10,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:53:10,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981840622] [2024-10-11 13:53:10,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981840622] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:53:10,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:53:10,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:53:10,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432694290] [2024-10-11 13:53:10,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:53:10,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:53:10,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:53:10,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:53:10,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:53:10,200 INFO L87 Difference]: Start difference. First operand 149 states and 221 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:53:10,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:53:10,243 INFO L93 Difference]: Finished difference Result 300 states and 445 transitions. [2024-10-11 13:53:10,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:53:10,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2024-10-11 13:53:10,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:53:10,245 INFO L225 Difference]: With dead ends: 300 [2024-10-11 13:53:10,246 INFO L226 Difference]: Without dead ends: 152 [2024-10-11 13:53:10,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 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-10-11 13:53:10,247 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 1 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:53:10,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 623 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:53:10,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-10-11 13:53:10,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2024-10-11 13:53:10,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 132 states have (on average 1.4318181818181819) internal successors, (189), 132 states have internal predecessors, (189), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:53:10,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 223 transitions. [2024-10-11 13:53:10,261 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 223 transitions. Word has length 150 [2024-10-11 13:53:10,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:53:10,262 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 223 transitions. [2024-10-11 13:53:10,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:53:10,262 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 223 transitions. [2024-10-11 13:53:10,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 13:53:10,264 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:53:10,264 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:53:10,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 13:53:10,264 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:53:10,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:53:10,265 INFO L85 PathProgramCache]: Analyzing trace with hash -539593037, now seen corresponding path program 1 times [2024-10-11 13:53:10,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:53:10,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789513476] [2024-10-11 13:53:10,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:53:10,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:53:10,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:53:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:53:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:53:10,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:53:10,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:53:10,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:53:10,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:53:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:53:10,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:53:10,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:53:10,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:53:10,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:53:10,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:53:10,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:53:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:53:10,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:53:10,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:53:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,405 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:53:10,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:53:10,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789513476] [2024-10-11 13:53:10,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789513476] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:53:10,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:53:10,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:53:10,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569007788] [2024-10-11 13:53:10,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:53:10,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:53:10,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:53:10,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:53:10,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:53:10,407 INFO L87 Difference]: Start difference. First operand 151 states and 223 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:53:10,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:53:10,451 INFO L93 Difference]: Finished difference Result 304 states and 449 transitions. [2024-10-11 13:53:10,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:53:10,454 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2024-10-11 13:53:10,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:53:10,455 INFO L225 Difference]: With dead ends: 304 [2024-10-11 13:53:10,455 INFO L226 Difference]: Without dead ends: 154 [2024-10-11 13:53:10,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 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-10-11 13:53:10,456 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 1 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:53:10,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 624 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:53:10,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-10-11 13:53:10,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2024-10-11 13:53:10,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 134 states have (on average 1.4253731343283582) internal successors, (191), 134 states have internal predecessors, (191), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:53:10,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 225 transitions. [2024-10-11 13:53:10,469 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 225 transitions. Word has length 150 [2024-10-11 13:53:10,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:53:10,469 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 225 transitions. [2024-10-11 13:53:10,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:53:10,470 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 225 transitions. [2024-10-11 13:53:10,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 13:53:10,470 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:53:10,470 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:53:10,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 13:53:10,471 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:53:10,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:53:10,471 INFO L85 PathProgramCache]: Analyzing trace with hash -482334735, now seen corresponding path program 1 times [2024-10-11 13:53:10,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:53:10,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933952983] [2024-10-11 13:53:10,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:53:10,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:53:10,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:53:10,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:53:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:53:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:53:10,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:53:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:53:10,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:53:10,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:53:10,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:53:10,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:53:10,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:53:10,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:53:10,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:53:10,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:53:10,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:53:10,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:53:10,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:53:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:10,603 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:53:10,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:53:10,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933952983] [2024-10-11 13:53:10,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933952983] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:53:10,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:53:10,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:53:10,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326728278] [2024-10-11 13:53:10,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:53:10,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:53:10,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:53:10,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:53:10,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:53:10,606 INFO L87 Difference]: Start difference. First operand 153 states and 225 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:53:10,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:53:10,636 INFO L93 Difference]: Finished difference Result 308 states and 453 transitions. [2024-10-11 13:53:10,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:53:10,637 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2024-10-11 13:53:10,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:53:10,638 INFO L225 Difference]: With dead ends: 308 [2024-10-11 13:53:10,639 INFO L226 Difference]: Without dead ends: 156 [2024-10-11 13:53:10,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 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-10-11 13:53:10,640 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 1 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:53:10,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 627 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:53:10,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-10-11 13:53:10,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2024-10-11 13:53:10,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 136 states have (on average 1.4191176470588236) internal successors, (193), 136 states have internal predecessors, (193), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:53:10,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 227 transitions. [2024-10-11 13:53:10,653 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 227 transitions. Word has length 150 [2024-10-11 13:53:10,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:53:10,653 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 227 transitions. [2024-10-11 13:53:10,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:53:10,654 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 227 transitions. [2024-10-11 13:53:10,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 13:53:10,655 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:53:10,655 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:53:10,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 13:53:10,655 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:53:10,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:53:10,655 INFO L85 PathProgramCache]: Analyzing trace with hash -482275153, now seen corresponding path program 1 times [2024-10-11 13:53:10,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:53:10,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211479464] [2024-10-11 13:53:10,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:53:10,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:53:10,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:11,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:53:11,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:11,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:53:11,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:11,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:53:11,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:11,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:53:11,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:11,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:53:11,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:11,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:53:11,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:11,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:53:11,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:11,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:53:11,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:11,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:53:11,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:11,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:53:11,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:11,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:53:11,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:11,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:53:11,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:11,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:53:11,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:11,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:53:11,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:11,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:53:11,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:11,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:53:11,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:11,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:53:11,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:11,195 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:53:11,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:53:11,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211479464] [2024-10-11 13:53:11,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211479464] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:53:11,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:53:11,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:53:11,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733475049] [2024-10-11 13:53:11,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:53:11,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:53:11,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:53:11,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:53:11,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:53:11,197 INFO L87 Difference]: Start difference. First operand 155 states and 227 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:53:11,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:53:11,376 INFO L93 Difference]: Finished difference Result 313 states and 460 transitions. [2024-10-11 13:53:11,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:53:11,377 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2024-10-11 13:53:11,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:53:11,378 INFO L225 Difference]: With dead ends: 313 [2024-10-11 13:53:11,378 INFO L226 Difference]: Without dead ends: 159 [2024-10-11 13:53:11,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:53:11,379 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 2 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:53:11,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 723 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:53:11,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-10-11 13:53:11,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2024-10-11 13:53:11,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 139 states have (on average 1.4172661870503598) internal successors, (197), 139 states have internal predecessors, (197), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:53:11,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 231 transitions. [2024-10-11 13:53:11,385 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 231 transitions. Word has length 150 [2024-10-11 13:53:11,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:53:11,386 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 231 transitions. [2024-10-11 13:53:11,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:53:11,386 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 231 transitions. [2024-10-11 13:53:11,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 13:53:11,389 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:53:11,389 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:53:11,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 13:53:11,389 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:53:11,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:53:11,390 INFO L85 PathProgramCache]: Analyzing trace with hash -263420435, now seen corresponding path program 1 times [2024-10-11 13:53:11,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:53:11,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900565085] [2024-10-11 13:53:11,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:53:11,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:53:11,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:12,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:53:12,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:12,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:53:12,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:12,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:53:12,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:12,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:53:12,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:12,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:53:12,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:12,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:53:12,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:12,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:53:12,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:12,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:53:12,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:12,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:53:12,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:12,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:53:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:12,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:53:12,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:12,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:53:12,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:12,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:53:12,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:12,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:53:12,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:12,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:53:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:12,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:53:12,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:12,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:53:12,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:12,590 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:53:12,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:53:12,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900565085] [2024-10-11 13:53:12,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900565085] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:53:12,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:53:12,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:53:12,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429772534] [2024-10-11 13:53:12,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:53:12,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:53:12,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:53:12,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:53:12,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:53:12,593 INFO L87 Difference]: Start difference. First operand 158 states and 231 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:53:13,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:53:13,045 INFO L93 Difference]: Finished difference Result 373 states and 543 transitions. [2024-10-11 13:53:13,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:53:13,046 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2024-10-11 13:53:13,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:53:13,047 INFO L225 Difference]: With dead ends: 373 [2024-10-11 13:53:13,047 INFO L226 Difference]: Without dead ends: 216 [2024-10-11 13:53:13,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:53:13,048 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 68 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:53:13,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 640 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:53:13,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-10-11 13:53:13,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 165. [2024-10-11 13:53:13,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 146 states have (on average 1.417808219178082) internal successors, (207), 146 states have internal predecessors, (207), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:53:13,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 241 transitions. [2024-10-11 13:53:13,052 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 241 transitions. Word has length 150 [2024-10-11 13:53:13,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:53:13,053 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 241 transitions. [2024-10-11 13:53:13,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:53:13,053 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 241 transitions. [2024-10-11 13:53:13,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 13:53:13,054 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:53:13,054 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:53:13,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 13:53:13,054 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:53:13,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:53:13,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1851768337, now seen corresponding path program 1 times [2024-10-11 13:53:13,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:53:13,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535141051] [2024-10-11 13:53:13,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:53:13,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:53:13,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:15,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:53:15,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:15,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:53:15,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:15,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:53:15,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:15,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:53:15,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:15,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:53:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:15,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:53:15,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:15,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:53:15,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:15,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:53:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:15,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:53:15,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:15,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:53:15,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:15,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:53:15,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:15,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:53:15,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:15,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:53:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:15,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:53:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:15,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:53:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:15,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:53:15,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:15,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:53:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:15,453 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:53:15,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:53:15,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535141051] [2024-10-11 13:53:15,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535141051] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:53:15,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:53:15,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 13:53:15,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802781522] [2024-10-11 13:53:15,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:53:15,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 13:53:15,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:53:15,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 13:53:15,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:53:15,456 INFO L87 Difference]: Start difference. First operand 165 states and 241 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:53:16,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:53:16,976 INFO L93 Difference]: Finished difference Result 576 states and 832 transitions. [2024-10-11 13:53:16,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 13:53:16,977 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2024-10-11 13:53:16,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:53:16,979 INFO L225 Difference]: With dead ends: 576 [2024-10-11 13:53:16,979 INFO L226 Difference]: Without dead ends: 412 [2024-10-11 13:53:16,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2024-10-11 13:53:16,981 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 665 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 1542 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 1593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:53:16,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 767 Invalid, 1593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1542 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 13:53:16,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-10-11 13:53:16,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 355. [2024-10-11 13:53:16,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 307 states have (on average 1.3973941368078175) internal successors, (429), 309 states have internal predecessors, (429), 43 states have call successors, (43), 4 states have call predecessors, (43), 4 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-11 13:53:16,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 515 transitions. [2024-10-11 13:53:16,996 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 515 transitions. Word has length 150 [2024-10-11 13:53:16,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:53:16,996 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 515 transitions. [2024-10-11 13:53:16,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:53:16,997 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 515 transitions. [2024-10-11 13:53:16,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 13:53:16,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:53:16,999 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:53:16,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 13:53:16,999 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:53:16,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:53:16,999 INFO L85 PathProgramCache]: Analyzing trace with hash 754255217, now seen corresponding path program 1 times [2024-10-11 13:53:17,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:53:17,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20450570] [2024-10-11 13:53:17,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:53:17,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:53:17,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:17,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:53:17,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:17,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:53:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:17,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:53:17,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:17,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:53:17,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:17,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:53:17,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:17,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:53:17,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:17,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:53:17,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:17,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:53:17,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:17,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:53:17,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:17,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:53:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:17,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:53:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:17,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:53:17,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:17,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:53:17,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:17,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:53:17,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:17,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:53:17,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:17,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:53:17,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:17,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:53:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:17,311 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:53:17,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:53:17,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20450570] [2024-10-11 13:53:17,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20450570] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:53:17,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:53:17,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:53:17,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505139454] [2024-10-11 13:53:17,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:53:17,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:53:17,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:53:17,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:53:17,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:53:17,313 INFO L87 Difference]: Start difference. First operand 355 states and 515 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:53:17,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:53:17,849 INFO L93 Difference]: Finished difference Result 966 states and 1397 transitions. [2024-10-11 13:53:17,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:53:17,850 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2024-10-11 13:53:17,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:53:17,854 INFO L225 Difference]: With dead ends: 966 [2024-10-11 13:53:17,855 INFO L226 Difference]: Without dead ends: 630 [2024-10-11 13:53:17,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:53:17,856 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 165 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:53:17,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 821 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 13:53:17,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2024-10-11 13:53:17,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 363. [2024-10-11 13:53:17,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 315 states have (on average 1.3936507936507936) internal successors, (439), 317 states have internal predecessors, (439), 43 states have call successors, (43), 4 states have call predecessors, (43), 4 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-11 13:53:17,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 525 transitions. [2024-10-11 13:53:17,879 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 525 transitions. Word has length 150 [2024-10-11 13:53:17,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:53:17,879 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 525 transitions. [2024-10-11 13:53:17,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:53:17,880 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 525 transitions. [2024-10-11 13:53:17,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 13:53:17,881 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:53:17,881 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:53:17,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 13:53:17,881 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:53:17,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:53:17,881 INFO L85 PathProgramCache]: Analyzing trace with hash -616288659, now seen corresponding path program 1 times [2024-10-11 13:53:17,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:53:17,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783914836] [2024-10-11 13:53:17,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:53:17,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:53:17,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:18,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:53:18,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:18,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:53:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:18,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:53:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:18,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:53:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:18,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:53:18,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:18,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:53:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:18,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:53:18,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:18,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:53:18,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:18,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:53:18,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:19,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:53:19,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:19,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:53:19,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:19,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:53:19,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:19,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:53:19,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:19,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:53:19,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:19,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:53:19,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:19,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:53:19,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:19,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:53:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:19,022 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:53:19,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:53:19,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783914836] [2024-10-11 13:53:19,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783914836] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:53:19,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:53:19,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 13:53:19,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263952484] [2024-10-11 13:53:19,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:53:19,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 13:53:19,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:53:19,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 13:53:19,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:53:19,024 INFO L87 Difference]: Start difference. First operand 363 states and 525 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:53:20,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:53:20,112 INFO L93 Difference]: Finished difference Result 965 states and 1393 transitions. [2024-10-11 13:53:20,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 13:53:20,113 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 150 [2024-10-11 13:53:20,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:53:20,115 INFO L225 Difference]: With dead ends: 965 [2024-10-11 13:53:20,115 INFO L226 Difference]: Without dead ends: 621 [2024-10-11 13:53:20,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2024-10-11 13:53:20,117 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 541 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 1212 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 1338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 1212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 13:53:20,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 725 Invalid, 1338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 1212 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 13:53:20,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2024-10-11 13:53:20,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 365. [2024-10-11 13:53:20,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 317 states have (on average 1.391167192429022) internal successors, (441), 319 states have internal predecessors, (441), 43 states have call successors, (43), 4 states have call predecessors, (43), 4 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-11 13:53:20,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 527 transitions. [2024-10-11 13:53:20,135 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 527 transitions. Word has length 150 [2024-10-11 13:53:20,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:53:20,135 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 527 transitions. [2024-10-11 13:53:20,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:53:20,136 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 527 transitions. [2024-10-11 13:53:20,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 13:53:20,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:53:20,137 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:53:20,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 13:53:20,137 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:53:20,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:53:20,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1989734895, now seen corresponding path program 1 times [2024-10-11 13:53:20,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:53:20,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530856144] [2024-10-11 13:53:20,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:53:20,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:53:20,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:20,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:53:20,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:20,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:53:20,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:20,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:53:20,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:20,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:53:20,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:20,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:53:20,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:20,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:53:20,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:20,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:53:20,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:20,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:53:20,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:20,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:53:20,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:20,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:53:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:20,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:53:20,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:20,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:53:20,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:20,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:53:20,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:20,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:53:20,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:20,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:53:20,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:20,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:53:20,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:20,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:53:20,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:53:20,474 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:53:20,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:53:20,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530856144] [2024-10-11 13:53:20,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530856144] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:53:20,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:53:20,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:53:20,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841293116] [2024-10-11 13:53:20,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:53:20,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:53:20,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:53:20,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:53:20,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:53:20,476 INFO L87 Difference]: Start difference. First operand 365 states and 527 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:53:21,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:53:21,110 INFO L93 Difference]: Finished difference Result 842 states and 1214 transitions. [2024-10-11 13:53:21,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 13:53:21,110 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2024-10-11 13:53:21,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:53:21,113 INFO L225 Difference]: With dead ends: 842 [2024-10-11 13:53:21,113 INFO L226 Difference]: Without dead ends: 496 [2024-10-11 13:53:21,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:53:21,114 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 165 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:53:21,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 1262 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1018 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 13:53:21,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2024-10-11 13:53:21,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 367. [2024-10-11 13:53:21,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 319 states have (on average 1.3918495297805642) internal successors, (444), 321 states have internal predecessors, (444), 43 states have call successors, (43), 4 states have call predecessors, (43), 4 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-11 13:53:21,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 530 transitions. [2024-10-11 13:53:21,136 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 530 transitions. Word has length 150 [2024-10-11 13:53:21,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:53:21,137 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 530 transitions. [2024-10-11 13:53:21,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:53:21,137 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 530 transitions. [2024-10-11 13:53:21,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 13:53:21,138 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:53:21,138 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:53:21,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 13:53:21,138 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:53:21,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:53:21,139 INFO L85 PathProgramCache]: Analyzing trace with hash 401386993, now seen corresponding path program 1 times [2024-10-11 13:53:21,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:53:21,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75769803] [2024-10-11 13:53:21,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:53:21,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:53:21,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat