./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-79.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-79.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1d35048482bec5585a23759f57e0e5f27fb64289f87c796a48314ffe6a1f4ee7 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 14:11:18,999 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 14:11:19,067 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 14:11:19,082 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 14:11:19,082 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 14:11:19,111 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 14:11:19,111 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 14:11:19,112 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 14:11:19,112 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 14:11:19,113 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 14:11:19,113 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 14:11:19,113 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 14:11:19,114 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 14:11:19,114 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 14:11:19,115 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 14:11:19,115 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 14:11:19,115 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 14:11:19,116 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 14:11:19,116 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 14:11:19,116 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 14:11:19,116 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 14:11:19,121 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 14:11:19,121 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 14:11:19,121 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 14:11:19,122 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 14:11:19,122 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 14:11:19,122 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 14:11:19,122 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 14:11:19,123 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 14:11:19,123 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 14:11:19,123 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 14:11:19,123 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 14:11:19,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 14:11:19,124 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 14:11:19,127 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 14:11:19,128 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 14:11:19,128 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 14:11:19,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 14:11:19,129 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 14:11:19,129 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 14:11:19,130 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 14:11:19,130 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 14:11:19,131 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1d35048482bec5585a23759f57e0e5f27fb64289f87c796a48314ffe6a1f4ee7 [2024-10-14 14:11:19,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 14:11:19,446 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 14:11:19,451 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 14:11:19,452 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 14:11:19,453 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 14:11:19,454 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-79.i [2024-10-14 14:11:20,931 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 14:11:21,138 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 14:11:21,139 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-79.i [2024-10-14 14:11:21,147 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea2666b7c/d4eeabee5bfc4277b8168d59c7717b4b/FLAG2f08ff81a [2024-10-14 14:11:21,518 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea2666b7c/d4eeabee5bfc4277b8168d59c7717b4b [2024-10-14 14:11:21,521 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 14:11:21,522 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 14:11:21,524 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 14:11:21,524 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 14:11:21,529 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 14:11:21,530 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:11:21" (1/1) ... [2024-10-14 14:11:21,531 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@168c7b7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:21, skipping insertion in model container [2024-10-14 14:11:21,532 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:11:21" (1/1) ... [2024-10-14 14:11:21,562 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 14:11:21,711 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-sp_file-79.i[917,930] [2024-10-14 14:11:21,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 14:11:21,793 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 14:11:21,806 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-sp_file-79.i[917,930] [2024-10-14 14:11:21,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 14:11:21,896 INFO L204 MainTranslator]: Completed translation [2024-10-14 14:11:21,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:21 WrapperNode [2024-10-14 14:11:21,897 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 14:11:21,898 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 14:11:21,899 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 14:11:21,899 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 14:11:21,906 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:21" (1/1) ... [2024-10-14 14:11:21,923 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:21" (1/1) ... [2024-10-14 14:11:21,973 INFO L138 Inliner]: procedures = 29, calls = 126, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 414 [2024-10-14 14:11:21,974 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 14:11:21,974 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 14:11:21,976 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 14:11:21,976 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 14:11:21,987 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:21" (1/1) ... [2024-10-14 14:11:21,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:21" (1/1) ... [2024-10-14 14:11:21,995 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:21" (1/1) ... [2024-10-14 14:11:22,031 INFO L175 MemorySlicer]: Split 103 memory accesses to 2 slices as follows [2, 101]. 98 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 11]. The 15 writes are split as follows [0, 15]. [2024-10-14 14:11:22,032 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:21" (1/1) ... [2024-10-14 14:11:22,032 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:21" (1/1) ... [2024-10-14 14:11:22,047 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:21" (1/1) ... [2024-10-14 14:11:22,059 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:21" (1/1) ... [2024-10-14 14:11:22,061 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:21" (1/1) ... [2024-10-14 14:11:22,063 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:21" (1/1) ... [2024-10-14 14:11:22,072 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 14:11:22,073 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 14:11:22,073 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 14:11:22,073 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 14:11:22,074 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:21" (1/1) ... [2024-10-14 14:11:22,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 14:11:22,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:11:22,126 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 14:11:22,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 14:11:22,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 14:11:22,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 14:11:22,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 14:11:22,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-14 14:11:22,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-14 14:11:22,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-14 14:11:22,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-14 14:11:22,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 14:11:22,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 14:11:22,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-14 14:11:22,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-14 14:11:22,184 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 14:11:22,185 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 14:11:22,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 14:11:22,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 14:11:22,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 14:11:22,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 14:11:22,297 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 14:11:22,299 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 14:11:22,807 INFO L? ?]: Removed 100 outVars from TransFormulas that were not future-live. [2024-10-14 14:11:22,808 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 14:11:22,847 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 14:11:22,848 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 14:11:22,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:11:22 BoogieIcfgContainer [2024-10-14 14:11:22,848 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 14:11:22,850 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 14:11:22,851 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 14:11:22,854 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 14:11:22,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:11:21" (1/3) ... [2024-10-14 14:11:22,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@406a2bed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:11:22, skipping insertion in model container [2024-10-14 14:11:22,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:21" (2/3) ... [2024-10-14 14:11:22,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@406a2bed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:11:22, skipping insertion in model container [2024-10-14 14:11:22,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:11:22" (3/3) ... [2024-10-14 14:11:22,857 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-79.i [2024-10-14 14:11:22,871 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 14:11:22,871 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 14:11:22,958 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 14:11:22,963 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;@38baa78a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 14:11:22,963 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 14:11:22,967 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 74 states have (on average 1.472972972972973) internal successors, (109), 75 states have internal predecessors, (109), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 14:11:22,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-14 14:11:22,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:11:22,977 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:11:22,978 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:11:22,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:11:22,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1610199517, now seen corresponding path program 1 times [2024-10-14 14:11:22,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:11:22,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983415984] [2024-10-14 14:11:22,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:11:22,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:11:23,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:23,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:11:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:23,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:11:23,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:23,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:11:23,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:23,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:11:23,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:23,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:11:23,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:23,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:11:23,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:23,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 14:11:23,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:23,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 14:11:23,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:23,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 14:11:23,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:23,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 14:11:23,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:23,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 14:11:23,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:23,386 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:11:23,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:11:23,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983415984] [2024-10-14 14:11:23,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983415984] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:11:23,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:11:23,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 14:11:23,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127173233] [2024-10-14 14:11:23,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:11:23,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 14:11:23,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:11:23,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 14:11:23,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 14:11:23,425 INFO L87 Difference]: Start difference. First operand has 88 states, 74 states have (on average 1.472972972972973) internal successors, (109), 75 states have internal predecessors, (109), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 14:11:23,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:11:23,475 INFO L93 Difference]: Finished difference Result 173 states and 271 transitions. [2024-10-14 14:11:23,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 14:11:23,478 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 96 [2024-10-14 14:11:23,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:11:23,486 INFO L225 Difference]: With dead ends: 173 [2024-10-14 14:11:23,486 INFO L226 Difference]: Without dead ends: 86 [2024-10-14 14:11:23,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 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-14 14:11:23,496 INFO L432 NwaCegarLoop]: 122 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, 122 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-14 14:11:23,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 14:11:23,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-14 14:11:23,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-14 14:11:23,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 73 states have (on average 1.4246575342465753) internal successors, (104), 73 states have internal predecessors, (104), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 14:11:23,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 126 transitions. [2024-10-14 14:11:23,550 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 126 transitions. Word has length 96 [2024-10-14 14:11:23,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:11:23,551 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 126 transitions. [2024-10-14 14:11:23,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 14:11:23,552 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 126 transitions. [2024-10-14 14:11:23,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-14 14:11:23,556 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:11:23,556 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:11:23,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 14:11:23,559 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:11:23,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:11:23,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1867670377, now seen corresponding path program 1 times [2024-10-14 14:11:23,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:11:23,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432284934] [2024-10-14 14:11:23,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:11:23,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:11:23,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:23,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:11:23,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:23,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:11:23,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:23,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:11:23,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:23,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:11:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:23,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:11:23,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:23,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:11:23,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:23,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 14:11:24,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:24,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 14:11:24,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:24,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 14:11:24,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:24,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 14:11:24,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:24,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 14:11:24,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:24,035 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:11:24,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:11:24,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432284934] [2024-10-14 14:11:24,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432284934] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:11:24,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:11:24,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 14:11:24,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943736366] [2024-10-14 14:11:24,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:11:24,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 14:11:24,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:11:24,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 14:11:24,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:11:24,046 INFO L87 Difference]: Start difference. First operand 86 states and 126 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:11:24,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:11:24,107 INFO L93 Difference]: Finished difference Result 173 states and 254 transitions. [2024-10-14 14:11:24,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 14:11:24,107 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 96 [2024-10-14 14:11:24,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:11:24,109 INFO L225 Difference]: With dead ends: 173 [2024-10-14 14:11:24,110 INFO L226 Difference]: Without dead ends: 88 [2024-10-14 14:11:24,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 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-14 14:11:24,113 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 353 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-14 14:11:24,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 353 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 14:11:24,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-14 14:11:24,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-14 14:11:24,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 75 states have (on average 1.4133333333333333) internal successors, (106), 75 states have internal predecessors, (106), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 14:11:24,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 128 transitions. [2024-10-14 14:11:24,131 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 128 transitions. Word has length 96 [2024-10-14 14:11:24,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:11:24,132 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 128 transitions. [2024-10-14 14:11:24,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:11:24,133 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 128 transitions. [2024-10-14 14:11:24,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-14 14:11:24,136 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:11:24,136 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:11:24,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 14:11:24,137 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:11:24,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:11:24,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1805103068, now seen corresponding path program 1 times [2024-10-14 14:11:24,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:11:24,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499956512] [2024-10-14 14:11:24,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:11:24,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:11:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:24,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:11:24,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:24,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:11:24,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:24,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:11:24,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:24,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:11:24,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:24,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:11:24,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:24,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:11:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:24,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 14:11:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:24,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 14:11:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:24,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 14:11:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:24,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 14:11:24,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:24,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 14:11:24,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:24,382 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:11:24,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:11:24,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499956512] [2024-10-14 14:11:24,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499956512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:11:24,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:11:24,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 14:11:24,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212994998] [2024-10-14 14:11:24,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:11:24,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 14:11:24,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:11:24,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 14:11:24,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:11:24,390 INFO L87 Difference]: Start difference. First operand 88 states and 128 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:11:24,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:11:24,454 INFO L93 Difference]: Finished difference Result 178 states and 259 transitions. [2024-10-14 14:11:24,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 14:11:24,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-14 14:11:24,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:11:24,457 INFO L225 Difference]: With dead ends: 178 [2024-10-14 14:11:24,457 INFO L226 Difference]: Without dead ends: 91 [2024-10-14 14:11:24,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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-14 14:11:24,459 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 1 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 14:11:24,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 353 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 14:11:24,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-14 14:11:24,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2024-10-14 14:11:24,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 77 states have internal predecessors, (108), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 14:11:24,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 130 transitions. [2024-10-14 14:11:24,477 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 130 transitions. Word has length 98 [2024-10-14 14:11:24,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:11:24,478 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 130 transitions. [2024-10-14 14:11:24,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:11:24,481 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 130 transitions. [2024-10-14 14:11:24,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-14 14:11:24,485 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:11:24,485 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:11:24,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 14:11:24,486 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:11:24,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:11:24,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1805162650, now seen corresponding path program 1 times [2024-10-14 14:11:24,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:11:24,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873726531] [2024-10-14 14:11:24,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:11:24,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:11:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:24,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:11:24,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:24,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:11:24,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:24,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:11:24,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:24,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:11:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:24,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:11:24,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:24,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:11:24,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:24,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 14:11:24,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:24,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 14:11:24,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:24,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 14:11:24,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:24,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 14:11:24,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:24,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 14:11:24,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:24,892 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:11:24,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:11:24,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873726531] [2024-10-14 14:11:24,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873726531] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:11:24,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:11:24,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 14:11:24,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639656894] [2024-10-14 14:11:24,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:11:24,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 14:11:24,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:11:24,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 14:11:24,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 14:11:24,898 INFO L87 Difference]: Start difference. First operand 90 states and 130 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:11:25,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:11:25,109 INFO L93 Difference]: Finished difference Result 207 states and 296 transitions. [2024-10-14 14:11:25,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 14:11:25,113 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-14 14:11:25,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:11:25,116 INFO L225 Difference]: With dead ends: 207 [2024-10-14 14:11:25,117 INFO L226 Difference]: Without dead ends: 118 [2024-10-14 14:11:25,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 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-14 14:11:25,119 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 33 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 14:11:25,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 420 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 14:11:25,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-14 14:11:25,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 92. [2024-10-14 14:11:25,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 79 states have (on average 1.3924050632911393) internal successors, (110), 79 states have internal predecessors, (110), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 14:11:25,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 132 transitions. [2024-10-14 14:11:25,139 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 132 transitions. Word has length 98 [2024-10-14 14:11:25,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:11:25,140 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 132 transitions. [2024-10-14 14:11:25,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:11:25,140 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 132 transitions. [2024-10-14 14:11:25,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 14:11:25,143 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:11:25,144 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:11:25,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 14:11:25,147 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:11:25,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:11:25,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1920444672, now seen corresponding path program 1 times [2024-10-14 14:11:25,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:11:25,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969607655] [2024-10-14 14:11:25,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:11:25,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:11:25,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:27,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:11:27,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:27,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:11:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:27,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:11:27,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:27,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:11:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:27,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:11:27,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:27,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:11:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:27,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 14:11:27,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:27,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 14:11:27,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:27,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 14:11:27,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:27,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 14:11:27,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:27,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 14:11:27,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:27,505 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:11:27,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:11:27,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969607655] [2024-10-14 14:11:27,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969607655] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:11:27,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:11:27,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-14 14:11:27,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728695577] [2024-10-14 14:11:27,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:11:27,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 14:11:27,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:11:27,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 14:11:27,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-10-14 14:11:27,508 INFO L87 Difference]: Start difference. First operand 92 states and 132 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 14:11:28,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:11:28,705 INFO L93 Difference]: Finished difference Result 358 states and 510 transitions. [2024-10-14 14:11:28,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 14:11:28,706 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 99 [2024-10-14 14:11:28,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:11:28,708 INFO L225 Difference]: With dead ends: 358 [2024-10-14 14:11:28,708 INFO L226 Difference]: Without dead ends: 267 [2024-10-14 14:11:28,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2024-10-14 14:11:28,710 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 393 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 14:11:28,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 765 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 14:11:28,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-10-14 14:11:28,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 148. [2024-10-14 14:11:28,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 123 states have (on average 1.3983739837398375) internal successors, (172), 123 states have internal predecessors, (172), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 14:11:28,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 216 transitions. [2024-10-14 14:11:28,730 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 216 transitions. Word has length 99 [2024-10-14 14:11:28,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:11:28,731 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 216 transitions. [2024-10-14 14:11:28,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 14:11:28,731 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 216 transitions. [2024-10-14 14:11:28,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 14:11:28,733 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:11:28,733 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:11:28,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 14:11:28,733 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:11:28,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:11:28,734 INFO L85 PathProgramCache]: Analyzing trace with hash 2144986058, now seen corresponding path program 1 times [2024-10-14 14:11:28,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:11:28,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683909467] [2024-10-14 14:11:28,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:11:28,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:11:28,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:29,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:11:29,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:29,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:11:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:29,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:11:29,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:29,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:11:29,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:29,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:11:29,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:29,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:11:29,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:29,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 14:11:29,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:29,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 14:11:29,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:29,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 14:11:29,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:29,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 14:11:29,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:29,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 14:11:29,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:29,726 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-14 14:11:29,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:11:29,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683909467] [2024-10-14 14:11:29,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683909467] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 14:11:29,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103145308] [2024-10-14 14:11:29,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:11:29,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:11:29,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:11:29,733 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 14:11:29,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 14:11:29,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:29,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-14 14:11:29,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:11:30,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 14:11:30,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-14 14:11:30,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-14 14:11:30,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-14 14:11:31,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-14 14:11:31,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 14:11:31,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2024-10-14 14:11:31,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 14:11:31,341 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:11:31,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 15 [2024-10-14 14:11:31,355 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 80 proven. 84 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-14 14:11:31,356 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 14:11:31,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103145308] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 14:11:31,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 14:11:31,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2024-10-14 14:11:31,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900912927] [2024-10-14 14:11:31,714 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 14:11:31,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-14 14:11:31,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:11:31,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-14 14:11:31,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2024-10-14 14:11:31,716 INFO L87 Difference]: Start difference. First operand 148 states and 216 transitions. Second operand has 20 states, 18 states have (on average 5.055555555555555) internal successors, (91), 20 states have internal predecessors, (91), 8 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (22), 6 states have call predecessors, (22), 8 states have call successors, (22) [2024-10-14 14:11:32,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:11:32,557 INFO L93 Difference]: Finished difference Result 259 states and 368 transitions. [2024-10-14 14:11:32,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 14:11:32,558 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 5.055555555555555) internal successors, (91), 20 states have internal predecessors, (91), 8 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (22), 6 states have call predecessors, (22), 8 states have call successors, (22) Word has length 100 [2024-10-14 14:11:32,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:11:32,561 INFO L225 Difference]: With dead ends: 259 [2024-10-14 14:11:32,563 INFO L226 Difference]: Without dead ends: 168 [2024-10-14 14:11:32,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=197, Invalid=859, Unknown=0, NotChecked=0, Total=1056 [2024-10-14 14:11:32,565 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 99 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 14:11:32,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 580 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 14:11:32,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-10-14 14:11:32,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 161. [2024-10-14 14:11:32,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 134 states have (on average 1.3805970149253732) internal successors, (185), 134 states have internal predecessors, (185), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 14:11:32,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 229 transitions. [2024-10-14 14:11:32,596 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 229 transitions. Word has length 100 [2024-10-14 14:11:32,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:11:32,596 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 229 transitions. [2024-10-14 14:11:32,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 5.055555555555555) internal successors, (91), 20 states have internal predecessors, (91), 8 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (22), 6 states have call predecessors, (22), 8 states have call successors, (22) [2024-10-14 14:11:32,596 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 229 transitions. [2024-10-14 14:11:32,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 14:11:32,598 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:11:32,598 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:11:32,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 14:11:32,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-14 14:11:32,799 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:11:32,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:11:32,800 INFO L85 PathProgramCache]: Analyzing trace with hash 556638156, now seen corresponding path program 1 times [2024-10-14 14:11:32,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:11:32,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120216682] [2024-10-14 14:11:32,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:11:32,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:11:32,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:34,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:11:34,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:34,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:11:34,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:34,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:11:34,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:34,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:11:34,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:34,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:11:34,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:34,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:11:34,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:34,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 14:11:34,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:34,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 14:11:34,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:34,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 14:11:34,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:34,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 14:11:34,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:34,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 14:11:34,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:34,878 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:11:34,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:11:34,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120216682] [2024-10-14 14:11:34,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120216682] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:11:34,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:11:34,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-14 14:11:34,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716448823] [2024-10-14 14:11:34,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:11:34,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 14:11:34,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:11:34,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 14:11:34,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-10-14 14:11:34,881 INFO L87 Difference]: Start difference. First operand 161 states and 229 transitions. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 14:11:36,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:11:36,053 INFO L93 Difference]: Finished difference Result 349 states and 491 transitions. [2024-10-14 14:11:36,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 14:11:36,053 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 100 [2024-10-14 14:11:36,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:11:36,056 INFO L225 Difference]: With dead ends: 349 [2024-10-14 14:11:36,056 INFO L226 Difference]: Without dead ends: 251 [2024-10-14 14:11:36,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2024-10-14 14:11:36,057 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 422 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 14:11:36,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 800 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 14:11:36,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-14 14:11:36,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 163. [2024-10-14 14:11:36,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 136 states have (on average 1.3823529411764706) internal successors, (188), 136 states have internal predecessors, (188), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 14:11:36,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 232 transitions. [2024-10-14 14:11:36,079 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 232 transitions. Word has length 100 [2024-10-14 14:11:36,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:11:36,081 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 232 transitions. [2024-10-14 14:11:36,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 14:11:36,081 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 232 transitions. [2024-10-14 14:11:36,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 14:11:36,082 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:11:36,082 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:11:36,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 14:11:36,084 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:11:36,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:11:36,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1740418686, now seen corresponding path program 1 times [2024-10-14 14:11:36,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:11:36,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074489955] [2024-10-14 14:11:36,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:11:36,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:11:36,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:36,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:11:36,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:36,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:11:36,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:36,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:11:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:36,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:11:36,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:36,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:11:36,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:36,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:11:36,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:36,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 14:11:36,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:36,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 14:11:36,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:36,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 14:11:36,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:36,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 14:11:36,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:36,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 14:11:36,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:36,748 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:11:36,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:11:36,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074489955] [2024-10-14 14:11:36,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074489955] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:11:36,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:11:36,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 14:11:36,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947627307] [2024-10-14 14:11:36,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:11:36,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 14:11:36,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:11:36,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 14:11:36,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 14:11:36,751 INFO L87 Difference]: Start difference. First operand 163 states and 232 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:11:37,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:11:37,021 INFO L93 Difference]: Finished difference Result 298 states and 420 transitions. [2024-10-14 14:11:37,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 14:11:37,022 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 100 [2024-10-14 14:11:37,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:11:37,024 INFO L225 Difference]: With dead ends: 298 [2024-10-14 14:11:37,024 INFO L226 Difference]: Without dead ends: 200 [2024-10-14 14:11:37,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-10-14 14:11:37,025 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 139 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 14:11:37,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 572 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 14:11:37,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-10-14 14:11:37,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 148. [2024-10-14 14:11:37,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 121 states have (on average 1.3553719008264462) internal successors, (164), 122 states have internal predecessors, (164), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 14:11:37,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 208 transitions. [2024-10-14 14:11:37,049 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 208 transitions. Word has length 100 [2024-10-14 14:11:37,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:11:37,050 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 208 transitions. [2024-10-14 14:11:37,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:11:37,051 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 208 transitions. [2024-10-14 14:11:37,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-14 14:11:37,053 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:11:37,053 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:11:37,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 14:11:37,053 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:11:37,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:11:37,054 INFO L85 PathProgramCache]: Analyzing trace with hash -387177530, now seen corresponding path program 1 times [2024-10-14 14:11:37,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:11:37,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087133958] [2024-10-14 14:11:37,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:11:37,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:11:37,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:37,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:11:37,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:37,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:11:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:37,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:11:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:37,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:11:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:37,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:11:37,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:37,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:11:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:37,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 14:11:37,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:37,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 14:11:37,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:37,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 14:11:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:37,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 14:11:37,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:37,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 14:11:37,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:37,738 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:11:37,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:11:37,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087133958] [2024-10-14 14:11:37,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087133958] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:11:37,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:11:37,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 14:11:37,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35963083] [2024-10-14 14:11:37,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:11:37,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 14:11:37,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:11:37,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 14:11:37,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-14 14:11:37,741 INFO L87 Difference]: Start difference. First operand 148 states and 208 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 14:11:38,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:11:38,144 INFO L93 Difference]: Finished difference Result 294 states and 413 transitions. [2024-10-14 14:11:38,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 14:11:38,148 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 101 [2024-10-14 14:11:38,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:11:38,151 INFO L225 Difference]: With dead ends: 294 [2024-10-14 14:11:38,151 INFO L226 Difference]: Without dead ends: 192 [2024-10-14 14:11:38,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-14 14:11:38,152 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 194 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 14:11:38,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 261 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 14:11:38,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-10-14 14:11:38,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 166. [2024-10-14 14:11:38,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 139 states have (on average 1.3597122302158273) internal successors, (189), 140 states have internal predecessors, (189), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 14:11:38,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 233 transitions. [2024-10-14 14:11:38,175 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 233 transitions. Word has length 101 [2024-10-14 14:11:38,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:11:38,176 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 233 transitions. [2024-10-14 14:11:38,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 14:11:38,176 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 233 transitions. [2024-10-14 14:11:38,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-14 14:11:38,177 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:11:38,177 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:11:38,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 14:11:38,178 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:11:38,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:11:38,178 INFO L85 PathProgramCache]: Analyzing trace with hash -129012092, now seen corresponding path program 1 times [2024-10-14 14:11:38,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:11:38,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560258503] [2024-10-14 14:11:38,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:11:38,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:11:38,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:38,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:11:38,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:38,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:11:38,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:38,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:11:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:38,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:11:38,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:38,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:11:38,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:38,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:11:38,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:38,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 14:11:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:38,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 14:11:38,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:38,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 14:11:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:38,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 14:11:38,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:38,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 14:11:38,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:38,643 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:11:38,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:11:38,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560258503] [2024-10-14 14:11:38,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560258503] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:11:38,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:11:38,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 14:11:38,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685259995] [2024-10-14 14:11:38,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:11:38,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 14:11:38,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:11:38,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 14:11:38,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 14:11:38,646 INFO L87 Difference]: Start difference. First operand 166 states and 233 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:11:38,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:11:38,909 INFO L93 Difference]: Finished difference Result 329 states and 458 transitions. [2024-10-14 14:11:38,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 14:11:38,910 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2024-10-14 14:11:38,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:11:38,912 INFO L225 Difference]: With dead ends: 329 [2024-10-14 14:11:38,912 INFO L226 Difference]: Without dead ends: 209 [2024-10-14 14:11:38,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-14 14:11:38,913 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 200 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 14:11:38,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 444 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 14:11:38,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-10-14 14:11:38,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 187. [2024-10-14 14:11:38,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 160 states have (on average 1.34375) internal successors, (215), 161 states have internal predecessors, (215), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 14:11:38,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 259 transitions. [2024-10-14 14:11:38,931 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 259 transitions. Word has length 101 [2024-10-14 14:11:38,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:11:38,932 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 259 transitions. [2024-10-14 14:11:38,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:11:38,932 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 259 transitions. [2024-10-14 14:11:38,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-14 14:11:38,933 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:11:38,933 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:11:38,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 14:11:38,933 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:11:38,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:11:38,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1705527558, now seen corresponding path program 1 times [2024-10-14 14:11:38,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:11:38,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841911057] [2024-10-14 14:11:38,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:11:38,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:11:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:39,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:11:39,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:39,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:11:39,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:39,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:11:39,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:39,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:11:39,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:39,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:11:39,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:39,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:11:39,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:39,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 14:11:39,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:39,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 14:11:39,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:39,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 14:11:39,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:39,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 14:11:39,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:39,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 14:11:39,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:39,064 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:11:39,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:11:39,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841911057] [2024-10-14 14:11:39,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841911057] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:11:39,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:11:39,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 14:11:39,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178743409] [2024-10-14 14:11:39,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:11:39,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 14:11:39,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:11:39,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 14:11:39,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:11:39,067 INFO L87 Difference]: Start difference. First operand 187 states and 259 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:11:39,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:11:39,145 INFO L93 Difference]: Finished difference Result 326 states and 451 transitions. [2024-10-14 14:11:39,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 14:11:39,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2024-10-14 14:11:39,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:11:39,148 INFO L225 Difference]: With dead ends: 326 [2024-10-14 14:11:39,148 INFO L226 Difference]: Without dead ends: 185 [2024-10-14 14:11:39,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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-14 14:11:39,149 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 14:11:39,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 308 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 14:11:39,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-10-14 14:11:39,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2024-10-14 14:11:39,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 158 states have (on average 1.3291139240506329) internal successors, (210), 159 states have internal predecessors, (210), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 14:11:39,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 254 transitions. [2024-10-14 14:11:39,174 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 254 transitions. Word has length 101 [2024-10-14 14:11:39,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:11:39,174 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 254 transitions. [2024-10-14 14:11:39,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:11:39,174 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 254 transitions. [2024-10-14 14:11:39,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-14 14:11:39,176 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:11:39,176 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:11:39,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 14:11:39,177 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:11:39,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:11:39,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1221711812, now seen corresponding path program 1 times [2024-10-14 14:11:39,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:11:39,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788652397] [2024-10-14 14:11:39,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:11:39,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:11:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:39,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:11:39,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:39,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:11:39,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:39,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:11:39,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:39,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:11:39,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:39,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:11:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:39,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:11:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:39,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 14:11:39,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:39,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 14:11:39,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:39,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 14:11:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:39,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 14:11:39,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:39,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 14:11:39,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:39,317 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:11:39,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:11:39,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788652397] [2024-10-14 14:11:39,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788652397] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:11:39,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:11:39,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 14:11:39,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450523567] [2024-10-14 14:11:39,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:11:39,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 14:11:39,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:11:39,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 14:11:39,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:11:39,319 INFO L87 Difference]: Start difference. First operand 185 states and 254 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:11:39,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:11:39,389 INFO L93 Difference]: Finished difference Result 316 states and 433 transitions. [2024-10-14 14:11:39,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 14:11:39,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2024-10-14 14:11:39,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:11:39,391 INFO L225 Difference]: With dead ends: 316 [2024-10-14 14:11:39,391 INFO L226 Difference]: Without dead ends: 177 [2024-10-14 14:11:39,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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-14 14:11:39,392 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 14:11:39,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 296 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 14:11:39,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-10-14 14:11:39,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2024-10-14 14:11:39,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 150 states have (on average 1.32) internal successors, (198), 151 states have internal predecessors, (198), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 14:11:39,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 242 transitions. [2024-10-14 14:11:39,410 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 242 transitions. Word has length 101 [2024-10-14 14:11:39,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:11:39,411 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 242 transitions. [2024-10-14 14:11:39,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:11:39,411 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 242 transitions. [2024-10-14 14:11:39,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-14 14:11:39,412 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:11:39,412 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:11:39,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 14:11:39,412 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:11:39,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:11:39,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1994296928, now seen corresponding path program 1 times [2024-10-14 14:11:39,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:11:39,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911712501] [2024-10-14 14:11:39,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:11:39,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:11:39,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:40,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:11:40,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:40,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:11:40,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:40,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:11:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:40,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:11:40,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:40,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:11:40,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:40,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:11:40,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:40,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 14:11:40,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:40,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 14:11:40,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:40,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 14:11:40,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:40,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 14:11:40,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:40,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 14:11:40,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:40,295 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:11:40,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:11:40,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911712501] [2024-10-14 14:11:40,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911712501] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:11:40,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:11:40,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 14:11:40,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360297812] [2024-10-14 14:11:40,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:11:40,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 14:11:40,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:11:40,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 14:11:40,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-14 14:11:40,298 INFO L87 Difference]: Start difference. First operand 177 states and 242 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 14:11:40,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:11:40,672 INFO L93 Difference]: Finished difference Result 346 states and 469 transitions. [2024-10-14 14:11:40,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 14:11:40,673 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 102 [2024-10-14 14:11:40,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:11:40,674 INFO L225 Difference]: With dead ends: 346 [2024-10-14 14:11:40,675 INFO L226 Difference]: Without dead ends: 215 [2024-10-14 14:11:40,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-14 14:11:40,677 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 261 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 14:11:40,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 200 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 14:11:40,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-10-14 14:11:40,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 182. [2024-10-14 14:11:40,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 155 states have (on average 1.3161290322580645) internal successors, (204), 156 states have internal predecessors, (204), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 14:11:40,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 248 transitions. [2024-10-14 14:11:40,706 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 248 transitions. Word has length 102 [2024-10-14 14:11:40,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:11:40,706 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 248 transitions. [2024-10-14 14:11:40,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 14:11:40,706 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 248 transitions. [2024-10-14 14:11:40,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-14 14:11:40,707 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:11:40,707 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:11:40,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 14:11:40,708 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:11:40,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:11:40,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1736131490, now seen corresponding path program 1 times [2024-10-14 14:11:40,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:11:40,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48439863] [2024-10-14 14:11:40,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:11:40,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:11:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:41,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:11:41,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:41,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:11:41,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:41,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:11:41,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:41,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:11:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:41,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:11:41,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:41,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:11:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:41,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 14:11:41,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:41,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 14:11:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:41,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 14:11:41,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:41,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 14:11:41,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:41,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 14:11:41,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:41,423 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:11:41,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:11:41,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48439863] [2024-10-14 14:11:41,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48439863] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:11:41,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:11:41,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 14:11:41,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776173079] [2024-10-14 14:11:41,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:11:41,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 14:11:41,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:11:41,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 14:11:41,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 14:11:41,426 INFO L87 Difference]: Start difference. First operand 182 states and 248 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:11:41,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:11:41,763 INFO L93 Difference]: Finished difference Result 360 states and 485 transitions. [2024-10-14 14:11:41,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 14:11:41,765 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 102 [2024-10-14 14:11:41,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:11:41,766 INFO L225 Difference]: With dead ends: 360 [2024-10-14 14:11:41,766 INFO L226 Difference]: Without dead ends: 224 [2024-10-14 14:11:41,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-10-14 14:11:41,767 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 158 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 14:11:41,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 477 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 14:11:41,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-10-14 14:11:41,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 192. [2024-10-14 14:11:41,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 165 states have (on average 1.309090909090909) internal successors, (216), 166 states have internal predecessors, (216), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 14:11:41,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 260 transitions. [2024-10-14 14:11:41,792 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 260 transitions. Word has length 102 [2024-10-14 14:11:41,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:11:41,794 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 260 transitions. [2024-10-14 14:11:41,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:11:41,795 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 260 transitions. [2024-10-14 14:11:41,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-14 14:11:41,796 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:11:41,796 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:11:41,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 14:11:41,796 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:11:41,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:11:41,797 INFO L85 PathProgramCache]: Analyzing trace with hash -148899593, now seen corresponding path program 1 times [2024-10-14 14:11:41,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:11:41,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391461159] [2024-10-14 14:11:41,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:11:41,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:11:41,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:42,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:11:42,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:42,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:11:42,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:42,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:11:42,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:42,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:11:42,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:42,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:11:42,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:42,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:11:42,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:42,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 14:11:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:42,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 14:11:42,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:42,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 14:11:42,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:42,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 14:11:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:42,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 14:11:42,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:42,370 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-14 14:11:42,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:11:42,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391461159] [2024-10-14 14:11:42,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391461159] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:11:42,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:11:42,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 14:11:42,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587133061] [2024-10-14 14:11:42,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:11:42,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 14:11:42,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:11:42,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 14:11:42,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-14 14:11:42,373 INFO L87 Difference]: Start difference. First operand 192 states and 260 transitions. Second operand has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 10 states have internal predecessors, (53), 3 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-14 14:11:42,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:11:42,970 INFO L93 Difference]: Finished difference Result 358 states and 479 transitions. [2024-10-14 14:11:42,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 14:11:42,970 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 10 states have internal predecessors, (53), 3 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 102 [2024-10-14 14:11:42,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:11:42,972 INFO L225 Difference]: With dead ends: 358 [2024-10-14 14:11:42,972 INFO L226 Difference]: Without dead ends: 212 [2024-10-14 14:11:42,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2024-10-14 14:11:42,973 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 188 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 14:11:42,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 357 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 14:11:42,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-10-14 14:11:42,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 204. [2024-10-14 14:11:42,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 176 states have (on average 1.2897727272727273) internal successors, (227), 177 states have internal predecessors, (227), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 14:11:42,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 271 transitions. [2024-10-14 14:11:42,996 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 271 transitions. Word has length 102 [2024-10-14 14:11:42,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:11:42,996 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 271 transitions. [2024-10-14 14:11:42,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 10 states have internal predecessors, (53), 3 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-14 14:11:42,997 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 271 transitions. [2024-10-14 14:11:42,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 14:11:42,997 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:11:42,998 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:11:42,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 14:11:42,998 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:11:42,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:11:42,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1942323275, now seen corresponding path program 1 times [2024-10-14 14:11:42,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:11:42,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586034057] [2024-10-14 14:11:42,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:11:42,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:11:43,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:43,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:11:43,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:43,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:11:43,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:43,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:11:43,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:43,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:11:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:43,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:11:43,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:43,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:11:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:43,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 14:11:43,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:43,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 14:11:43,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:43,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 14:11:43,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:43,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 14:11:43,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:43,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 14:11:43,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:43,348 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:11:43,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:11:43,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586034057] [2024-10-14 14:11:43,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586034057] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:11:43,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:11:43,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 14:11:43,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547495391] [2024-10-14 14:11:43,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:11:43,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 14:11:43,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:11:43,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 14:11:43,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 14:11:43,351 INFO L87 Difference]: Start difference. First operand 204 states and 271 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 14:11:43,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:11:43,651 INFO L93 Difference]: Finished difference Result 400 states and 528 transitions. [2024-10-14 14:11:43,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 14:11:43,652 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2024-10-14 14:11:43,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:11:43,654 INFO L225 Difference]: With dead ends: 400 [2024-10-14 14:11:43,654 INFO L226 Difference]: Without dead ends: 246 [2024-10-14 14:11:43,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 14:11:43,655 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 183 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 14:11:43,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 367 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 14:11:43,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-10-14 14:11:43,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 204. [2024-10-14 14:11:43,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 176 states have (on average 1.2670454545454546) internal successors, (223), 177 states have internal predecessors, (223), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 14:11:43,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 267 transitions. [2024-10-14 14:11:43,677 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 267 transitions. Word has length 103 [2024-10-14 14:11:43,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:11:43,678 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 267 transitions. [2024-10-14 14:11:43,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 14:11:43,678 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 267 transitions. [2024-10-14 14:11:43,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 14:11:43,679 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:11:43,679 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:11:43,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 14:11:43,679 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:11:43,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:11:43,680 INFO L85 PathProgramCache]: Analyzing trace with hash 290382523, now seen corresponding path program 1 times [2024-10-14 14:11:43,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:11:43,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004066758] [2024-10-14 14:11:43,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:11:43,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:11:43,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:44,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:11:44,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:44,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:11:44,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:44,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:11:44,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:44,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:11:44,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:44,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:11:44,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:44,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:11:44,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:44,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 14:11:44,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:44,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 14:11:44,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:44,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 14:11:44,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:44,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 14:11:44,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:44,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 14:11:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:44,313 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-14 14:11:44,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:11:44,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004066758] [2024-10-14 14:11:44,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004066758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:11:44,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:11:44,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 14:11:44,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593484952] [2024-10-14 14:11:44,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:11:44,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 14:11:44,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:11:44,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 14:11:44,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-14 14:11:44,316 INFO L87 Difference]: Start difference. First operand 204 states and 267 transitions. Second operand has 11 states, 10 states have (on average 5.4) internal successors, (54), 11 states have internal predecessors, (54), 3 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-14 14:11:44,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:11:44,994 INFO L93 Difference]: Finished difference Result 354 states and 463 transitions. [2024-10-14 14:11:44,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 14:11:44,995 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.4) internal successors, (54), 11 states have internal predecessors, (54), 3 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 103 [2024-10-14 14:11:44,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:11:44,997 INFO L225 Difference]: With dead ends: 354 [2024-10-14 14:11:44,997 INFO L226 Difference]: Without dead ends: 200 [2024-10-14 14:11:44,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2024-10-14 14:11:44,998 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 225 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 14:11:44,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 373 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 14:11:44,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-10-14 14:11:45,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 188. [2024-10-14 14:11:45,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 160 states have (on average 1.26875) internal successors, (203), 161 states have internal predecessors, (203), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 14:11:45,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 247 transitions. [2024-10-14 14:11:45,024 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 247 transitions. Word has length 103 [2024-10-14 14:11:45,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:11:45,025 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 247 transitions. [2024-10-14 14:11:45,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.4) internal successors, (54), 11 states have internal predecessors, (54), 3 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-14 14:11:45,025 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 247 transitions. [2024-10-14 14:11:45,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-14 14:11:45,026 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:11:45,026 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:11:45,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 14:11:45,026 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:11:45,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:11:45,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1213179290, now seen corresponding path program 1 times [2024-10-14 14:11:45,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:11:45,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205046396] [2024-10-14 14:11:45,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:11:45,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:11:45,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 14:11:45,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [658154058] [2024-10-14 14:11:45,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:11:45,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:11:45,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:11:45,081 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 14:11:45,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 14:11:45,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:45,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-14 14:11:45,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:11:45,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 14:11:45,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 14:11:46,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 14:11:46,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 14:11:46,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 14:11:46,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 14:11:47,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 14:11:47,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2024-10-14 14:11:47,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 14:11:47,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 14:11:47,309 INFO L349 Elim1Store]: treesize reduction 48, result has 39.2 percent of original size [2024-10-14 14:11:47,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 57 [2024-10-14 14:11:51,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 14:11:55,079 INFO L349 Elim1Store]: treesize reduction 408, result has 76.2 percent of original size [2024-10-14 14:11:55,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 16 select indices, 16 select index equivalence classes, 1 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 135 case distinctions, treesize of input 200 treesize of output 1405