./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-a_file-32.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-32.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4c0ba744090c8142a33dba842cf98027b64f47a633efca28c0047c8830fe4fa5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 05:56:29,762 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 05:56:29,832 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 05:56:29,837 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 05:56:29,840 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 05:56:29,887 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 05:56:29,888 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 05:56:29,889 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 05:56:29,889 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 05:56:29,890 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 05:56:29,892 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 05:56:29,892 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 05:56:29,893 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 05:56:29,894 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 05:56:29,894 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 05:56:29,895 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 05:56:29,895 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 05:56:29,895 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 05:56:29,896 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 05:56:29,896 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 05:56:29,896 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 05:56:29,900 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 05:56:29,901 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 05:56:29,901 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 05:56:29,901 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 05:56:29,901 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 05:56:29,902 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 05:56:29,902 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 05:56:29,902 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 05:56:29,903 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 05:56:29,903 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 05:56:29,903 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 05:56:29,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:56:29,904 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 05:56:29,904 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 05:56:29,904 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 05:56:29,904 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 05:56:29,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 05:56:29,905 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 05:56:29,905 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 05:56:29,905 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 05:56:29,907 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 05:56:29,908 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4c0ba744090c8142a33dba842cf98027b64f47a633efca28c0047c8830fe4fa5 [2024-10-13 05:56:30,185 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 05:56:30,210 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 05:56:30,213 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 05:56:30,215 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 05:56:30,216 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 05:56:30,217 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-32.i [2024-10-13 05:56:31,751 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 05:56:31,950 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 05:56:31,951 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-32.i [2024-10-13 05:56:31,964 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9d2c7775/8bf30e73f4ee48f2a37c937e092c1c0c/FLAG5377a4ac1 [2024-10-13 05:56:32,323 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9d2c7775/8bf30e73f4ee48f2a37c937e092c1c0c [2024-10-13 05:56:32,326 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 05:56:32,327 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 05:56:32,330 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 05:56:32,330 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 05:56:32,335 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 05:56:32,336 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:56:32" (1/1) ... [2024-10-13 05:56:32,337 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34eda06d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:56:32, skipping insertion in model container [2024-10-13 05:56:32,337 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:56:32" (1/1) ... [2024-10-13 05:56:32,367 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 05:56:32,526 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-a_file-32.i[916,929] [2024-10-13 05:56:32,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:56:32,647 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 05:56:32,661 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-a_file-32.i[916,929] [2024-10-13 05:56:32,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:56:32,745 INFO L204 MainTranslator]: Completed translation [2024-10-13 05:56:32,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:56:32 WrapperNode [2024-10-13 05:56:32,746 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 05:56:32,747 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 05:56:32,747 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 05:56:32,748 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 05:56:32,756 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:56:32" (1/1) ... [2024-10-13 05:56:32,771 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:56:32" (1/1) ... [2024-10-13 05:56:32,811 INFO L138 Inliner]: procedures = 26, calls = 158, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 440 [2024-10-13 05:56:32,812 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 05:56:32,813 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 05:56:32,814 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 05:56:32,814 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 05:56:32,825 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:56:32" (1/1) ... [2024-10-13 05:56:32,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:56:32" (1/1) ... [2024-10-13 05:56:32,836 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:56:32" (1/1) ... [2024-10-13 05:56:32,868 INFO L175 MemorySlicer]: Split 124 memory accesses to 6 slices as follows [2, 14, 23, 8, 24, 53]. 43 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 2, 3, 1, 2, 4]. The 15 writes are split as follows [0, 2, 5, 2, 2, 4]. [2024-10-13 05:56:32,868 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:56:32" (1/1) ... [2024-10-13 05:56:32,869 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:56:32" (1/1) ... [2024-10-13 05:56:32,898 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:56:32" (1/1) ... [2024-10-13 05:56:32,903 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:56:32" (1/1) ... [2024-10-13 05:56:32,906 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:56:32" (1/1) ... [2024-10-13 05:56:32,909 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:56:32" (1/1) ... [2024-10-13 05:56:32,914 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 05:56:32,915 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 05:56:32,915 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 05:56:32,915 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 05:56:32,916 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:56:32" (1/1) ... [2024-10-13 05:56:32,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:56:32,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:56:32,959 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 05:56:32,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 05:56:33,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 05:56:33,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 05:56:33,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 05:56:33,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 05:56:33,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-13 05:56:33,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-13 05:56:33,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-13 05:56:33,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 05:56:33,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 05:56:33,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 05:56:33,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-13 05:56:33,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-13 05:56:33,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-13 05:56:33,011 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 05:56:33,011 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 05:56:33,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 05:56:33,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 05:56:33,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 05:56:33,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-13 05:56:33,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-13 05:56:33,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-13 05:56:33,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 05:56:33,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 05:56:33,124 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 05:56:33,126 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 05:56:33,653 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-10-13 05:56:33,653 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 05:56:33,693 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 05:56:33,693 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 05:56:33,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:56:33 BoogieIcfgContainer [2024-10-13 05:56:33,694 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 05:56:33,696 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 05:56:33,698 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 05:56:33,701 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 05:56:33,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:56:32" (1/3) ... [2024-10-13 05:56:33,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@407f8213 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:56:33, skipping insertion in model container [2024-10-13 05:56:33,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:56:32" (2/3) ... [2024-10-13 05:56:33,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@407f8213 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:56:33, skipping insertion in model container [2024-10-13 05:56:33,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:56:33" (3/3) ... [2024-10-13 05:56:33,705 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-32.i [2024-10-13 05:56:33,749 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 05:56:33,749 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 05:56:33,836 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 05:56:33,842 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;@b42b7ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 05:56:33,842 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 05:56:33,847 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 71 states have (on average 1.408450704225352) internal successors, (100), 72 states have internal predecessors, (100), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 05:56:33,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-13 05:56:33,858 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:56:33,859 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:56:33,860 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:56:33,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:56:33,866 INFO L85 PathProgramCache]: Analyzing trace with hash 841249278, now seen corresponding path program 1 times [2024-10-13 05:56:33,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:56:33,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699012321] [2024-10-13 05:56:33,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:56:33,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:56:34,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:34,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:56:34,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:34,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:56:34,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:34,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:56:34,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:34,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:56:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:34,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:56:34,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:34,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:56:34,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:34,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:56:34,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:34,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:56:34,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:34,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:56:34,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:34,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:56:34,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:34,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:56:34,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:34,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:56:34,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:34,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:56:34,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:34,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:56:34,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:34,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:56:34,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:34,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:56:34,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:34,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:56:34,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:34,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 05:56:34,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:34,299 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 05:56:34,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:56:34,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699012321] [2024-10-13 05:56:34,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699012321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:56:34,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:56:34,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 05:56:34,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244375624] [2024-10-13 05:56:34,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:56:34,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 05:56:34,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:56:34,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 05:56:34,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:56:34,341 INFO L87 Difference]: Start difference. First operand has 92 states, 71 states have (on average 1.408450704225352) internal successors, (100), 72 states have internal predecessors, (100), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 05:56:34,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:56:34,385 INFO L93 Difference]: Finished difference Result 181 states and 288 transitions. [2024-10-13 05:56:34,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 05:56:34,391 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 124 [2024-10-13 05:56:34,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:56:34,401 INFO L225 Difference]: With dead ends: 181 [2024-10-13 05:56:34,401 INFO L226 Difference]: Without dead ends: 90 [2024-10-13 05:56:34,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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-13 05:56:34,411 INFO L432 NwaCegarLoop]: 123 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, 123 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-13 05:56:34,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:56:34,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-13 05:56:34,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-13 05:56:34,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 05:56:34,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 127 transitions. [2024-10-13 05:56:34,456 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 127 transitions. Word has length 124 [2024-10-13 05:56:34,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:56:34,457 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 127 transitions. [2024-10-13 05:56:34,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 05:56:34,457 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 127 transitions. [2024-10-13 05:56:34,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-13 05:56:34,461 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:56:34,462 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:56:34,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 05:56:34,462 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:56:34,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:56:34,463 INFO L85 PathProgramCache]: Analyzing trace with hash 2096020442, now seen corresponding path program 1 times [2024-10-13 05:56:34,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:56:34,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447253932] [2024-10-13 05:56:34,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:56:34,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:56:34,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:34,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:56:34,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:34,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:56:34,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:34,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:56:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:34,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:56:34,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:34,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:56:34,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:34,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:56:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:34,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:56:34,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:34,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:56:34,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:34,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:56:34,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:34,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:56:34,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:34,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:56:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:34,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:56:34,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:34,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:56:34,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:34,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:56:34,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:34,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:56:34,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:34,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:56:34,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:34,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:56:34,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:34,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 05:56:34,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:35,006 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 05:56:35,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:56:35,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447253932] [2024-10-13 05:56:35,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447253932] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:56:35,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:56:35,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 05:56:35,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845922738] [2024-10-13 05:56:35,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:56:35,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 05:56:35,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:56:35,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 05:56:35,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 05:56:35,015 INFO L87 Difference]: Start difference. First operand 90 states and 127 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 05:56:35,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:56:35,256 INFO L93 Difference]: Finished difference Result 306 states and 432 transitions. [2024-10-13 05:56:35,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 05:56:35,257 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 124 [2024-10-13 05:56:35,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:56:35,260 INFO L225 Difference]: With dead ends: 306 [2024-10-13 05:56:35,260 INFO L226 Difference]: Without dead ends: 217 [2024-10-13 05:56:35,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:56:35,267 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 206 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:56:35,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 350 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:56:35,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-10-13 05:56:35,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 185. [2024-10-13 05:56:35,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 146 states have (on average 1.3013698630136987) internal successors, (190), 146 states have internal predecessors, (190), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-13 05:56:35,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 262 transitions. [2024-10-13 05:56:35,306 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 262 transitions. Word has length 124 [2024-10-13 05:56:35,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:56:35,307 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 262 transitions. [2024-10-13 05:56:35,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 05:56:35,308 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 262 transitions. [2024-10-13 05:56:35,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-13 05:56:35,311 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:56:35,312 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:56:35,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 05:56:35,312 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:56:35,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:56:35,313 INFO L85 PathProgramCache]: Analyzing trace with hash 442873600, now seen corresponding path program 1 times [2024-10-13 05:56:35,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:56:35,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165911010] [2024-10-13 05:56:35,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:56:35,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:56:35,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:36,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:56:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:36,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:56:36,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:36,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:56:36,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:36,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:56:36,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:36,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:56:36,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:36,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:56:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:36,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:56:36,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:36,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:56:36,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:36,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:56:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:36,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:56:36,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:36,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:56:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:36,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:56:36,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:36,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:56:36,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:36,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:56:36,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:36,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:56:36,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:36,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:56:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:36,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:56:36,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:36,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 05:56:36,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:36,818 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 05:56:36,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:56:36,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165911010] [2024-10-13 05:56:36,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165911010] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:56:36,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:56:36,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-13 05:56:36,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582363998] [2024-10-13 05:56:36,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:56:36,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 05:56:36,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:56:36,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 05:56:36,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-10-13 05:56:36,825 INFO L87 Difference]: Start difference. First operand 185 states and 262 transitions. Second operand has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 05:56:37,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:56:37,421 INFO L93 Difference]: Finished difference Result 525 states and 744 transitions. [2024-10-13 05:56:37,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 05:56:37,421 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 132 [2024-10-13 05:56:37,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:56:37,425 INFO L225 Difference]: With dead ends: 525 [2024-10-13 05:56:37,425 INFO L226 Difference]: Without dead ends: 341 [2024-10-13 05:56:37,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2024-10-13 05:56:37,428 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 100 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 05:56:37,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 780 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 05:56:37,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-10-13 05:56:37,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 337. [2024-10-13 05:56:37,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 272 states have (on average 1.3125) internal successors, (357), 274 states have internal predecessors, (357), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-13 05:56:37,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 477 transitions. [2024-10-13 05:56:37,474 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 477 transitions. Word has length 132 [2024-10-13 05:56:37,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:56:37,474 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 477 transitions. [2024-10-13 05:56:37,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 05:56:37,475 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 477 transitions. [2024-10-13 05:56:37,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-13 05:56:37,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:56:37,478 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:56:37,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 05:56:37,478 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:56:37,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:56:37,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1233213465, now seen corresponding path program 1 times [2024-10-13 05:56:37,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:56:37,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324410661] [2024-10-13 05:56:37,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:56:37,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:56:37,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:39,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:56:39,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:39,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:56:39,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:39,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:56:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:39,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:56:39,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:39,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:56:39,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:39,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:56:39,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:39,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:56:39,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:39,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:56:39,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:39,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:56:39,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:39,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:56:39,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:39,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:56:39,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:39,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:56:39,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:39,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:56:39,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:39,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:56:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:39,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:56:39,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:39,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:56:39,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:39,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:56:39,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:39,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 05:56:39,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:39,584 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 05:56:39,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:56:39,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324410661] [2024-10-13 05:56:39,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324410661] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:56:39,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:56:39,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-10-13 05:56:39,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755432626] [2024-10-13 05:56:39,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:56:39,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-13 05:56:39,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:56:39,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-13 05:56:39,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2024-10-13 05:56:39,590 INFO L87 Difference]: Start difference. First operand 337 states and 477 transitions. Second operand has 18 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 18 states have internal predecessors, (47), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2024-10-13 05:56:41,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:56:41,615 INFO L93 Difference]: Finished difference Result 833 states and 1167 transitions. [2024-10-13 05:56:41,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 05:56:41,616 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 18 states have internal predecessors, (47), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Word has length 134 [2024-10-13 05:56:41,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:56:41,627 INFO L225 Difference]: With dead ends: 833 [2024-10-13 05:56:41,627 INFO L226 Difference]: Without dead ends: 497 [2024-10-13 05:56:41,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2024-10-13 05:56:41,630 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 464 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 1328 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 1451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-13 05:56:41,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 1274 Invalid, 1451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1328 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-13 05:56:41,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-10-13 05:56:41,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 344. [2024-10-13 05:56:41,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 279 states have (on average 1.3082437275985663) internal successors, (365), 281 states have internal predecessors, (365), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-13 05:56:41,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 485 transitions. [2024-10-13 05:56:41,691 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 485 transitions. Word has length 134 [2024-10-13 05:56:41,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:56:41,693 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 485 transitions. [2024-10-13 05:56:41,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 18 states have internal predecessors, (47), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2024-10-13 05:56:41,694 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 485 transitions. [2024-10-13 05:56:41,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-13 05:56:41,696 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:56:41,696 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:56:41,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 05:56:41,697 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:56:41,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:56:41,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1089429525, now seen corresponding path program 1 times [2024-10-13 05:56:41,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:56:41,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541428608] [2024-10-13 05:56:41,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:56:41,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:56:41,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:41,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:56:41,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:41,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:56:41,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:41,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:56:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:41,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:56:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:41,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:56:41,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:41,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:56:41,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:41,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:56:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:41,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:56:41,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:41,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:56:41,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:41,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:56:41,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:41,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:56:41,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:41,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:56:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:41,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:56:41,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:41,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:56:41,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:41,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:56:41,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:41,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:56:41,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:41,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:56:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:41,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 05:56:41,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:41,904 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 05:56:41,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:56:41,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541428608] [2024-10-13 05:56:41,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541428608] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:56:41,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:56:41,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:56:41,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378554171] [2024-10-13 05:56:41,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:56:41,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:56:41,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:56:41,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:56:41,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:56:41,919 INFO L87 Difference]: Start difference. First operand 344 states and 485 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 05:56:41,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:56:41,973 INFO L93 Difference]: Finished difference Result 699 states and 985 transitions. [2024-10-13 05:56:41,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:56:41,974 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 134 [2024-10-13 05:56:41,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:56:41,976 INFO L225 Difference]: With dead ends: 699 [2024-10-13 05:56:41,976 INFO L226 Difference]: Without dead ends: 356 [2024-10-13 05:56:41,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:56:41,979 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:56:41,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 470 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:56:41,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-10-13 05:56:42,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2024-10-13 05:56:42,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 291 states have (on average 1.29553264604811) internal successors, (377), 293 states have internal predecessors, (377), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-13 05:56:42,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2024-10-13 05:56:42,009 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 134 [2024-10-13 05:56:42,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:56:42,010 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2024-10-13 05:56:42,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 05:56:42,011 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2024-10-13 05:56:42,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-13 05:56:42,013 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:56:42,013 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:56:42,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 05:56:42,014 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:56:42,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:56:42,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1997485593, now seen corresponding path program 1 times [2024-10-13 05:56:42,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:56:42,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460214823] [2024-10-13 05:56:42,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:56:42,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:56:42,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:43,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:56:43,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:43,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:56:43,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:43,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:56:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:43,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:56:43,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:43,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:56:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:43,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:56:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:43,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:56:43,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:43,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:56:43,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:43,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:56:43,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:43,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:56:43,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:43,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:56:43,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:43,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:56:43,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:43,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:56:43,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:43,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:56:43,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:43,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:56:43,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:43,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:56:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:43,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:56:43,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:43,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 05:56:43,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:43,641 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 05:56:43,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:56:43,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460214823] [2024-10-13 05:56:43,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460214823] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:56:43,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:56:43,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-13 05:56:43,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983385314] [2024-10-13 05:56:43,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:56:43,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 05:56:43,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:56:43,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 05:56:43,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2024-10-13 05:56:43,645 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2024-10-13 05:56:45,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:56:45,977 INFO L93 Difference]: Finished difference Result 811 states and 1122 transitions. [2024-10-13 05:56:45,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 05:56:45,978 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Word has length 134 [2024-10-13 05:56:45,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:56:45,981 INFO L225 Difference]: With dead ends: 811 [2024-10-13 05:56:45,981 INFO L226 Difference]: Without dead ends: 456 [2024-10-13 05:56:45,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2024-10-13 05:56:45,983 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 286 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 1139 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-13 05:56:45,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 1323 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1139 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-13 05:56:45,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2024-10-13 05:56:46,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 310. [2024-10-13 05:56:46,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 257 states have (on average 1.2957198443579767) internal successors, (333), 258 states have internal predecessors, (333), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 05:56:46,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 429 transitions. [2024-10-13 05:56:46,012 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 429 transitions. Word has length 134 [2024-10-13 05:56:46,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:56:46,013 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 429 transitions. [2024-10-13 05:56:46,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2024-10-13 05:56:46,013 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 429 transitions. [2024-10-13 05:56:46,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-13 05:56:46,015 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:56:46,015 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:56:46,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 05:56:46,015 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:56:46,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:56:46,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1505843025, now seen corresponding path program 1 times [2024-10-13 05:56:46,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:56:46,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26904492] [2024-10-13 05:56:46,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:56:46,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:56:46,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:50,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:56:50,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:50,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:56:50,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:50,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:56:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:50,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:56:50,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:50,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:56:50,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:50,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:56:50,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:50,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:56:50,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:50,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:56:50,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:50,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:56:50,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:50,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:56:50,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:50,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:56:50,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:50,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:56:50,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:50,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:56:50,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:50,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:56:50,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:50,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:56:50,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:50,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:56:50,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:50,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:56:50,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:50,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 05:56:50,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:50,940 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 05:56:50,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:56:50,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26904492] [2024-10-13 05:56:50,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26904492] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:56:50,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:56:50,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-13 05:56:50,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13257959] [2024-10-13 05:56:50,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:56:50,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 05:56:50,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:56:50,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 05:56:50,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-10-13 05:56:50,943 INFO L87 Difference]: Start difference. First operand 310 states and 429 transitions. Second operand has 15 states, 12 states have (on average 4.0) internal successors, (48), 15 states have internal predecessors, (48), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2024-10-13 05:57:18,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:57:18,281 INFO L93 Difference]: Finished difference Result 672 states and 925 transitions. [2024-10-13 05:57:18,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 05:57:18,282 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 4.0) internal successors, (48), 15 states have internal predecessors, (48), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Word has length 135 [2024-10-13 05:57:18,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:57:18,286 INFO L225 Difference]: With dead ends: 672 [2024-10-13 05:57:18,286 INFO L226 Difference]: Without dead ends: 504 [2024-10-13 05:57:18,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 25.0s TimeCoverageRelationStatistics Valid=82, Invalid=419, Unknown=5, NotChecked=0, Total=506 [2024-10-13 05:57:18,288 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 270 mSDsluCounter, 1988 mSDsCounter, 0 mSdLazyCounter, 1666 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 2263 SdHoareTripleChecker+Invalid, 1739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:57:18,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 2263 Invalid, 1739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1666 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-10-13 05:57:18,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2024-10-13 05:57:18,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 319. [2024-10-13 05:57:18,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 266 states have (on average 1.2932330827067668) internal successors, (344), 267 states have internal predecessors, (344), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 05:57:18,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 440 transitions. [2024-10-13 05:57:18,352 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 440 transitions. Word has length 135 [2024-10-13 05:57:18,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:57:18,353 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 440 transitions. [2024-10-13 05:57:18,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 4.0) internal successors, (48), 15 states have internal predecessors, (48), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2024-10-13 05:57:18,353 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 440 transitions. [2024-10-13 05:57:18,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-13 05:57:18,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:57:18,356 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:57:18,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 05:57:18,356 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:57:18,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:57:18,357 INFO L85 PathProgramCache]: Analyzing trace with hash -753760193, now seen corresponding path program 1 times [2024-10-13 05:57:18,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:57:18,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947294650] [2024-10-13 05:57:18,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:57:18,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:57:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:20,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:57:20,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:20,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:57:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:20,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:57:20,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:20,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:57:20,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:20,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:57:20,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:20,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:57:20,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:20,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:57:20,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:20,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:57:20,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:20,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:57:20,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:20,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:57:20,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:20,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:57:20,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:20,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:57:20,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:20,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:57:20,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:20,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:57:20,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:20,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:57:20,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:20,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:57:20,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:20,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:57:20,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:20,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 05:57:20,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:20,289 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 05:57:20,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:57:20,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947294650] [2024-10-13 05:57:20,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947294650] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:57:20,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:57:20,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-13 05:57:20,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090613487] [2024-10-13 05:57:20,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:57:20,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-13 05:57:20,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:57:20,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-13 05:57:20,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2024-10-13 05:57:20,292 INFO L87 Difference]: Start difference. First operand 319 states and 440 transitions. Second operand has 17 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 17 states have internal predecessors, (48), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2024-10-13 05:57:23,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 05:57:29,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:57:29,904 INFO L93 Difference]: Finished difference Result 796 states and 1097 transitions. [2024-10-13 05:57:29,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 05:57:29,905 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 17 states have internal predecessors, (48), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Word has length 135 [2024-10-13 05:57:29,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:57:29,909 INFO L225 Difference]: With dead ends: 796 [2024-10-13 05:57:29,909 INFO L226 Difference]: Without dead ends: 621 [2024-10-13 05:57:29,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2024-10-13 05:57:29,911 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 318 mSDsluCounter, 1838 mSDsCounter, 0 mSdLazyCounter, 1594 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 2009 SdHoareTripleChecker+Invalid, 1733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-10-13 05:57:29,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 2009 Invalid, 1733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 1594 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-10-13 05:57:29,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2024-10-13 05:57:29,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 343. [2024-10-13 05:57:29,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 290 states have (on average 1.306896551724138) internal successors, (379), 291 states have internal predecessors, (379), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 05:57:29,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 475 transitions. [2024-10-13 05:57:29,976 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 475 transitions. Word has length 135 [2024-10-13 05:57:29,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:57:29,978 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 475 transitions. [2024-10-13 05:57:29,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 17 states have internal predecessors, (48), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2024-10-13 05:57:29,978 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 475 transitions. [2024-10-13 05:57:29,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 05:57:29,979 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:57:29,980 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:57:29,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 05:57:29,980 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:57:29,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:57:29,980 INFO L85 PathProgramCache]: Analyzing trace with hash 2091456592, now seen corresponding path program 1 times [2024-10-13 05:57:29,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:57:29,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406432573] [2024-10-13 05:57:29,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:57:29,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:57:30,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:30,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:57:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:30,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:57:30,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:30,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:57:30,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:30,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:57:30,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:30,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:57:30,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:30,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:57:30,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:30,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:57:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:30,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:57:30,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:30,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:57:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:30,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:57:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:30,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:57:30,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:30,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:57:30,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:30,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:57:30,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:30,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:57:30,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:30,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:57:30,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:30,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:57:30,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:30,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:57:30,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:30,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 05:57:30,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:30,540 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 05:57:30,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:57:30,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406432573] [2024-10-13 05:57:30,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406432573] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:57:30,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:57:30,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 05:57:30,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242053796] [2024-10-13 05:57:30,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:57:30,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 05:57:30,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:57:30,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 05:57:30,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-13 05:57:30,543 INFO L87 Difference]: Start difference. First operand 343 states and 475 transitions. Second operand has 8 states, 7 states have (on average 7.0) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 05:57:31,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:57:31,278 INFO L93 Difference]: Finished difference Result 1087 states and 1496 transitions. [2024-10-13 05:57:31,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 05:57:31,279 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.0) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 136 [2024-10-13 05:57:31,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:57:31,283 INFO L225 Difference]: With dead ends: 1087 [2024-10-13 05:57:31,283 INFO L226 Difference]: Without dead ends: 745 [2024-10-13 05:57:31,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-13 05:57:31,285 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 230 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 05:57:31,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 463 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 05:57:31,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2024-10-13 05:57:31,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 651. [2024-10-13 05:57:31,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 539 states have (on average 1.2894248608534322) internal successors, (695), 544 states have internal predecessors, (695), 102 states have call successors, (102), 9 states have call predecessors, (102), 9 states have return successors, (102), 97 states have call predecessors, (102), 102 states have call successors, (102) [2024-10-13 05:57:31,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 899 transitions. [2024-10-13 05:57:31,401 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 899 transitions. Word has length 136 [2024-10-13 05:57:31,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:57:31,402 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 899 transitions. [2024-10-13 05:57:31,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.0) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 05:57:31,403 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 899 transitions. [2024-10-13 05:57:31,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 05:57:31,404 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:57:31,404 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:57:31,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 05:57:31,404 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:57:31,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:57:31,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1948438351, now seen corresponding path program 1 times [2024-10-13 05:57:31,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:57:31,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985923427] [2024-10-13 05:57:31,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:57:31,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:57:31,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:31,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:57:31,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:31,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:57:31,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:31,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:57:31,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:31,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:57:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:31,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:57:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:31,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:57:31,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:31,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:57:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:31,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:57:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:31,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:57:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:31,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:57:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:31,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:57:31,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:31,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:57:31,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:31,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:57:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:31,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:57:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:31,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:57:31,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:31,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:57:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:31,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:57:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:31,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 05:57:31,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:31,804 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 05:57:31,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:57:31,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985923427] [2024-10-13 05:57:31,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985923427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:57:31,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:57:31,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 05:57:31,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806697701] [2024-10-13 05:57:31,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:57:31,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 05:57:31,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:57:31,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 05:57:31,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 05:57:31,806 INFO L87 Difference]: Start difference. First operand 651 states and 899 transitions. Second operand has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 05:57:32,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:57:32,283 INFO L93 Difference]: Finished difference Result 1113 states and 1515 transitions. [2024-10-13 05:57:32,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 05:57:32,284 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 136 [2024-10-13 05:57:32,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:57:32,289 INFO L225 Difference]: With dead ends: 1113 [2024-10-13 05:57:32,289 INFO L226 Difference]: Without dead ends: 1111 [2024-10-13 05:57:32,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-13 05:57:32,291 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 63 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:57:32,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 779 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:57:32,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2024-10-13 05:57:32,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 1104. [2024-10-13 05:57:32,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1104 states, 910 states have (on average 1.2615384615384615) internal successors, (1148), 923 states have internal predecessors, (1148), 176 states have call successors, (176), 17 states have call predecessors, (176), 17 states have return successors, (176), 163 states have call predecessors, (176), 176 states have call successors, (176) [2024-10-13 05:57:32,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1500 transitions. [2024-10-13 05:57:32,516 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1500 transitions. Word has length 136 [2024-10-13 05:57:32,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:57:32,517 INFO L471 AbstractCegarLoop]: Abstraction has 1104 states and 1500 transitions. [2024-10-13 05:57:32,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 05:57:32,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1500 transitions. [2024-10-13 05:57:32,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 05:57:32,519 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:57:32,519 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:57:32,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 05:57:32,519 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:57:32,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:57:32,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1532502411, now seen corresponding path program 1 times [2024-10-13 05:57:32,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:57:32,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464897368] [2024-10-13 05:57:32,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:57:32,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:57:32,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:34,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:57:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:34,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:57:34,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:34,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:57:34,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:34,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:57:34,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:34,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:57:34,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:34,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:57:34,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:34,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:57:34,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:34,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:57:34,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:34,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:57:34,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:34,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:57:34,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:34,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:57:34,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:34,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:57:34,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:34,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:57:34,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:34,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:57:34,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:34,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:57:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:34,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:57:34,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:34,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:57:34,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:34,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 05:57:34,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:34,339 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 05:57:34,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:57:34,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464897368] [2024-10-13 05:57:34,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464897368] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:57:34,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:57:34,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-10-13 05:57:34,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468762394] [2024-10-13 05:57:34,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:57:34,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-13 05:57:34,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:57:34,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-13 05:57:34,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2024-10-13 05:57:34,342 INFO L87 Difference]: Start difference. First operand 1104 states and 1500 transitions. Second operand has 19 states, 16 states have (on average 3.0625) internal successors, (49), 19 states have internal predecessors, (49), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2024-10-13 05:57:38,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:57:38,229 INFO L93 Difference]: Finished difference Result 2422 states and 3277 transitions. [2024-10-13 05:57:38,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 05:57:38,229 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 3.0625) internal successors, (49), 19 states have internal predecessors, (49), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Word has length 136 [2024-10-13 05:57:38,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:57:38,238 INFO L225 Difference]: With dead ends: 2422 [2024-10-13 05:57:38,239 INFO L226 Difference]: Without dead ends: 1319 [2024-10-13 05:57:38,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2024-10-13 05:57:38,243 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 331 mSDsluCounter, 1748 mSDsCounter, 0 mSdLazyCounter, 2008 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 1941 SdHoareTripleChecker+Invalid, 2083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 2008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-13 05:57:38,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 1941 Invalid, 2083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 2008 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-13 05:57:38,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2024-10-13 05:57:38,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1149. [2024-10-13 05:57:38,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 938 states have (on average 1.2537313432835822) internal successors, (1176), 952 states have internal predecessors, (1176), 190 states have call successors, (190), 20 states have call predecessors, (190), 20 states have return successors, (190), 176 states have call predecessors, (190), 190 states have call successors, (190) [2024-10-13 05:57:38,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1556 transitions. [2024-10-13 05:57:38,509 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1556 transitions. Word has length 136 [2024-10-13 05:57:38,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:57:38,509 INFO L471 AbstractCegarLoop]: Abstraction has 1149 states and 1556 transitions. [2024-10-13 05:57:38,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 3.0625) internal successors, (49), 19 states have internal predecessors, (49), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2024-10-13 05:57:38,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1556 transitions. [2024-10-13 05:57:38,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 05:57:38,511 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:57:38,512 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:57:38,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 05:57:38,512 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:57:38,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:57:38,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1099290559, now seen corresponding path program 1 times [2024-10-13 05:57:38,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:57:38,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725976802] [2024-10-13 05:57:38,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:57:38,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:57:38,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:39,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:57:39,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:39,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:57:39,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:39,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:57:39,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:39,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:57:39,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:39,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:57:39,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:39,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:57:39,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:39,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:57:39,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:39,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:57:39,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:39,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:57:39,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:39,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:57:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:39,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:57:39,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:39,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:57:39,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:39,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:57:39,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:39,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:57:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:39,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:57:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:39,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:57:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:39,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:57:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:39,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 05:57:39,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:39,859 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 05:57:39,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:57:39,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725976802] [2024-10-13 05:57:39,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725976802] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:57:39,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:57:39,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-13 05:57:39,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323311403] [2024-10-13 05:57:39,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:57:39,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 05:57:39,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:57:39,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 05:57:39,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-10-13 05:57:39,862 INFO L87 Difference]: Start difference. First operand 1149 states and 1556 transitions. Second operand has 15 states, 12 states have (on average 4.083333333333333) internal successors, (49), 15 states have internal predecessors, (49), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2024-10-13 05:57:41,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:57:41,809 INFO L93 Difference]: Finished difference Result 2488 states and 3367 transitions. [2024-10-13 05:57:41,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 05:57:41,810 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 4.083333333333333) internal successors, (49), 15 states have internal predecessors, (49), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Word has length 136 [2024-10-13 05:57:41,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:57:41,820 INFO L225 Difference]: With dead ends: 2488 [2024-10-13 05:57:41,821 INFO L226 Difference]: Without dead ends: 1360 [2024-10-13 05:57:41,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2024-10-13 05:57:41,825 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 354 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 964 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 05:57:41,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 1097 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 964 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 05:57:41,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2024-10-13 05:57:42,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 1140. [2024-10-13 05:57:42,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 929 states have (on average 1.2508073196986007) internal successors, (1162), 943 states have internal predecessors, (1162), 190 states have call successors, (190), 20 states have call predecessors, (190), 20 states have return successors, (190), 176 states have call predecessors, (190), 190 states have call successors, (190) [2024-10-13 05:57:42,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1542 transitions. [2024-10-13 05:57:42,194 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1542 transitions. Word has length 136 [2024-10-13 05:57:42,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:57:42,195 INFO L471 AbstractCegarLoop]: Abstraction has 1140 states and 1542 transitions. [2024-10-13 05:57:42,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 4.083333333333333) internal successors, (49), 15 states have internal predecessors, (49), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2024-10-13 05:57:42,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1542 transitions. [2024-10-13 05:57:42,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 05:57:42,198 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:57:42,198 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:57:42,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 05:57:42,198 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:57:42,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:57:42,199 INFO L85 PathProgramCache]: Analyzing trace with hash 566719730, now seen corresponding path program 1 times [2024-10-13 05:57:42,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:57:42,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612857857] [2024-10-13 05:57:42,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:57:42,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:57:42,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:43,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:57:43,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:43,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:57:43,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:43,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:57:43,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:43,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:57:43,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:43,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:57:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:43,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:57:43,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:43,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:57:43,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:43,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:57:43,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:43,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:57:43,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:43,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:57:43,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:43,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:57:43,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:43,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:57:43,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:43,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:57:43,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:43,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:57:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:43,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:57:43,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:43,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:57:43,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:43,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:57:43,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:43,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 05:57:43,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:43,436 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 05:57:43,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:57:43,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612857857] [2024-10-13 05:57:43,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612857857] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:57:43,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:57:43,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-13 05:57:43,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357945458] [2024-10-13 05:57:43,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:57:43,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-13 05:57:43,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:57:43,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-13 05:57:43,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2024-10-13 05:57:43,439 INFO L87 Difference]: Start difference. First operand 1140 states and 1542 transitions. Second operand has 17 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 17 states have internal predecessors, (49), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-13 05:57:45,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:57:45,275 INFO L93 Difference]: Finished difference Result 2669 states and 3602 transitions. [2024-10-13 05:57:45,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-13 05:57:45,276 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 17 states have internal predecessors, (49), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 136 [2024-10-13 05:57:45,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:57:45,283 INFO L225 Difference]: With dead ends: 2669 [2024-10-13 05:57:45,283 INFO L226 Difference]: Without dead ends: 1550 [2024-10-13 05:57:45,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2024-10-13 05:57:45,287 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 199 mSDsluCounter, 2023 mSDsCounter, 0 mSdLazyCounter, 1174 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 2212 SdHoareTripleChecker+Invalid, 1177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:57:45,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 2212 Invalid, 1177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1174 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 05:57:45,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1550 states. [2024-10-13 05:57:45,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1550 to 1303. [2024-10-13 05:57:45,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1303 states, 1062 states have (on average 1.2485875706214689) internal successors, (1326), 1078 states have internal predecessors, (1326), 216 states have call successors, (216), 24 states have call predecessors, (216), 24 states have return successors, (216), 200 states have call predecessors, (216), 216 states have call successors, (216) [2024-10-13 05:57:45,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1303 states to 1303 states and 1758 transitions. [2024-10-13 05:57:45,573 INFO L78 Accepts]: Start accepts. Automaton has 1303 states and 1758 transitions. Word has length 136 [2024-10-13 05:57:45,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:57:45,574 INFO L471 AbstractCegarLoop]: Abstraction has 1303 states and 1758 transitions. [2024-10-13 05:57:45,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 17 states have internal predecessors, (49), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-13 05:57:45,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1303 states and 1758 transitions. [2024-10-13 05:57:45,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 05:57:45,576 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:57:45,576 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:57:45,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 05:57:45,577 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:57:45,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:57:45,577 INFO L85 PathProgramCache]: Analyzing trace with hash -366325301, now seen corresponding path program 1 times [2024-10-13 05:57:45,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:57:45,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325209854] [2024-10-13 05:57:45,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:57:45,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:57:45,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:46,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:57:46,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:46,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:57:46,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:46,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:57:46,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:46,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:57:46,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:46,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:57:46,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:46,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:57:46,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:46,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:57:46,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:46,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:57:46,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:46,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:57:46,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:46,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:57:46,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:46,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:57:46,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:46,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:57:46,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:46,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:57:46,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:46,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:57:46,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:46,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:57:46,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:46,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:57:46,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:46,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:57:46,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:46,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 05:57:46,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:46,570 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 05:57:46,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:57:46,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325209854] [2024-10-13 05:57:46,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325209854] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:57:46,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:57:46,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-13 05:57:46,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23829842] [2024-10-13 05:57:46,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:57:46,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 05:57:46,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:57:46,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 05:57:46,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-13 05:57:46,572 INFO L87 Difference]: Start difference. First operand 1303 states and 1758 transitions. Second operand has 12 states, 9 states have (on average 5.444444444444445) internal successors, (49), 12 states have internal predecessors, (49), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2024-10-13 05:57:47,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:57:47,641 INFO L93 Difference]: Finished difference Result 2600 states and 3505 transitions. [2024-10-13 05:57:47,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 05:57:47,642 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 5.444444444444445) internal successors, (49), 12 states have internal predecessors, (49), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Word has length 136 [2024-10-13 05:57:47,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:57:47,650 INFO L225 Difference]: With dead ends: 2600 [2024-10-13 05:57:47,650 INFO L226 Difference]: Without dead ends: 1318 [2024-10-13 05:57:47,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2024-10-13 05:57:47,654 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 132 mSDsluCounter, 1031 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 05:57:47,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1170 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 05:57:47,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2024-10-13 05:57:47,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1276. [2024-10-13 05:57:47,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1276 states, 1044 states have (on average 1.2452107279693487) internal successors, (1300), 1059 states have internal predecessors, (1300), 208 states have call successors, (208), 23 states have call predecessors, (208), 23 states have return successors, (208), 193 states have call predecessors, (208), 208 states have call successors, (208) [2024-10-13 05:57:47,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1716 transitions. [2024-10-13 05:57:47,960 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1716 transitions. Word has length 136 [2024-10-13 05:57:47,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:57:47,961 INFO L471 AbstractCegarLoop]: Abstraction has 1276 states and 1716 transitions. [2024-10-13 05:57:47,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 5.444444444444445) internal successors, (49), 12 states have internal predecessors, (49), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2024-10-13 05:57:47,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1716 transitions. [2024-10-13 05:57:47,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-13 05:57:47,964 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:57:47,964 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:57:47,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 05:57:47,965 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:57:47,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:57:47,965 INFO L85 PathProgramCache]: Analyzing trace with hash 2095458696, now seen corresponding path program 1 times [2024-10-13 05:57:47,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:57:47,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794586617] [2024-10-13 05:57:47,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:57:47,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms