./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-18.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-18.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 378186c6d9208dcac7e742ba7e3d709cb5ca4759d0a6109e61503d5010b43317 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:56:24,763 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:56:24,819 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:56:24,825 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:56:24,826 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:56:24,864 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:56:24,864 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:56:24,865 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:56:24,865 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:56:24,874 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:56:24,874 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:56:24,874 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:56:24,875 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:56:24,878 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:56:24,878 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:56:24,879 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:56:24,879 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:56:24,879 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:56:24,879 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:56:24,879 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:56:24,879 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:56:24,880 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:56:24,881 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:56:24,881 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:56:24,881 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:56:24,881 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:56:24,881 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:56:24,881 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:56:24,882 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:56:24,882 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:56:24,882 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:56:24,882 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:56:24,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:56:24,883 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:56:24,883 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:56:24,884 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:56:24,884 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:56:24,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:56:24,884 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:56:24,884 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:56:24,885 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:56:24,885 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:56:24,885 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 378186c6d9208dcac7e742ba7e3d709cb5ca4759d0a6109e61503d5010b43317 [2024-10-11 13:56:25,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:56:25,141 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:56:25,143 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:56:25,144 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:56:25,145 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:56:25,145 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-18.i [2024-10-11 13:56:26,567 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:56:26,748 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:56:26,749 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-18.i [2024-10-11 13:56:26,759 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/983c03cc9/964dd876d41e4d3aa0f1148d3c42d0fd/FLAG8e23847e2 [2024-10-11 13:56:26,773 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/983c03cc9/964dd876d41e4d3aa0f1148d3c42d0fd [2024-10-11 13:56:26,776 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:56:26,777 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:56:26,780 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:56:26,780 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:56:26,784 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:56:26,785 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:56:26" (1/1) ... [2024-10-11 13:56:26,786 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28c2fe8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:26, skipping insertion in model container [2024-10-11 13:56:26,787 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:56:26" (1/1) ... [2024-10-11 13:56:26,814 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:56:26,956 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-18.i[917,930] [2024-10-11 13:56:27,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:56:27,033 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:56:27,046 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-18.i[917,930] [2024-10-11 13:56:27,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:56:27,105 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:56:27,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:27 WrapperNode [2024-10-11 13:56:27,106 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:56:27,107 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:56:27,107 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:56:27,108 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:56:27,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:27" (1/1) ... [2024-10-11 13:56:27,126 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:27" (1/1) ... [2024-10-11 13:56:27,173 INFO L138 Inliner]: procedures = 29, calls = 139, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 483 [2024-10-11 13:56:27,173 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:56:27,174 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:56:27,174 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:56:27,174 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:56:27,186 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:27" (1/1) ... [2024-10-11 13:56:27,187 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:27" (1/1) ... [2024-10-11 13:56:27,191 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:27" (1/1) ... [2024-10-11 13:56:27,223 INFO L175 MemorySlicer]: Split 115 memory accesses to 2 slices as follows [2, 113]. 98 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10]. The 13 writes are split as follows [0, 13]. [2024-10-11 13:56:27,224 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:27" (1/1) ... [2024-10-11 13:56:27,224 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:27" (1/1) ... [2024-10-11 13:56:27,235 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:27" (1/1) ... [2024-10-11 13:56:27,239 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:27" (1/1) ... [2024-10-11 13:56:27,241 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:27" (1/1) ... [2024-10-11 13:56:27,243 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:27" (1/1) ... [2024-10-11 13:56:27,247 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:56:27,247 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:56:27,248 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:56:27,248 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:56:27,248 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:27" (1/1) ... [2024-10-11 13:56:27,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:56:27,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:56:27,296 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:56:27,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:56:27,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:56:27,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 13:56:27,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 13:56:27,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 13:56:27,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 13:56:27,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 13:56:27,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 13:56:27,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 13:56:27,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 13:56:27,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 13:56:27,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 13:56:27,343 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:56:27,343 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:56:27,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:56:27,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 13:56:27,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:56:27,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:56:27,458 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:56:27,459 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:56:27,928 INFO L? ?]: Removed 145 outVars from TransFormulas that were not future-live. [2024-10-11 13:56:27,928 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:56:27,961 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:56:27,963 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:56:27,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:56:27 BoogieIcfgContainer [2024-10-11 13:56:27,963 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:56:27,985 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:56:27,985 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:56:27,988 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:56:27,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:56:26" (1/3) ... [2024-10-11 13:56:27,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@510e362e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:56:27, skipping insertion in model container [2024-10-11 13:56:27,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:27" (2/3) ... [2024-10-11 13:56:27,989 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@510e362e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:56:27, skipping insertion in model container [2024-10-11 13:56:27,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:56:27" (3/3) ... [2024-10-11 13:56:27,990 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-18.i [2024-10-11 13:56:28,004 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:56:28,004 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:56:28,056 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:56:28,062 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;@1ef79b9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:56:28,063 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:56:28,066 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 86 states have (on average 1.5) internal successors, (129), 87 states have internal predecessors, (129), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 13:56:28,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 13:56:28,077 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:28,077 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:56:28,078 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:28,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:28,082 INFO L85 PathProgramCache]: Analyzing trace with hash -830372706, now seen corresponding path program 1 times [2024-10-11 13:56:28,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:28,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207132768] [2024-10-11 13:56:28,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:28,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:28,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:28,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:28,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:28,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:28,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:28,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:28,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:28,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:56:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:28,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:28,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:28,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:28,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:28,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:28,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:28,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:28,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:28,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:56:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:28,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:56:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:28,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:56:28,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:28,406 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:56:28,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:28,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207132768] [2024-10-11 13:56:28,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207132768] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:28,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:28,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:56:28,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386713062] [2024-10-11 13:56:28,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:28,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:56:28,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:28,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:56:28,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:56:28,441 INFO L87 Difference]: Start difference. First operand has 101 states, 86 states have (on average 1.5) internal successors, (129), 87 states have internal predecessors, (129), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 13:56:28,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:28,481 INFO L93 Difference]: Finished difference Result 199 states and 316 transitions. [2024-10-11 13:56:28,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:56:28,484 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 102 [2024-10-11 13:56:28,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:28,491 INFO L225 Difference]: With dead ends: 199 [2024-10-11 13:56:28,492 INFO L226 Difference]: Without dead ends: 99 [2024-10-11 13:56:28,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:56:28,500 INFO L432 NwaCegarLoop]: 144 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, 144 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:28,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:56:28,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-11 13:56:28,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-11 13:56:28,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 85 states have internal predecessors, (124), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 13:56:28,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 148 transitions. [2024-10-11 13:56:28,544 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 148 transitions. Word has length 102 [2024-10-11 13:56:28,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:28,546 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 148 transitions. [2024-10-11 13:56:28,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 13:56:28,546 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 148 transitions. [2024-10-11 13:56:28,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 13:56:28,551 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:28,551 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:56:28,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:56:28,552 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:28,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:28,552 INFO L85 PathProgramCache]: Analyzing trace with hash -746850742, now seen corresponding path program 1 times [2024-10-11 13:56:28,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:28,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053305259] [2024-10-11 13:56:28,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:28,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:28,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:29,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:29,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:29,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:29,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:29,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:29,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:29,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:29,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:29,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:56:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:29,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:29,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:29,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:29,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:29,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:29,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:29,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:56:29,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:29,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:56:29,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:29,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:56:29,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:29,884 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:56:29,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:29,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053305259] [2024-10-11 13:56:29,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053305259] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:29,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:29,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:56:29,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393506663] [2024-10-11 13:56:29,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:29,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:56:29,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:29,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:56:29,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:56:29,890 INFO L87 Difference]: Start difference. First operand 99 states and 148 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 13:56:30,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:30,203 INFO L93 Difference]: Finished difference Result 295 states and 442 transitions. [2024-10-11 13:56:30,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:56:30,203 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 102 [2024-10-11 13:56:30,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:30,205 INFO L225 Difference]: With dead ends: 295 [2024-10-11 13:56:30,205 INFO L226 Difference]: Without dead ends: 197 [2024-10-11 13:56:30,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:56:30,207 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 117 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:30,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 436 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:56:30,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-10-11 13:56:30,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 190. [2024-10-11 13:56:30,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 163 states have (on average 1.4539877300613497) internal successors, (237), 163 states have internal predecessors, (237), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 13:56:30,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 285 transitions. [2024-10-11 13:56:30,230 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 285 transitions. Word has length 102 [2024-10-11 13:56:30,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:30,230 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 285 transitions. [2024-10-11 13:56:30,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 13:56:30,231 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 285 transitions. [2024-10-11 13:56:30,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 13:56:30,235 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:30,235 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:56:30,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:56:30,236 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:30,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:30,237 INFO L85 PathProgramCache]: Analyzing trace with hash 57174979, now seen corresponding path program 1 times [2024-10-11 13:56:30,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:30,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995753401] [2024-10-11 13:56:30,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:30,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:31,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:31,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:31,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:31,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:31,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:31,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:31,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:31,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:31,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:56:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:31,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:31,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:31,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:31,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:31,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:31,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:31,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:31,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:31,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:56:31,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:31,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:56:31,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:31,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:56:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:31,356 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:56:31,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:31,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995753401] [2024-10-11 13:56:31,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995753401] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:31,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:31,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 13:56:31,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173542595] [2024-10-11 13:56:31,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:31,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 13:56:31,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:31,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 13:56:31,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:56:31,359 INFO L87 Difference]: Start difference. First operand 190 states and 285 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 13:56:31,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:31,691 INFO L93 Difference]: Finished difference Result 477 states and 716 transitions. [2024-10-11 13:56:31,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:56:31,692 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 103 [2024-10-11 13:56:31,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:31,695 INFO L225 Difference]: With dead ends: 477 [2024-10-11 13:56:31,695 INFO L226 Difference]: Without dead ends: 288 [2024-10-11 13:56:31,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:56:31,697 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 304 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:31,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 400 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:56:31,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-10-11 13:56:31,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 192. [2024-10-11 13:56:31,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 165 states have (on average 1.4484848484848485) internal successors, (239), 165 states have internal predecessors, (239), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 13:56:31,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 287 transitions. [2024-10-11 13:56:31,715 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 287 transitions. Word has length 103 [2024-10-11 13:56:31,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:31,716 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 287 transitions. [2024-10-11 13:56:31,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 13:56:31,716 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 287 transitions. [2024-10-11 13:56:31,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 13:56:31,718 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:31,718 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:56:31,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 13:56:31,718 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:31,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:31,719 INFO L85 PathProgramCache]: Analyzing trace with hash -428036783, now seen corresponding path program 1 times [2024-10-11 13:56:31,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:31,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420052016] [2024-10-11 13:56:31,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:31,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:31,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:31,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:31,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:31,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:31,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:31,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:31,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:31,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:31,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:31,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:56:31,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:31,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:31,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:31,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:31,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:31,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:31,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:31,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:31,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:31,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:56:31,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:31,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:56:31,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:31,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:56:31,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:31,925 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:56:31,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:31,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420052016] [2024-10-11 13:56:31,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420052016] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:31,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:31,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:56:31,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129178166] [2024-10-11 13:56:31,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:31,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:56:31,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:31,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:56:31,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:56:31,929 INFO L87 Difference]: Start difference. First operand 192 states and 287 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:56:31,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:31,969 INFO L93 Difference]: Finished difference Result 292 states and 437 transitions. [2024-10-11 13:56:31,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:56:31,970 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-10-11 13:56:31,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:31,971 INFO L225 Difference]: With dead ends: 292 [2024-10-11 13:56:31,971 INFO L226 Difference]: Without dead ends: 194 [2024-10-11 13:56:31,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:56:31,973 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 3 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:31,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 402 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:56:31,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-10-11 13:56:31,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2024-10-11 13:56:31,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 166 states have (on average 1.4457831325301205) internal successors, (240), 166 states have internal predecessors, (240), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 13:56:31,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 288 transitions. [2024-10-11 13:56:31,987 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 288 transitions. Word has length 103 [2024-10-11 13:56:31,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:31,988 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 288 transitions. [2024-10-11 13:56:31,988 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:56:31,988 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 288 transitions. [2024-10-11 13:56:31,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 13:56:31,989 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:31,990 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:56:31,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 13:56:31,990 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:31,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:31,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1449105137, now seen corresponding path program 1 times [2024-10-11 13:56:31,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:31,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585029066] [2024-10-11 13:56:31,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:31,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:32,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:32,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:32,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:32,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:32,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:32,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:32,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:32,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:32,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:56:32,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:32,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:32,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:32,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:32,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:32,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:32,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:32,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:32,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:32,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:56:32,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:32,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:56:32,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:32,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:56:32,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:32,171 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:56:32,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:32,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585029066] [2024-10-11 13:56:32,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585029066] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:32,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:32,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:56:32,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336416418] [2024-10-11 13:56:32,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:32,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:56:32,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:32,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:56:32,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:56:32,174 INFO L87 Difference]: Start difference. First operand 193 states and 288 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:56:32,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:32,207 INFO L93 Difference]: Finished difference Result 294 states and 439 transitions. [2024-10-11 13:56:32,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:56:32,207 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-10-11 13:56:32,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:32,209 INFO L225 Difference]: With dead ends: 294 [2024-10-11 13:56:32,209 INFO L226 Difference]: Without dead ends: 195 [2024-10-11 13:56:32,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:56:32,210 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 3 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:32,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 406 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:56:32,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-10-11 13:56:32,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 194. [2024-10-11 13:56:32,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 167 states have (on average 1.4431137724550898) internal successors, (241), 167 states have internal predecessors, (241), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 13:56:32,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 289 transitions. [2024-10-11 13:56:32,225 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 289 transitions. Word has length 103 [2024-10-11 13:56:32,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:32,225 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 289 transitions. [2024-10-11 13:56:32,226 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:56:32,226 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 289 transitions. [2024-10-11 13:56:32,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 13:56:32,228 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:32,228 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:56:32,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 13:56:32,228 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:32,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:32,229 INFO L85 PathProgramCache]: Analyzing trace with hash -748040559, now seen corresponding path program 1 times [2024-10-11 13:56:32,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:32,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684272024] [2024-10-11 13:56:32,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:32,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:32,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:33,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:33,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:33,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:56:33,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:33,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:33,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:33,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:33,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:56:33,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:56:33,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:56:33,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,408 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-10-11 13:56:33,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:33,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684272024] [2024-10-11 13:56:33,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684272024] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:56:33,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307887881] [2024-10-11 13:56:33,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:33,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:56:33,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:56:33,411 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:56:33,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 13:56:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,563 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-10-11 13:56:33,584 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:56:33,732 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-11 13:56:34,298 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 30 treesize of output 14 [2024-10-11 13:56:34,652 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 30 treesize of output 14 [2024-10-11 13:56:34,930 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 30 treesize of output 14 [2024-10-11 13:56:35,166 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 30 treesize of output 14 [2024-10-11 13:56:35,498 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 30 treesize of output 14 [2024-10-11 13:56:35,811 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 30 treesize of output 14 [2024-10-11 13:56:36,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2024-10-11 13:56:36,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 13:56:36,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 13:56:36,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 13:56:36,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 38 [2024-10-11 13:56:36,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 13:56:36,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 13:56:36,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 13:56:36,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 24 [2024-10-11 13:56:36,472 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 9 proven. 107 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-10-11 13:56:36,473 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:56:37,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307887881] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:56:37,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:56:37,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14] total 23 [2024-10-11 13:56:37,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531000982] [2024-10-11 13:56:37,193 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:56:37,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 13:56:37,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:37,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 13:56:37,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=838, Unknown=0, NotChecked=0, Total=930 [2024-10-11 13:56:37,195 INFO L87 Difference]: Start difference. First operand 194 states and 289 transitions. Second operand has 23 states, 21 states have (on average 4.238095238095238) internal successors, (89), 22 states have internal predecessors, (89), 6 states have call successors, (24), 4 states have call predecessors, (24), 5 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2024-10-11 13:56:40,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:40,171 INFO L93 Difference]: Finished difference Result 700 states and 1030 transitions. [2024-10-11 13:56:40,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-11 13:56:40,172 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 4.238095238095238) internal successors, (89), 22 states have internal predecessors, (89), 6 states have call successors, (24), 4 states have call predecessors, (24), 5 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) Word has length 103 [2024-10-11 13:56:40,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:40,174 INFO L225 Difference]: With dead ends: 700 [2024-10-11 13:56:40,174 INFO L226 Difference]: Without dead ends: 600 [2024-10-11 13:56:40,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=416, Invalid=2340, Unknown=0, NotChecked=0, Total=2756 [2024-10-11 13:56:40,177 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 1251 mSDsluCounter, 2891 mSDsCounter, 0 mSdLazyCounter, 2676 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1254 SdHoareTripleChecker+Valid, 3103 SdHoareTripleChecker+Invalid, 2786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 2676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:40,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1254 Valid, 3103 Invalid, 2786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 2676 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 13:56:40,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-10-11 13:56:40,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 313. [2024-10-11 13:56:40,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 270 states have (on average 1.4259259259259258) internal successors, (385), 270 states have internal predecessors, (385), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 13:56:40,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 457 transitions. [2024-10-11 13:56:40,205 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 457 transitions. Word has length 103 [2024-10-11 13:56:40,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:40,206 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 457 transitions. [2024-10-11 13:56:40,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 4.238095238095238) internal successors, (89), 22 states have internal predecessors, (89), 6 states have call successors, (24), 4 states have call predecessors, (24), 5 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2024-10-11 13:56:40,206 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 457 transitions. [2024-10-11 13:56:40,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 13:56:40,207 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:40,207 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:56:40,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 13:56:40,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:56:40,414 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:40,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:40,415 INFO L85 PathProgramCache]: Analyzing trace with hash -759101914, now seen corresponding path program 1 times [2024-10-11 13:56:40,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:40,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871170888] [2024-10-11 13:56:40,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:40,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:40,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:40,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:40,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:40,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:40,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:40,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:40,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:40,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:40,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:40,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:56:40,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:40,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:40,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:40,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:40,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:41,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:41,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:41,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:56:41,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:41,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:56:41,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:41,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:56:41,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:41,016 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:56:41,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:41,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871170888] [2024-10-11 13:56:41,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871170888] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:41,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:41,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:56:41,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165567825] [2024-10-11 13:56:41,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:41,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:56:41,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:41,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:56:41,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:56:41,018 INFO L87 Difference]: Start difference. First operand 313 states and 457 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 13:56:41,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:41,329 INFO L93 Difference]: Finished difference Result 735 states and 1073 transitions. [2024-10-11 13:56:41,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:56:41,330 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 104 [2024-10-11 13:56:41,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:41,332 INFO L225 Difference]: With dead ends: 735 [2024-10-11 13:56:41,332 INFO L226 Difference]: Without dead ends: 423 [2024-10-11 13:56:41,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:56:41,333 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 127 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:41,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 665 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:56:41,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2024-10-11 13:56:41,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 412. [2024-10-11 13:56:41,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 355 states have (on average 1.419718309859155) internal successors, (504), 355 states have internal predecessors, (504), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 13:56:41,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 600 transitions. [2024-10-11 13:56:41,355 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 600 transitions. Word has length 104 [2024-10-11 13:56:41,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:41,356 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 600 transitions. [2024-10-11 13:56:41,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 13:56:41,356 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 600 transitions. [2024-10-11 13:56:41,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 13:56:41,357 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:41,357 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:56:41,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 13:56:41,357 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:41,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:41,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1541720676, now seen corresponding path program 1 times [2024-10-11 13:56:41,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:41,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366320129] [2024-10-11 13:56:41,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:41,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:41,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:42,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:42,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:42,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:42,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:42,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:42,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:42,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:42,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:56:42,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:42,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:42,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:42,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:42,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:42,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:42,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:42,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:42,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:42,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:56:42,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:42,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:56:42,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:42,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:56:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:42,038 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:56:42,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:42,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366320129] [2024-10-11 13:56:42,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366320129] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:42,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:42,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:56:42,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272844562] [2024-10-11 13:56:42,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:42,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:56:42,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:42,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:56:42,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:56:42,040 INFO L87 Difference]: Start difference. First operand 412 states and 600 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 13:56:42,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:42,575 INFO L93 Difference]: Finished difference Result 884 states and 1289 transitions. [2024-10-11 13:56:42,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:56:42,575 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 104 [2024-10-11 13:56:42,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:42,578 INFO L225 Difference]: With dead ends: 884 [2024-10-11 13:56:42,578 INFO L226 Difference]: Without dead ends: 571 [2024-10-11 13:56:42,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:56:42,580 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 385 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:42,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 810 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:56:42,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2024-10-11 13:56:42,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 422. [2024-10-11 13:56:42,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 365 states have (on average 1.4246575342465753) internal successors, (520), 365 states have internal predecessors, (520), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 13:56:42,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 616 transitions. [2024-10-11 13:56:42,629 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 616 transitions. Word has length 104 [2024-10-11 13:56:42,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:42,630 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 616 transitions. [2024-10-11 13:56:42,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 13:56:42,630 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 616 transitions. [2024-10-11 13:56:42,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 13:56:42,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:42,631 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:56:42,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 13:56:42,632 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:42,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:42,632 INFO L85 PathProgramCache]: Analyzing trace with hash 557799098, now seen corresponding path program 1 times [2024-10-11 13:56:42,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:42,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992580609] [2024-10-11 13:56:42,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:42,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:42,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:43,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:43,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:43,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:56:43,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:43,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:43,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:43,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:43,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:56:43,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:56:43,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:56:43,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,287 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:56:43,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:43,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992580609] [2024-10-11 13:56:43,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992580609] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:43,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:43,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 13:56:43,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4400175] [2024-10-11 13:56:43,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:43,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 13:56:43,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:43,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 13:56:43,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:56:43,289 INFO L87 Difference]: Start difference. First operand 422 states and 616 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 13:56:43,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:43,640 INFO L93 Difference]: Finished difference Result 649 states and 947 transitions. [2024-10-11 13:56:43,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:56:43,641 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 105 [2024-10-11 13:56:43,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:43,643 INFO L225 Difference]: With dead ends: 649 [2024-10-11 13:56:43,644 INFO L226 Difference]: Without dead ends: 433 [2024-10-11 13:56:43,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:56:43,645 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 216 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:43,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 596 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:56:43,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2024-10-11 13:56:43,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 426. [2024-10-11 13:56:43,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 369 states have (on average 1.4200542005420054) internal successors, (524), 369 states have internal predecessors, (524), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 13:56:43,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 620 transitions. [2024-10-11 13:56:43,686 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 620 transitions. Word has length 105 [2024-10-11 13:56:43,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:43,686 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 620 transitions. [2024-10-11 13:56:43,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 13:56:43,686 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 620 transitions. [2024-10-11 13:56:43,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 13:56:43,687 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:43,687 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:56:43,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 13:56:43,687 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:43,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:43,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1879362677, now seen corresponding path program 1 times [2024-10-11 13:56:43,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:43,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915594311] [2024-10-11 13:56:43,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:43,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:43,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:43,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:43,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:43,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:43,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:56:43,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:43,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:43,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:43,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:56:43,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:56:43,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:56:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:43,979 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:56:43,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:43,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915594311] [2024-10-11 13:56:43,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915594311] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:43,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:43,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:56:43,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42508515] [2024-10-11 13:56:43,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:43,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:56:43,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:43,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:56:43,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:56:43,981 INFO L87 Difference]: Start difference. First operand 426 states and 620 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:56:44,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:44,457 INFO L93 Difference]: Finished difference Result 1119 states and 1642 transitions. [2024-10-11 13:56:44,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 13:56:44,458 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2024-10-11 13:56:44,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:44,461 INFO L225 Difference]: With dead ends: 1119 [2024-10-11 13:56:44,462 INFO L226 Difference]: Without dead ends: 798 [2024-10-11 13:56:44,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:56:44,463 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 212 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:44,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 937 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:56:44,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2024-10-11 13:56:44,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 452. [2024-10-11 13:56:44,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 395 states have (on average 1.4329113924050634) internal successors, (566), 395 states have internal predecessors, (566), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 13:56:44,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 662 transitions. [2024-10-11 13:56:44,490 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 662 transitions. Word has length 105 [2024-10-11 13:56:44,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:44,491 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 662 transitions. [2024-10-11 13:56:44,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:56:44,491 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 662 transitions. [2024-10-11 13:56:44,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 13:56:44,507 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:44,507 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:56:44,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 13:56:44,507 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:44,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:44,507 INFO L85 PathProgramCache]: Analyzing trace with hash -320122634, now seen corresponding path program 1 times [2024-10-11 13:56:44,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:44,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821697603] [2024-10-11 13:56:44,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:44,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:44,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:45,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:45,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:45,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:45,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:45,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:45,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:45,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:56:45,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:45,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:45,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:45,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:45,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:45,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:45,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:45,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:45,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:56:45,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:45,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:56:45,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:45,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:56:45,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:45,534 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-10-11 13:56:45,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:45,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821697603] [2024-10-11 13:56:45,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821697603] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:56:45,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131601923] [2024-10-11 13:56:45,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:45,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:56:45,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:56:45,536 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:56:45,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 13:56:45,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:45,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-11 13:56:45,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:56:45,753 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-11 13:56:46,014 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 30 treesize of output 14 [2024-10-11 13:56:46,182 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 30 treesize of output 14 [2024-10-11 13:56:46,341 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 30 treesize of output 14 [2024-10-11 13:56:46,482 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 30 treesize of output 14 [2024-10-11 13:56:46,656 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 30 treesize of output 14 [2024-10-11 13:56:46,851 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 30 treesize of output 14 [2024-10-11 13:56:46,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 13:56:46,990 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 30 treesize of output 14 [2024-10-11 13:56:47,023 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-10-11 13:56:47,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2024-10-11 13:56:47,059 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-11 13:56:47,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2024-10-11 13:56:47,086 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 9 proven. 107 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-10-11 13:56:47,086 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:56:47,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131601923] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:56:47,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:56:47,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 24 [2024-10-11 13:56:47,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203576356] [2024-10-11 13:56:47,250 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:56:47,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-11 13:56:47,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:47,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-11 13:56:47,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=760, Unknown=0, NotChecked=0, Total=870 [2024-10-11 13:56:47,252 INFO L87 Difference]: Start difference. First operand 452 states and 662 transitions. Second operand has 24 states, 22 states have (on average 4.045454545454546) internal successors, (89), 23 states have internal predecessors, (89), 6 states have call successors, (24), 4 states have call predecessors, (24), 5 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2024-10-11 13:56:48,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:48,338 INFO L93 Difference]: Finished difference Result 1019 states and 1493 transitions. [2024-10-11 13:56:48,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 13:56:48,339 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 4.045454545454546) internal successors, (89), 23 states have internal predecessors, (89), 6 states have call successors, (24), 4 states have call predecessors, (24), 5 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) Word has length 105 [2024-10-11 13:56:48,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:48,341 INFO L225 Difference]: With dead ends: 1019 [2024-10-11 13:56:48,342 INFO L226 Difference]: Without dead ends: 674 [2024-10-11 13:56:48,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=270, Invalid=1290, Unknown=0, NotChecked=0, Total=1560 [2024-10-11 13:56:48,343 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 622 mSDsluCounter, 1559 mSDsCounter, 0 mSdLazyCounter, 1463 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 1687 SdHoareTripleChecker+Invalid, 1491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:48,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 1687 Invalid, 1491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1463 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 13:56:48,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2024-10-11 13:56:48,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 426. [2024-10-11 13:56:48,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 369 states have (on average 1.3929539295392954) internal successors, (514), 369 states have internal predecessors, (514), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 13:56:48,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 610 transitions. [2024-10-11 13:56:48,370 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 610 transitions. Word has length 105 [2024-10-11 13:56:48,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:48,371 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 610 transitions. [2024-10-11 13:56:48,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 4.045454545454546) internal successors, (89), 23 states have internal predecessors, (89), 6 states have call successors, (24), 4 states have call predecessors, (24), 5 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2024-10-11 13:56:48,371 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 610 transitions. [2024-10-11 13:56:48,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-11 13:56:48,372 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:48,372 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:56:48,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 13:56:48,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:56:48,573 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:48,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:48,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1890267798, now seen corresponding path program 1 times [2024-10-11 13:56:48,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:48,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055029900] [2024-10-11 13:56:48,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:48,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:48,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:48,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:48,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:48,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:48,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:48,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:48,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:48,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:48,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:48,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:56:48,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:48,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:48,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:48,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:48,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:48,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:48,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:48,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:56:48,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:48,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:56:48,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:48,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:56:48,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:48,663 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:56:48,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:48,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055029900] [2024-10-11 13:56:48,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055029900] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:48,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:48,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:56:48,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699973131] [2024-10-11 13:56:48,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:48,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:56:48,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:48,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:56:48,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:56:48,665 INFO L87 Difference]: Start difference. First operand 426 states and 610 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:56:48,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:48,725 INFO L93 Difference]: Finished difference Result 851 states and 1219 transitions. [2024-10-11 13:56:48,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:56:48,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 106 [2024-10-11 13:56:48,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:48,729 INFO L225 Difference]: With dead ends: 851 [2024-10-11 13:56:48,729 INFO L226 Difference]: Without dead ends: 422 [2024-10-11 13:56:48,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:56:48,730 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:48,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 282 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:56:48,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2024-10-11 13:56:48,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 422. [2024-10-11 13:56:48,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 365 states have (on average 1.3863013698630138) internal successors, (506), 365 states have internal predecessors, (506), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 13:56:48,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 602 transitions. [2024-10-11 13:56:48,755 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 602 transitions. Word has length 106 [2024-10-11 13:56:48,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:48,756 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 602 transitions. [2024-10-11 13:56:48,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:56:48,756 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 602 transitions. [2024-10-11 13:56:48,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-11 13:56:48,756 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:48,756 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:56:48,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 13:56:48,757 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:48,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:48,757 INFO L85 PathProgramCache]: Analyzing trace with hash -876006015, now seen corresponding path program 1 times [2024-10-11 13:56:48,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:48,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447815494] [2024-10-11 13:56:48,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:48,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:48,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat