./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-5.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 2be5ecf5348458671ab0cc252df5fcce5a265155e50eac356b5f3e450b866c41 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:37:23,021 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:37:23,090 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 09:37:23,096 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:37:23,099 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:37:23,125 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:37:23,125 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:37:23,126 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:37:23,126 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:37:23,127 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:37:23,127 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:37:23,127 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:37:23,128 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:37:23,128 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:37:23,129 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:37:23,129 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:37:23,130 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:37:23,130 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:37:23,130 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 09:37:23,130 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:37:23,131 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:37:23,131 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:37:23,132 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:37:23,132 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:37:23,132 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:37:23,133 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:37:23,133 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:37:23,133 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:37:23,133 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:37:23,134 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:37:23,134 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:37:23,142 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:37:23,143 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:37:23,143 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:37:23,143 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:37:23,144 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:37:23,144 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 09:37:23,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 09:37:23,147 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:37:23,147 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:37:23,147 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:37:23,148 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:37:23,148 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 -> 2be5ecf5348458671ab0cc252df5fcce5a265155e50eac356b5f3e450b866c41 [2024-11-10 09:37:23,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:37:23,435 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:37:23,438 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:37:23,439 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:37:23,440 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:37:23,441 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-5.i [2024-11-10 09:37:24,897 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:37:25,178 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:37:25,180 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-5.i [2024-11-10 09:37:25,195 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25d0ceb4a/db885cc0e5fe44b5a07dd4ae4cd5af5a/FLAGc0faacaad [2024-11-10 09:37:25,216 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25d0ceb4a/db885cc0e5fe44b5a07dd4ae4cd5af5a [2024-11-10 09:37:25,221 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:37:25,223 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:37:25,225 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:37:25,225 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:37:25,231 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:37:25,233 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:37:25" (1/1) ... [2024-11-10 09:37:25,234 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23130a79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:37:25, skipping insertion in model container [2024-11-10 09:37:25,234 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:37:25" (1/1) ... [2024-11-10 09:37:25,267 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:37:25,453 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-5.i[915,928] [2024-11-10 09:37:25,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:37:25,547 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:37:25,559 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-5.i[915,928] [2024-11-10 09:37:25,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:37:25,610 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:37:25,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:37:25 WrapperNode [2024-11-10 09:37:25,611 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:37:25,612 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:37:25,612 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:37:25,612 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:37:25,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:37:25" (1/1) ... [2024-11-10 09:37:25,638 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:37:25" (1/1) ... [2024-11-10 09:37:25,676 INFO L138 Inliner]: procedures = 26, calls = 168, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 452 [2024-11-10 09:37:25,677 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:37:25,678 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:37:25,678 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:37:25,678 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:37:25,689 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:37:25" (1/1) ... [2024-11-10 09:37:25,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:37:25" (1/1) ... [2024-11-10 09:37:25,695 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:37:25" (1/1) ... [2024-11-10 09:37:25,721 INFO L175 MemorySlicer]: Split 122 memory accesses to 16 slices as follows [2, 3, 6, 6, 29, 6, 6, 14, 8, 7, 9, 8, 8, 3, 3, 4]. 24 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 17 writes are split as follows [0, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. [2024-11-10 09:37:25,721 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:37:25" (1/1) ... [2024-11-10 09:37:25,721 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:37:25" (1/1) ... [2024-11-10 09:37:25,743 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:37:25" (1/1) ... [2024-11-10 09:37:25,746 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:37:25" (1/1) ... [2024-11-10 09:37:25,751 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:37:25" (1/1) ... [2024-11-10 09:37:25,754 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:37:25" (1/1) ... [2024-11-10 09:37:25,760 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:37:25,761 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:37:25,761 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:37:25,761 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:37:25,766 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:37:25" (1/1) ... [2024-11-10 09:37:25,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:37:25,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:37:25,809 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 09:37:25,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 09:37:25,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:37:25,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 09:37:25,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 09:37:25,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 09:37:25,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-10 09:37:25,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-10 09:37:25,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-10 09:37:25,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-10 09:37:25,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-10 09:37:25,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-10 09:37:25,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-10 09:37:25,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-10 09:37:25,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-10 09:37:25,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-10 09:37:25,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-11-10 09:37:25,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-11-10 09:37:25,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-11-10 09:37:25,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 09:37:25,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 09:37:25,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 09:37:25,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-10 09:37:25,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-10 09:37:25,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-10 09:37:25,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-10 09:37:25,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-10 09:37:25,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-10 09:37:25,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-10 09:37:25,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-10 09:37:25,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-10 09:37:25,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-10 09:37:25,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-11-10 09:37:25,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-11-10 09:37:25,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-11-10 09:37:25,867 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:37:25,867 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:37:25,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 09:37:25,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 09:37:25,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 09:37:25,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-10 09:37:25,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-10 09:37:25,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-10 09:37:25,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-10 09:37:25,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-10 09:37:25,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-10 09:37:25,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-10 09:37:25,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-10 09:37:25,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-10 09:37:25,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-10 09:37:25,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-10 09:37:25,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-11-10 09:37:25,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-11-10 09:37:25,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:37:25,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:37:26,070 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:37:26,072 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:37:26,550 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L117: havoc property_#t~mem66#1;havoc property_#t~mem67#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~ite78#1;havoc property_#t~mem77#1;havoc property_#t~mem70#1;havoc property_#t~mem71#1;havoc property_#t~ite76#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~mem79#1;havoc property_#t~ite91#1;havoc property_#t~mem82#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~ite90#1;havoc property_#t~ite87#1;havoc property_#t~mem84#1;havoc property_#t~mem83#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~mem89#1;havoc property_#t~mem88#1;havoc property_#t~short92#1;havoc property_#t~mem96#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite105#1;havoc property_#t~mem104#1;havoc property_#t~mem103#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~ite101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~mem102#1;havoc property_#t~short106#1;havoc property_#t~mem107#1;havoc property_#t~short108#1;havoc property_#t~mem110#1;havoc property_#t~mem109#1;havoc property_#t~short111#1;havoc property_#t~mem113#1;havoc property_#t~mem112#1;havoc property_#t~short114#1; [2024-11-10 09:37:26,608 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2024-11-10 09:37:26,608 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:37:26,625 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:37:26,625 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:37:26,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:37:26 BoogieIcfgContainer [2024-11-10 09:37:26,626 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:37:26,628 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:37:26,628 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:37:26,631 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:37:26,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:37:25" (1/3) ... [2024-11-10 09:37:26,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14f06f25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:37:26, skipping insertion in model container [2024-11-10 09:37:26,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:37:25" (2/3) ... [2024-11-10 09:37:26,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14f06f25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:37:26, skipping insertion in model container [2024-11-10 09:37:26,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:37:26" (3/3) ... [2024-11-10 09:37:26,633 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-5.i [2024-11-10 09:37:26,649 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:37:26,650 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:37:26,715 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:37:26,722 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;@7a9b6a03, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:37:26,723 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:37:26,728 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 76 states have (on average 1.3157894736842106) internal successors, (100), 77 states have internal predecessors, (100), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 09:37:26,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-10 09:37:26,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:37:26,748 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:37:26,748 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:37:26,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:37:26,755 INFO L85 PathProgramCache]: Analyzing trace with hash 502937304, now seen corresponding path program 1 times [2024-11-10 09:37:26,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:37:26,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430525387] [2024-11-10 09:37:26,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:37:26,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:37:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:27,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:37:27,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:27,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:37:27,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:27,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:37:27,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:27,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:37:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:27,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:37:27,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:27,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:37:27,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:27,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:37:27,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:27,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:37:27,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:27,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:37:27,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:27,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:37:27,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:27,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:37:27,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:27,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:37:27,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:27,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:37:27,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:27,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:37:27,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:27,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:37:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:27,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:37:27,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:27,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:37:27,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:27,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:37:27,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:27,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:37:27,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:27,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:37:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:27,366 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 09:37:27,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:37:27,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430525387] [2024-11-10 09:37:27,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430525387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:37:27,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:37:27,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:37:27,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648740594] [2024-11-10 09:37:27,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:37:27,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:37:27,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:37:27,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:37:27,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:37:27,408 INFO L87 Difference]: Start difference. First operand has 99 states, 76 states have (on average 1.3157894736842106) internal successors, (100), 77 states have internal predecessors, (100), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-10 09:37:27,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:37:27,449 INFO L93 Difference]: Finished difference Result 190 states and 293 transitions. [2024-11-10 09:37:27,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:37:27,451 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 150 [2024-11-10 09:37:27,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:37:27,461 INFO L225 Difference]: With dead ends: 190 [2024-11-10 09:37:27,461 INFO L226 Difference]: Without dead ends: 94 [2024-11-10 09:37:27,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:37:27,469 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:37:27,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:37:27,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-10 09:37:27,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-10 09:37:27,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 72 states have internal predecessors, (92), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 09:37:27,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 132 transitions. [2024-11-10 09:37:27,525 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 132 transitions. Word has length 150 [2024-11-10 09:37:27,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:37:27,526 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 132 transitions. [2024-11-10 09:37:27,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-10 09:37:27,526 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 132 transitions. [2024-11-10 09:37:27,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-10 09:37:27,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:37:27,531 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:37:27,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 09:37:27,532 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:37:27,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:37:27,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1690722108, now seen corresponding path program 1 times [2024-11-10 09:37:27,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:37:27,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502290268] [2024-11-10 09:37:27,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:37:27,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:37:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:27,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:37:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:27,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:37:27,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:27,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:37:27,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:37:28,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:37:28,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:37:28,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:37:28,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:37:28,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:37:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:37:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:37:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:37:28,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:37:28,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:37:28,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:37:28,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:37:28,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:37:28,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:37:28,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:37:28,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:37:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,092 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 09:37:28,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:37:28,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502290268] [2024-11-10 09:37:28,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502290268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:37:28,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:37:28,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:37:28,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882488518] [2024-11-10 09:37:28,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:37:28,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:37:28,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:37:28,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:37:28,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:37:28,102 INFO L87 Difference]: Start difference. First operand 94 states and 132 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 09:37:28,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:37:28,153 INFO L93 Difference]: Finished difference Result 187 states and 264 transitions. [2024-11-10 09:37:28,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:37:28,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2024-11-10 09:37:28,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:37:28,156 INFO L225 Difference]: With dead ends: 187 [2024-11-10 09:37:28,156 INFO L226 Difference]: Without dead ends: 96 [2024-11-10 09:37:28,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:37:28,160 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:37:28,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 379 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:37:28,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-10 09:37:28,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-10 09:37:28,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 74 states have internal predecessors, (94), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 09:37:28,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 134 transitions. [2024-11-10 09:37:28,181 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 134 transitions. Word has length 150 [2024-11-10 09:37:28,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:37:28,183 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 134 transitions. [2024-11-10 09:37:28,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 09:37:28,184 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 134 transitions. [2024-11-10 09:37:28,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-10 09:37:28,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:37:28,187 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:37:28,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 09:37:28,187 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:37:28,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:37:28,188 INFO L85 PathProgramCache]: Analyzing trace with hash 87909190, now seen corresponding path program 1 times [2024-11-10 09:37:28,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:37:28,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791561342] [2024-11-10 09:37:28,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:37:28,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:37:28,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:37:28,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:37:28,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:37:28,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:37:28,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:37:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:37:28,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:37:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:37:28,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:37:28,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:37:28,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:37:28,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:37:28,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:37:28,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:37:28,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:37:28,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:37:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:37:28,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:37:28,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:37:28,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:37:28,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,451 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 09:37:28,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:37:28,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791561342] [2024-11-10 09:37:28,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791561342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:37:28,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:37:28,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:37:28,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126952293] [2024-11-10 09:37:28,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:37:28,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:37:28,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:37:28,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:37:28,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:37:28,455 INFO L87 Difference]: Start difference. First operand 96 states and 134 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 09:37:28,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:37:28,502 INFO L93 Difference]: Finished difference Result 192 states and 269 transitions. [2024-11-10 09:37:28,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:37:28,508 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 152 [2024-11-10 09:37:28,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:37:28,509 INFO L225 Difference]: With dead ends: 192 [2024-11-10 09:37:28,509 INFO L226 Difference]: Without dead ends: 99 [2024-11-10 09:37:28,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:37:28,514 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:37:28,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 376 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:37:28,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-10 09:37:28,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2024-11-10 09:37:28,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 76 states have (on average 1.263157894736842) internal successors, (96), 76 states have internal predecessors, (96), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 09:37:28,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 136 transitions. [2024-11-10 09:37:28,524 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 136 transitions. Word has length 152 [2024-11-10 09:37:28,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:37:28,524 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 136 transitions. [2024-11-10 09:37:28,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 09:37:28,525 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 136 transitions. [2024-11-10 09:37:28,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-10 09:37:28,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:37:28,527 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:37:28,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 09:37:28,527 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:37:28,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:37:28,527 INFO L85 PathProgramCache]: Analyzing trace with hash -108604315, now seen corresponding path program 1 times [2024-11-10 09:37:28,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:37:28,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301356049] [2024-11-10 09:37:28,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:37:28,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:37:28,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:37:28,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:37:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:37:28,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:37:28,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:37:28,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:37:28,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:37:28,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:37:28,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:37:28,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:37:28,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:37:28,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:37:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:37:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:37:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:37:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:37:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:37:28,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:37:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:37:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:37:28,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,684 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 09:37:28,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:37:28,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301356049] [2024-11-10 09:37:28,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301356049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:37:28,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:37:28,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:37:28,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202318867] [2024-11-10 09:37:28,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:37:28,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:37:28,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:37:28,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:37:28,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:37:28,687 INFO L87 Difference]: Start difference. First operand 98 states and 136 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 09:37:28,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:37:28,718 INFO L93 Difference]: Finished difference Result 196 states and 273 transitions. [2024-11-10 09:37:28,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:37:28,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 152 [2024-11-10 09:37:28,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:37:28,722 INFO L225 Difference]: With dead ends: 196 [2024-11-10 09:37:28,722 INFO L226 Difference]: Without dead ends: 101 [2024-11-10 09:37:28,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:37:28,726 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:37:28,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 377 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:37:28,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-10 09:37:28,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-11-10 09:37:28,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 78 states have (on average 1.2564102564102564) internal successors, (98), 78 states have internal predecessors, (98), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 09:37:28,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 138 transitions. [2024-11-10 09:37:28,736 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 138 transitions. Word has length 152 [2024-11-10 09:37:28,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:37:28,737 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 138 transitions. [2024-11-10 09:37:28,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 09:37:28,737 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 138 transitions. [2024-11-10 09:37:28,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-10 09:37:28,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:37:28,739 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:37:28,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 09:37:28,739 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:37:28,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:37:28,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1634206020, now seen corresponding path program 1 times [2024-11-10 09:37:28,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:37:28,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998976328] [2024-11-10 09:37:28,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:37:28,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:37:28,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:37:28,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:37:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:37:28,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:37:28,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:37:28,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:37:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:37:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:37:28,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:37:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:37:28,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:37:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:37:28,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:37:28,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:37:28,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:37:28,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:37:28,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:37:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:37:28,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:37:28,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:37:28,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:28,895 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 09:37:28,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:37:28,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998976328] [2024-11-10 09:37:28,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998976328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:37:28,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:37:28,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:37:28,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576548716] [2024-11-10 09:37:28,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:37:28,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:37:28,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:37:28,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:37:28,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:37:28,898 INFO L87 Difference]: Start difference. First operand 100 states and 138 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 09:37:28,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:37:28,923 INFO L93 Difference]: Finished difference Result 200 states and 277 transitions. [2024-11-10 09:37:28,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:37:28,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 152 [2024-11-10 09:37:28,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:37:28,925 INFO L225 Difference]: With dead ends: 200 [2024-11-10 09:37:28,926 INFO L226 Difference]: Without dead ends: 103 [2024-11-10 09:37:28,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:37:28,927 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:37:28,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 379 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:37:28,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-10 09:37:28,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2024-11-10 09:37:28,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 80 states have (on average 1.25) internal successors, (100), 80 states have internal predecessors, (100), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 09:37:28,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 140 transitions. [2024-11-10 09:37:28,933 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 140 transitions. Word has length 152 [2024-11-10 09:37:28,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:37:28,934 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 140 transitions. [2024-11-10 09:37:28,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 09:37:28,934 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 140 transitions. [2024-11-10 09:37:28,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-10 09:37:28,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:37:28,949 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:37:28,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 09:37:28,949 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:37:28,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:37:28,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1662835171, now seen corresponding path program 1 times [2024-11-10 09:37:28,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:37:28,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658334866] [2024-11-10 09:37:28,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:37:28,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:37:29,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:29,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:37:29,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:29,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:37:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:29,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:37:29,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:29,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:37:29,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:29,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:37:29,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:29,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:37:29,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:29,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:37:29,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:29,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:37:29,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:29,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:37:29,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:29,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:37:29,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:29,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:37:29,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:29,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:37:29,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:29,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:37:29,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:29,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:37:29,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:29,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:37:29,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:29,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:37:29,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:29,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:37:29,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:29,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:37:29,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:29,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:37:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:29,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:37:29,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:29,291 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 09:37:29,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:37:29,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658334866] [2024-11-10 09:37:29,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658334866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:37:29,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:37:29,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 09:37:29,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598039495] [2024-11-10 09:37:29,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:37:29,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 09:37:29,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:37:29,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 09:37:29,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:37:29,295 INFO L87 Difference]: Start difference. First operand 102 states and 140 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 09:37:29,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:37:29,346 INFO L93 Difference]: Finished difference Result 201 states and 277 transitions. [2024-11-10 09:37:29,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 09:37:29,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 152 [2024-11-10 09:37:29,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:37:29,350 INFO L225 Difference]: With dead ends: 201 [2024-11-10 09:37:29,350 INFO L226 Difference]: Without dead ends: 102 [2024-11-10 09:37:29,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:37:29,351 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:37:29,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 240 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:37:29,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-10 09:37:29,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-10 09:37:29,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 80 states have (on average 1.2375) internal successors, (99), 80 states have internal predecessors, (99), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 09:37:29,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 139 transitions. [2024-11-10 09:37:29,368 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 139 transitions. Word has length 152 [2024-11-10 09:37:29,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:37:29,369 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 139 transitions. [2024-11-10 09:37:29,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 09:37:29,372 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 139 transitions. [2024-11-10 09:37:29,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-10 09:37:29,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:37:29,373 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:37:29,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 09:37:29,374 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:37:29,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:37:29,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1278822428, now seen corresponding path program 1 times [2024-11-10 09:37:29,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:37:29,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234614247] [2024-11-10 09:37:29,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:37:29,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:37:29,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:29,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:37:29,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:29,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:37:29,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:29,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:37:29,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:29,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:37:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:29,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:37:29,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:29,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:37:29,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:29,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:37:29,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:29,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:37:29,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:29,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:37:29,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:29,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:37:29,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:29,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:37:29,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:29,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:37:29,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:29,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:37:29,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:29,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:37:29,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:29,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:37:29,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:29,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:37:29,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:29,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:37:29,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:29,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:37:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:29,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:37:29,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:29,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:37:29,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:29,730 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 09:37:29,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:37:29,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234614247] [2024-11-10 09:37:29,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234614247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:37:29,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:37:29,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 09:37:29,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748215127] [2024-11-10 09:37:29,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:37:29,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 09:37:29,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:37:29,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 09:37:29,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:37:29,734 INFO L87 Difference]: Start difference. First operand 102 states and 139 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 09:37:29,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:37:29,746 INFO L93 Difference]: Finished difference Result 201 states and 275 transitions. [2024-11-10 09:37:29,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 09:37:29,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 152 [2024-11-10 09:37:29,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:37:29,748 INFO L225 Difference]: With dead ends: 201 [2024-11-10 09:37:29,748 INFO L226 Difference]: Without dead ends: 102 [2024-11-10 09:37:29,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:37:29,750 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 255 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-11-10 09:37:29,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 255 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:37:29,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-10 09:37:29,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-10 09:37:29,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 80 states have (on average 1.225) internal successors, (98), 80 states have internal predecessors, (98), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 09:37:29,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 138 transitions. [2024-11-10 09:37:29,759 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 138 transitions. Word has length 152 [2024-11-10 09:37:29,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:37:29,759 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 138 transitions. [2024-11-10 09:37:29,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 09:37:29,760 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 138 transitions. [2024-11-10 09:37:29,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-10 09:37:29,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:37:29,762 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:37:29,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 09:37:29,762 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:37:29,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:37:29,763 INFO L85 PathProgramCache]: Analyzing trace with hash -2017051774, now seen corresponding path program 1 times [2024-11-10 09:37:29,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:37:29,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556725823] [2024-11-10 09:37:29,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:37:29,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:37:29,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:30,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:37:30,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:30,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:37:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:30,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:37:30,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:30,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:37:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:30,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:37:30,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:30,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:37:30,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:30,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:37:30,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:30,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:37:30,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:30,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:37:30,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:30,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:37:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:30,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:37:30,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:30,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:37:30,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:30,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:37:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:30,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:37:30,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:30,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:37:30,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:30,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:37:30,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:30,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:37:30,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:30,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:37:30,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:30,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:37:30,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:30,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:37:30,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:30,088 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 09:37:30,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:37:30,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556725823] [2024-11-10 09:37:30,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556725823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:37:30,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:37:30,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 09:37:30,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414626443] [2024-11-10 09:37:30,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:37:30,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 09:37:30,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:37:30,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 09:37:30,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:37:30,091 INFO L87 Difference]: Start difference. First operand 102 states and 138 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 09:37:30,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:37:30,134 INFO L93 Difference]: Finished difference Result 201 states and 273 transitions. [2024-11-10 09:37:30,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 09:37:30,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 154 [2024-11-10 09:37:30,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:37:30,136 INFO L225 Difference]: With dead ends: 201 [2024-11-10 09:37:30,137 INFO L226 Difference]: Without dead ends: 102 [2024-11-10 09:37:30,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:37:30,139 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:37:30,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 237 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:37:30,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-10 09:37:30,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-10 09:37:30,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 80 states have (on average 1.2125) internal successors, (97), 80 states have internal predecessors, (97), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 09:37:30,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 137 transitions. [2024-11-10 09:37:30,150 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 137 transitions. Word has length 154 [2024-11-10 09:37:30,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:37:30,150 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 137 transitions. [2024-11-10 09:37:30,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 09:37:30,151 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 137 transitions. [2024-11-10 09:37:30,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-10 09:37:30,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:37:30,152 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:37:30,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 09:37:30,152 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:37:30,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:37:30,153 INFO L85 PathProgramCache]: Analyzing trace with hash 239859233, now seen corresponding path program 1 times [2024-11-10 09:37:30,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:37:30,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233585797] [2024-11-10 09:37:30,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:37:30,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:37:30,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:31,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:37:31,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:31,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:37:31,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:31,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:37:31,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:31,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:37:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:31,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:37:31,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:31,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:37:31,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:31,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:37:31,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:31,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:37:31,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:31,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:37:31,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:31,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:37:31,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:31,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:37:31,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:31,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:37:31,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:31,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:37:31,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:31,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:37:31,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:31,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:37:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:31,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:37:31,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:31,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:37:31,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:31,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:37:31,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:31,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:37:31,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:31,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:37:31,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:31,599 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 09:37:31,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:37:31,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233585797] [2024-11-10 09:37:31,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233585797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:37:31,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:37:31,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 09:37:31,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122680382] [2024-11-10 09:37:31,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:37:31,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 09:37:31,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:37:31,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 09:37:31,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:37:31,602 INFO L87 Difference]: Start difference. First operand 102 states and 137 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 09:37:32,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:37:32,141 INFO L93 Difference]: Finished difference Result 359 states and 488 transitions. [2024-11-10 09:37:32,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 09:37:32,142 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 154 [2024-11-10 09:37:32,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:37:32,144 INFO L225 Difference]: With dead ends: 359 [2024-11-10 09:37:32,145 INFO L226 Difference]: Without dead ends: 260 [2024-11-10 09:37:32,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-11-10 09:37:32,147 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 188 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 09:37:32,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 1065 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 09:37:32,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-10 09:37:32,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 194. [2024-11-10 09:37:32,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 151 states have (on average 1.205298013245033) internal successors, (182), 151 states have internal predecessors, (182), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-10 09:37:32,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 262 transitions. [2024-11-10 09:37:32,174 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 262 transitions. Word has length 154 [2024-11-10 09:37:32,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:37:32,174 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 262 transitions. [2024-11-10 09:37:32,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 09:37:32,175 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 262 transitions. [2024-11-10 09:37:32,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-10 09:37:32,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:37:32,177 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:37:32,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 09:37:32,177 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:37:32,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:37:32,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1542358439, now seen corresponding path program 1 times [2024-11-10 09:37:32,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:37:32,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151677613] [2024-11-10 09:37:32,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:37:32,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:37:32,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:32,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:37:32,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:32,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:37:32,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:32,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:37:32,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:32,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:37:32,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:32,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:37:32,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:32,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:37:32,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:32,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:37:32,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:32,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:37:32,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:32,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:37:32,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:32,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:37:32,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:32,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:37:32,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:32,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:37:32,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:32,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:37:32,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:32,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:37:32,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:32,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:37:32,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:32,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:37:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:32,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:37:32,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:32,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:37:32,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:32,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:37:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:32,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:37:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:32,415 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 09:37:32,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:37:32,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151677613] [2024-11-10 09:37:32,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151677613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:37:32,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:37:32,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:37:32,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026422714] [2024-11-10 09:37:32,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:37:32,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:37:32,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:37:32,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:37:32,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:37:32,418 INFO L87 Difference]: Start difference. First operand 194 states and 262 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 09:37:32,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:37:32,449 INFO L93 Difference]: Finished difference Result 391 states and 529 transitions. [2024-11-10 09:37:32,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:37:32,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 154 [2024-11-10 09:37:32,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:37:32,451 INFO L225 Difference]: With dead ends: 391 [2024-11-10 09:37:32,451 INFO L226 Difference]: Without dead ends: 200 [2024-11-10 09:37:32,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 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-11-10 09:37:32,452 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:37:32,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 487 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:37:32,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-10 09:37:32,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2024-11-10 09:37:32,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 157 states have (on average 1.197452229299363) internal successors, (188), 157 states have internal predecessors, (188), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-10 09:37:32,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 268 transitions. [2024-11-10 09:37:32,465 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 268 transitions. Word has length 154 [2024-11-10 09:37:32,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:37:32,466 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 268 transitions. [2024-11-10 09:37:32,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 09:37:32,466 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 268 transitions. [2024-11-10 09:37:32,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 09:37:32,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:37:32,468 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:37:32,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 09:37:32,468 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:37:32,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:37:32,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1054549921, now seen corresponding path program 1 times [2024-11-10 09:37:32,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:37:32,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964535468] [2024-11-10 09:37:32,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:37:32,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:37:32,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:33,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:37:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:33,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:37:33,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:33,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:37:33,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:33,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:37:33,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:33,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:37:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:33,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:37:33,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:33,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:37:33,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:33,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:37:33,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:33,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:37:33,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:33,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:37:33,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:33,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:37:33,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:33,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:37:33,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:33,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:37:33,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:33,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:37:33,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:33,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:37:33,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:33,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:37:33,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:33,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:37:33,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:33,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:37:33,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:33,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:37:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:33,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:37:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:33,559 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 09:37:33,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:37:33,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964535468] [2024-11-10 09:37:33,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964535468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:37:33,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:37:33,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 09:37:33,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696607286] [2024-11-10 09:37:33,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:37:33,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 09:37:33,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:37:33,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 09:37:33,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:37:33,561 INFO L87 Difference]: Start difference. First operand 200 states and 268 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 09:37:33,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:37:33,730 INFO L93 Difference]: Finished difference Result 369 states and 498 transitions. [2024-11-10 09:37:33,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 09:37:33,730 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 155 [2024-11-10 09:37:33,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:37:33,733 INFO L225 Difference]: With dead ends: 369 [2024-11-10 09:37:33,733 INFO L226 Difference]: Without dead ends: 267 [2024-11-10 09:37:33,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-11-10 09:37:33,735 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 122 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:37:33,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 1246 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:37:33,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-11-10 09:37:33,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 103. [2024-11-10 09:37:33,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 81 states have (on average 1.1975308641975309) internal successors, (97), 81 states have internal predecessors, (97), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 09:37:33,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 137 transitions. [2024-11-10 09:37:33,746 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 137 transitions. Word has length 155 [2024-11-10 09:37:33,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:37:33,749 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 137 transitions. [2024-11-10 09:37:33,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 09:37:33,749 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 137 transitions. [2024-11-10 09:37:33,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-10 09:37:33,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:37:33,751 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:37:33,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 09:37:33,752 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:37:33,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:37:33,752 INFO L85 PathProgramCache]: Analyzing trace with hash -2007127646, now seen corresponding path program 1 times [2024-11-10 09:37:33,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:37:33,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508531470] [2024-11-10 09:37:33,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:37:33,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:37:33,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:34,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:37:34,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:34,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:37:34,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:34,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:37:34,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:34,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:37:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:34,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:37:34,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:34,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:37:34,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:34,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:37:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:34,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:37:34,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:34,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:37:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:34,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:37:34,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:34,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:37:34,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:34,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:37:34,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:34,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:37:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:34,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:37:34,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:34,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:37:34,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:34,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:37:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:34,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:37:34,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:34,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:37:34,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:34,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:37:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:34,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:37:34,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:34,069 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 09:37:34,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:37:34,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508531470] [2024-11-10 09:37:34,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508531470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:37:34,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:37:34,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:37:34,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265072402] [2024-11-10 09:37:34,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:37:34,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:37:34,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:37:34,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:37:34,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:37:34,071 INFO L87 Difference]: Start difference. First operand 103 states and 137 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 09:37:34,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:37:34,129 INFO L93 Difference]: Finished difference Result 258 states and 338 transitions. [2024-11-10 09:37:34,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:37:34,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 156 [2024-11-10 09:37:34,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:37:34,134 INFO L225 Difference]: With dead ends: 258 [2024-11-10 09:37:34,134 INFO L226 Difference]: Without dead ends: 158 [2024-11-10 09:37:34,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:37:34,135 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 53 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:37:34,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 472 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:37:34,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-10 09:37:34,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 154. [2024-11-10 09:37:34,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 127 states have (on average 1.1968503937007875) internal successors, (152), 128 states have internal predecessors, (152), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 09:37:34,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 200 transitions. [2024-11-10 09:37:34,148 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 200 transitions. Word has length 156 [2024-11-10 09:37:34,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:37:34,149 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 200 transitions. [2024-11-10 09:37:34,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 09:37:34,149 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 200 transitions. [2024-11-10 09:37:34,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-10 09:37:34,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:37:34,151 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:37:34,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 09:37:34,152 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:37:34,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:37:34,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1197870800, now seen corresponding path program 1 times [2024-11-10 09:37:34,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:37:34,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758660035] [2024-11-10 09:37:34,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:37:34,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:37:34,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:34,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:37:34,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:34,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:37:34,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:34,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:37:34,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:34,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:37:34,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:34,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:37:34,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:34,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:37:34,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:34,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:37:34,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:34,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:37:34,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:34,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:37:34,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:34,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:37:34,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:34,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:37:34,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:34,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:37:34,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:34,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:37:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:34,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:37:34,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:34,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:37:34,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:34,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:37:34,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:34,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:37:34,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:34,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:37:34,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:34,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:37:34,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:34,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:37:34,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:34,534 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 09:37:34,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:37:34,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758660035] [2024-11-10 09:37:34,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758660035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:37:34,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:37:34,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:37:34,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895802546] [2024-11-10 09:37:34,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:37:34,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:37:34,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:37:34,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:37:34,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:37:34,536 INFO L87 Difference]: Start difference. First operand 154 states and 200 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 09:37:34,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:37:34,588 INFO L93 Difference]: Finished difference Result 305 states and 397 transitions. [2024-11-10 09:37:34,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:37:34,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 156 [2024-11-10 09:37:34,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:37:34,591 INFO L225 Difference]: With dead ends: 305 [2024-11-10 09:37:34,591 INFO L226 Difference]: Without dead ends: 154 [2024-11-10 09:37:34,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:37:34,592 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:37:34,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 350 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:37:34,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-10 09:37:34,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-11-10 09:37:34,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 127 states have (on average 1.1811023622047243) internal successors, (150), 128 states have internal predecessors, (150), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 09:37:34,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 198 transitions. [2024-11-10 09:37:34,602 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 198 transitions. Word has length 156 [2024-11-10 09:37:34,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:37:34,602 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 198 transitions. [2024-11-10 09:37:34,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 09:37:34,602 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 198 transitions. [2024-11-10 09:37:34,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-10 09:37:34,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:37:34,604 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:37:34,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 09:37:34,604 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:37:34,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:37:34,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1502661875, now seen corresponding path program 1 times [2024-11-10 09:37:34,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:37:34,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742378945] [2024-11-10 09:37:34,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:37:34,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:37:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:35,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:37:35,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:35,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:37:35,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:35,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:37:35,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:35,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:37:35,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:35,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:37:35,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:35,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:37:35,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:35,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:37:35,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:35,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:37:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:35,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:37:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:35,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:37:35,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:35,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:37:35,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:35,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:37:35,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:35,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:37:35,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:35,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:37:35,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:35,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:37:35,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:35,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:37:35,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:35,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:37:35,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:35,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:37:35,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:35,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:37:35,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:35,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:37:35,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:35,213 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 09:37:35,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:37:35,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742378945] [2024-11-10 09:37:35,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742378945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:37:35,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:37:35,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:37:35,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633978495] [2024-11-10 09:37:35,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:37:35,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:37:35,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:37:35,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:37:35,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:37:35,216 INFO L87 Difference]: Start difference. First operand 154 states and 198 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 09:37:35,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:37:35,310 INFO L93 Difference]: Finished difference Result 190 states and 241 transitions. [2024-11-10 09:37:35,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:37:35,310 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 158 [2024-11-10 09:37:35,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:37:35,312 INFO L225 Difference]: With dead ends: 190 [2024-11-10 09:37:35,312 INFO L226 Difference]: Without dead ends: 187 [2024-11-10 09:37:35,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:37:35,313 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 55 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:37:35,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 660 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:37:35,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-10 09:37:35,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2024-11-10 09:37:35,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 149 states have (on average 1.1543624161073827) internal successors, (172), 151 states have internal predecessors, (172), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 09:37:35,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 236 transitions. [2024-11-10 09:37:35,327 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 236 transitions. Word has length 158 [2024-11-10 09:37:35,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:37:35,328 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 236 transitions. [2024-11-10 09:37:35,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 09:37:35,328 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 236 transitions. [2024-11-10 09:37:35,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-10 09:37:35,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:37:35,330 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:37:35,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 09:37:35,330 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:37:35,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:37:35,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1531291026, now seen corresponding path program 1 times [2024-11-10 09:37:35,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:37:35,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563582278] [2024-11-10 09:37:35,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:37:35,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:37:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:37:36,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:37:36,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:37:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:37:36,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:37:36,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:37:36,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:37:36,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:37:36,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:37:36,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:37:36,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:37:36,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:37:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:37:36,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:37:36,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:37:36,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:37:36,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:37:36,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:37:36,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:37:36,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:37:36,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,089 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 09:37:36,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:37:36,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563582278] [2024-11-10 09:37:36,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563582278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:37:36,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:37:36,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:37:36,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53885658] [2024-11-10 09:37:36,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:37:36,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:37:36,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:37:36,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:37:36,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:37:36,092 INFO L87 Difference]: Start difference. First operand 186 states and 236 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 09:37:36,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:37:36,309 INFO L93 Difference]: Finished difference Result 491 states and 627 transitions. [2024-11-10 09:37:36,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:37:36,309 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 158 [2024-11-10 09:37:36,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:37:36,312 INFO L225 Difference]: With dead ends: 491 [2024-11-10 09:37:36,312 INFO L226 Difference]: Without dead ends: 330 [2024-11-10 09:37:36,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:37:36,315 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 145 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:37:36,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 699 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:37:36,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-11-10 09:37:36,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 311. [2024-11-10 09:37:36,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 238 states have (on average 1.1302521008403361) internal successors, (269), 240 states have internal predecessors, (269), 64 states have call successors, (64), 8 states have call predecessors, (64), 8 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-10 09:37:36,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 397 transitions. [2024-11-10 09:37:36,345 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 397 transitions. Word has length 158 [2024-11-10 09:37:36,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:37:36,345 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 397 transitions. [2024-11-10 09:37:36,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 09:37:36,346 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 397 transitions. [2024-11-10 09:37:36,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-10 09:37:36,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:37:36,347 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:37:36,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 09:37:36,348 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:37:36,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:37:36,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1020865935, now seen corresponding path program 1 times [2024-11-10 09:37:36,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:37:36,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334443882] [2024-11-10 09:37:36,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:37:36,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:37:36,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:37:36,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:37:36,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:37:36,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:37:36,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:37:36,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:37:36,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:37:36,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:37:36,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:37:36,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:37:36,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:37:36,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:37:36,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:37:36,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:37:36,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:37:36,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:37:36,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:37:36,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:37:36,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:37:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:37:36,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,647 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 09:37:36,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:37:36,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334443882] [2024-11-10 09:37:36,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334443882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:37:36,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:37:36,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:37:36,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294905079] [2024-11-10 09:37:36,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:37:36,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:37:36,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:37:36,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:37:36,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:37:36,652 INFO L87 Difference]: Start difference. First operand 311 states and 397 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 09:37:36,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:37:36,731 INFO L93 Difference]: Finished difference Result 592 states and 753 transitions. [2024-11-10 09:37:36,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:37:36,732 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 158 [2024-11-10 09:37:36,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:37:36,734 INFO L225 Difference]: With dead ends: 592 [2024-11-10 09:37:36,734 INFO L226 Difference]: Without dead ends: 334 [2024-11-10 09:37:36,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:37:36,736 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 111 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:37:36,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 696 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:37:36,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-11-10 09:37:36,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 311. [2024-11-10 09:37:36,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 238 states have (on average 1.1176470588235294) internal successors, (266), 240 states have internal predecessors, (266), 64 states have call successors, (64), 8 states have call predecessors, (64), 8 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-10 09:37:36,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 394 transitions. [2024-11-10 09:37:36,767 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 394 transitions. Word has length 158 [2024-11-10 09:37:36,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:37:36,767 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 394 transitions. [2024-11-10 09:37:36,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 09:37:36,768 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 394 transitions. [2024-11-10 09:37:36,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-10 09:37:36,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:37:36,769 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:37:36,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 09:37:36,770 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:37:36,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:37:36,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1217379440, now seen corresponding path program 1 times [2024-11-10 09:37:36,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:37:36,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933526670] [2024-11-10 09:37:36,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:37:36,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:37:36,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:37:36,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:37:36,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:37:36,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:37:36,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:37:36,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:37:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:37:36,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:37:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:37:36,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:36,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:37:36,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:37,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:37:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:37,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:37:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:37,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:37:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:37,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:37:37,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:37,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:37:37,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:37,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:37:37,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:37,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:37:37,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:37,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:37:37,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:37,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:37:37,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:37,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:37:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:37,027 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 09:37:37,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:37:37,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933526670] [2024-11-10 09:37:37,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933526670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:37:37,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:37:37,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:37:37,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590893933] [2024-11-10 09:37:37,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:37:37,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:37:37,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:37:37,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:37:37,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:37:37,030 INFO L87 Difference]: Start difference. First operand 311 states and 394 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 09:37:37,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:37:37,079 INFO L93 Difference]: Finished difference Result 578 states and 729 transitions. [2024-11-10 09:37:37,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:37:37,080 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 158 [2024-11-10 09:37:37,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:37:37,083 INFO L225 Difference]: With dead ends: 578 [2024-11-10 09:37:37,083 INFO L226 Difference]: Without dead ends: 320 [2024-11-10 09:37:37,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 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-11-10 09:37:37,085 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:37:37,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 480 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:37:37,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-11-10 09:37:37,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2024-11-10 09:37:37,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 247 states have (on average 1.1133603238866396) internal successors, (275), 249 states have internal predecessors, (275), 64 states have call successors, (64), 8 states have call predecessors, (64), 8 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-10 09:37:37,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 403 transitions. [2024-11-10 09:37:37,116 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 403 transitions. Word has length 158 [2024-11-10 09:37:37,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:37:37,117 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 403 transitions. [2024-11-10 09:37:37,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 09:37:37,117 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 403 transitions. [2024-11-10 09:37:37,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-10 09:37:37,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:37:37,119 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:37:37,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 09:37:37,120 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:37:37,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:37:37,120 INFO L85 PathProgramCache]: Analyzing trace with hash 609622179, now seen corresponding path program 1 times [2024-11-10 09:37:37,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:37:37,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795645586] [2024-11-10 09:37:37,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:37:37,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:37:37,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:38,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:37:38,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:38,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:37:38,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:38,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:37:38,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:38,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:37:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:38,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:37:38,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:38,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:37:38,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:38,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:37:38,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:38,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:37:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:38,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:37:38,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:38,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:37:38,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:38,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:37:38,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:38,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:37:38,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:38,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:37:38,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:38,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:37:38,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:38,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:37:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:38,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:37:38,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:38,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:37:38,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:38,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:37:38,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:38,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:37:38,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:38,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:37:38,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:38,087 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 09:37:38,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:37:38,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795645586] [2024-11-10 09:37:38,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795645586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:37:38,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:37:38,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 09:37:38,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046919856] [2024-11-10 09:37:38,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:37:38,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 09:37:38,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:37:38,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 09:37:38,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-10 09:37:38,089 INFO L87 Difference]: Start difference. First operand 320 states and 403 transitions. Second operand has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-10 09:37:38,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:37:38,653 INFO L93 Difference]: Finished difference Result 507 states and 634 transitions. [2024-11-10 09:37:38,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 09:37:38,654 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 159 [2024-11-10 09:37:38,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:37:38,656 INFO L225 Difference]: With dead ends: 507 [2024-11-10 09:37:38,656 INFO L226 Difference]: Without dead ends: 340 [2024-11-10 09:37:38,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2024-11-10 09:37:38,657 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 167 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 09:37:38,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 1049 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 09:37:38,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2024-11-10 09:37:38,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 333. [2024-11-10 09:37:38,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 255 states have (on average 1.1098039215686275) internal successors, (283), 257 states have internal predecessors, (283), 68 states have call successors, (68), 9 states have call predecessors, (68), 9 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-10 09:37:38,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 419 transitions. [2024-11-10 09:37:38,698 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 419 transitions. Word has length 159 [2024-11-10 09:37:38,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:37:38,698 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 419 transitions. [2024-11-10 09:37:38,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-10 09:37:38,699 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 419 transitions. [2024-11-10 09:37:38,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-10 09:37:38,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:37:38,700 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:37:38,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 09:37:38,701 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:37:38,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:37:38,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1447508176, now seen corresponding path program 1 times [2024-11-10 09:37:38,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:37:38,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784084165] [2024-11-10 09:37:38,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:37:38,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:37:38,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:38,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:37:38,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:38,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:37:38,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:38,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:37:38,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:38,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:37:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:38,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:37:38,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:38,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:37:38,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:38,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:37:38,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:38,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:37:38,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:38,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:37:38,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:38,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:37:38,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:38,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:37:38,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:38,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:37:38,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:38,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:37:38,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:38,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:37:38,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:38,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:37:38,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:38,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:37:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:38,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:37:38,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:38,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:37:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:38,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:37:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:38,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:37:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:38,963 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 09:37:38,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:37:38,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784084165] [2024-11-10 09:37:38,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784084165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:37:38,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:37:38,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:37:38,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205119311] [2024-11-10 09:37:38,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:37:38,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:37:38,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:37:38,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:37:38,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:37:38,966 INFO L87 Difference]: Start difference. First operand 333 states and 419 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 09:37:39,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:37:39,065 INFO L93 Difference]: Finished difference Result 520 states and 648 transitions. [2024-11-10 09:37:39,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:37:39,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 159 [2024-11-10 09:37:39,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:37:39,070 INFO L225 Difference]: With dead ends: 520 [2024-11-10 09:37:39,070 INFO L226 Difference]: Without dead ends: 340 [2024-11-10 09:37:39,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:37:39,071 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 58 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:37:39,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 631 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:37:39,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2024-11-10 09:37:39,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 284. [2024-11-10 09:37:39,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 215 states have (on average 1.1023255813953488) internal successors, (237), 216 states have internal predecessors, (237), 60 states have call successors, (60), 8 states have call predecessors, (60), 8 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-10 09:37:39,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 357 transitions. [2024-11-10 09:37:39,106 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 357 transitions. Word has length 159 [2024-11-10 09:37:39,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:37:39,106 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 357 transitions. [2024-11-10 09:37:39,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 09:37:39,107 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 357 transitions. [2024-11-10 09:37:39,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-10 09:37:39,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:37:39,108 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:37:39,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 09:37:39,108 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:37:39,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:37:39,109 INFO L85 PathProgramCache]: Analyzing trace with hash 708126734, now seen corresponding path program 1 times [2024-11-10 09:37:39,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:37:39,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977267696] [2024-11-10 09:37:39,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:37:39,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:37:39,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 09:37:39,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [728634463] [2024-11-10 09:37:39,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:37:39,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:37:39,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:37:39,281 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 09:37:39,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 09:37:39,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:39,833 INFO L255 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-10 09:37:39,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:37:41,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 09:37:41,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 09:37:41,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-10 09:37:42,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2024-11-10 09:37:42,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2024-11-10 09:37:42,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2024-11-10 09:37:42,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2024-11-10 09:37:42,108 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 4 proven. 572 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-10 09:37:42,109 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:37:42,682 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 09:37:42,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:37:42,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977267696] [2024-11-10 09:37:42,683 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 09:37:42,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728634463] [2024-11-10 09:37:42,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728634463] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 09:37:42,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 09:37:42,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 16 [2024-11-10 09:37:42,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350159224] [2024-11-10 09:37:42,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:37:42,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:37:42,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:37:42,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:37:42,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2024-11-10 09:37:42,685 INFO L87 Difference]: Start difference. First operand 284 states and 357 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 09:37:43,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:37:43,362 INFO L93 Difference]: Finished difference Result 659 states and 804 transitions. [2024-11-10 09:37:43,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:37:43,364 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2024-11-10 09:37:43,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:37:43,366 INFO L225 Difference]: With dead ends: 659 [2024-11-10 09:37:43,366 INFO L226 Difference]: Without dead ends: 428 [2024-11-10 09:37:43,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2024-11-10 09:37:43,368 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 100 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 09:37:43,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 313 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 09:37:43,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2024-11-10 09:37:43,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 286. [2024-11-10 09:37:43,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 239 states have (on average 1.104602510460251) internal successors, (264), 239 states have internal predecessors, (264), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-10 09:37:43,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 344 transitions. [2024-11-10 09:37:43,395 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 344 transitions. Word has length 160 [2024-11-10 09:37:43,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:37:43,395 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 344 transitions. [2024-11-10 09:37:43,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 09:37:43,396 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 344 transitions. [2024-11-10 09:37:43,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-10 09:37:43,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:37:43,397 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:37:43,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 09:37:43,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:37:43,599 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:37:43,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:37:43,599 INFO L85 PathProgramCache]: Analyzing trace with hash 119377355, now seen corresponding path program 1 times [2024-11-10 09:37:43,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:37:43,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290326553] [2024-11-10 09:37:43,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:37:43,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:37:43,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:37:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:37:44,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:37:44,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:37:44,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:37:44,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:37:44,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:37:44,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:37:44,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:37:44,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:37:44,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:37:44,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:37:44,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:37:44,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:37:44,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:37:44,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:37:44,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:37:44,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:37:44,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:37:44,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:37:44,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,182 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 09:37:44,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:37:44,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290326553] [2024-11-10 09:37:44,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290326553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:37:44,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:37:44,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:37:44,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634561635] [2024-11-10 09:37:44,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:37:44,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:37:44,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:37:44,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:37:44,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:37:44,185 INFO L87 Difference]: Start difference. First operand 286 states and 344 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 09:37:44,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:37:44,303 INFO L93 Difference]: Finished difference Result 526 states and 640 transitions. [2024-11-10 09:37:44,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:37:44,304 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 161 [2024-11-10 09:37:44,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:37:44,306 INFO L225 Difference]: With dead ends: 526 [2024-11-10 09:37:44,306 INFO L226 Difference]: Without dead ends: 359 [2024-11-10 09:37:44,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:37:44,307 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 104 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:37:44,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 647 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:37:44,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-11-10 09:37:44,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 170. [2024-11-10 09:37:44,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 146 states have (on average 1.1164383561643836) internal successors, (163), 146 states have internal predecessors, (163), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 09:37:44,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 203 transitions. [2024-11-10 09:37:44,327 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 203 transitions. Word has length 161 [2024-11-10 09:37:44,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:37:44,327 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 203 transitions. [2024-11-10 09:37:44,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 09:37:44,328 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 203 transitions. [2024-11-10 09:37:44,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-10 09:37:44,329 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:37:44,329 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:37:44,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 09:37:44,329 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:37:44,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:37:44,330 INFO L85 PathProgramCache]: Analyzing trace with hash -419016669, now seen corresponding path program 1 times [2024-11-10 09:37:44,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:37:44,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841908198] [2024-11-10 09:37:44,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:37:44,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:37:44,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:37:44,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:37:44,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:37:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:37:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:37:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:37:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:37:44,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:37:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:37:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:37:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:37:44,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:37:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:37:44,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:37:44,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:37:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:37:44,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:37:44,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:37:44,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:37:44,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:37:44,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,564 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 09:37:44,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:37:44,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841908198] [2024-11-10 09:37:44,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841908198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:37:44,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:37:44,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:37:44,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645034414] [2024-11-10 09:37:44,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:37:44,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:37:44,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:37:44,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:37:44,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:37:44,568 INFO L87 Difference]: Start difference. First operand 170 states and 203 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 09:37:44,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:37:44,667 INFO L93 Difference]: Finished difference Result 405 states and 478 transitions. [2024-11-10 09:37:44,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:37:44,667 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 161 [2024-11-10 09:37:44,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:37:44,669 INFO L225 Difference]: With dead ends: 405 [2024-11-10 09:37:44,669 INFO L226 Difference]: Without dead ends: 238 [2024-11-10 09:37:44,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:37:44,670 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 47 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:37:44,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 716 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:37:44,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-10 09:37:44,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 200. [2024-11-10 09:37:44,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 176 states have (on average 1.1079545454545454) internal successors, (195), 176 states have internal predecessors, (195), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 09:37:44,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 235 transitions. [2024-11-10 09:37:44,688 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 235 transitions. Word has length 161 [2024-11-10 09:37:44,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:37:44,689 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 235 transitions. [2024-11-10 09:37:44,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 09:37:44,689 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 235 transitions. [2024-11-10 09:37:44,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-10 09:37:44,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:37:44,690 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:37:44,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 09:37:44,691 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:37:44,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:37:44,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1238161442, now seen corresponding path program 1 times [2024-11-10 09:37:44,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:37:44,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464197305] [2024-11-10 09:37:44,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:37:44,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:37:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:37:44,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:37:44,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:37:44,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:37:44,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:37:44,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:37:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:37:44,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:37:44,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:37:44,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:37:44,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:37:44,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:37:44,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:37:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:37:44,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:37:44,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:37:44,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:37:44,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:37:44,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:37:44,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:37:44,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:44,988 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 09:37:44,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:37:44,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464197305] [2024-11-10 09:37:44,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464197305] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:37:44,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:37:44,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:37:44,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780604210] [2024-11-10 09:37:44,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:37:44,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:37:44,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:37:44,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:37:44,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:37:44,990 INFO L87 Difference]: Start difference. First operand 200 states and 235 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 09:37:45,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:37:45,217 INFO L93 Difference]: Finished difference Result 619 states and 724 transitions. [2024-11-10 09:37:45,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:37:45,218 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 162 [2024-11-10 09:37:45,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:37:45,221 INFO L225 Difference]: With dead ends: 619 [2024-11-10 09:37:45,221 INFO L226 Difference]: Without dead ends: 422 [2024-11-10 09:37:45,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:37:45,224 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 224 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:37:45,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 419 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:37:45,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2024-11-10 09:37:45,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 350. [2024-11-10 09:37:45,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 303 states have (on average 1.0957095709570956) internal successors, (332), 303 states have internal predecessors, (332), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-10 09:37:45,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 412 transitions. [2024-11-10 09:37:45,258 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 412 transitions. Word has length 162 [2024-11-10 09:37:45,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:37:45,259 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 412 transitions. [2024-11-10 09:37:45,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 09:37:45,259 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 412 transitions. [2024-11-10 09:37:45,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-10 09:37:45,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:37:45,260 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:37:45,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 09:37:45,261 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:37:45,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:37:45,261 INFO L85 PathProgramCache]: Analyzing trace with hash 407794212, now seen corresponding path program 1 times [2024-11-10 09:37:45,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:37:45,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641195906] [2024-11-10 09:37:45,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:37:45,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:37:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:45,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:37:45,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:46,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:37:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:46,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:37:46,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:46,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:37:46,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:46,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:37:46,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:46,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:37:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:46,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:37:46,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:46,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:37:46,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:46,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:37:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:46,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:37:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:46,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:37:46,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:46,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:37:46,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:46,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:37:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:46,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:37:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:46,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:37:46,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:46,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:37:46,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:46,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:37:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:46,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:37:46,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:46,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:37:46,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:46,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:37:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:46,039 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 09:37:46,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:37:46,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641195906] [2024-11-10 09:37:46,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641195906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:37:46,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:37:46,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 09:37:46,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219740524] [2024-11-10 09:37:46,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:37:46,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 09:37:46,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:37:46,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 09:37:46,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-10 09:37:46,042 INFO L87 Difference]: Start difference. First operand 350 states and 412 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-10 09:37:46,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:37:46,522 INFO L93 Difference]: Finished difference Result 789 states and 927 transitions. [2024-11-10 09:37:46,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 09:37:46,523 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 162 [2024-11-10 09:37:46,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:37:46,526 INFO L225 Difference]: With dead ends: 789 [2024-11-10 09:37:46,526 INFO L226 Difference]: Without dead ends: 442 [2024-11-10 09:37:46,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2024-11-10 09:37:46,528 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 223 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 09:37:46,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 1127 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 09:37:46,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2024-11-10 09:37:46,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 327. [2024-11-10 09:37:46,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 280 states have (on average 1.0892857142857142) internal successors, (305), 280 states have internal predecessors, (305), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-10 09:37:46,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 385 transitions. [2024-11-10 09:37:46,563 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 385 transitions. Word has length 162 [2024-11-10 09:37:46,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:37:46,564 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 385 transitions. [2024-11-10 09:37:46,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-10 09:37:46,564 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 385 transitions. [2024-11-10 09:37:46,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-10 09:37:46,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:37:46,566 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:37:46,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-10 09:37:46,566 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:37:46,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:37:46,567 INFO L85 PathProgramCache]: Analyzing trace with hash 396610187, now seen corresponding path program 1 times [2024-11-10 09:37:46,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:37:46,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144133301] [2024-11-10 09:37:46,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:37:46,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:37:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:46,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:37:46,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:46,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:37:46,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:46,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:37:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:46,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:37:46,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:46,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:37:46,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:46,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:37:46,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:46,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:37:46,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:46,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:37:46,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:46,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:37:46,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:46,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:37:46,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:46,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:37:46,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:46,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:37:46,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:46,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:37:46,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:46,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:37:46,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:46,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:37:46,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:46,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:37:46,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:46,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:37:46,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:46,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:37:46,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:46,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:37:46,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:46,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:37:46,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:46,963 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 09:37:46,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:37:46,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144133301] [2024-11-10 09:37:46,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144133301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:37:46,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:37:46,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:37:46,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867667975] [2024-11-10 09:37:46,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:37:46,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:37:46,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:37:46,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:37:46,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:37:46,965 INFO L87 Difference]: Start difference. First operand 327 states and 385 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 09:37:47,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:37:47,153 INFO L93 Difference]: Finished difference Result 697 states and 820 transitions. [2024-11-10 09:37:47,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:37:47,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 162 [2024-11-10 09:37:47,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:37:47,157 INFO L225 Difference]: With dead ends: 697 [2024-11-10 09:37:47,157 INFO L226 Difference]: Without dead ends: 510 [2024-11-10 09:37:47,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:37:47,159 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 83 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:37:47,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 529 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:37:47,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2024-11-10 09:37:47,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 505. [2024-11-10 09:37:47,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 420 states have (on average 1.0738095238095238) internal successors, (451), 422 states have internal predecessors, (451), 72 states have call successors, (72), 12 states have call predecessors, (72), 12 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-10 09:37:47,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 595 transitions. [2024-11-10 09:37:47,219 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 595 transitions. Word has length 162 [2024-11-10 09:37:47,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:37:47,219 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 595 transitions. [2024-11-10 09:37:47,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 09:37:47,219 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 595 transitions. [2024-11-10 09:37:47,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-10 09:37:47,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:37:47,221 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:37:47,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-10 09:37:47,221 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:37:47,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:37:47,222 INFO L85 PathProgramCache]: Analyzing trace with hash -108948438, now seen corresponding path program 1 times [2024-11-10 09:37:47,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:37:47,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728216334] [2024-11-10 09:37:47,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:37:47,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:37:47,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:49,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:37:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:49,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:37:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:49,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:37:49,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:49,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:37:49,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:49,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:37:49,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:49,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:37:49,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:49,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:37:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:49,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:37:49,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:49,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:37:49,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:49,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:37:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:49,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:37:49,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:49,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:37:49,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:49,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:37:49,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:49,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:37:49,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:49,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:37:49,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:49,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:37:49,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:49,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:37:49,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:49,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:37:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:49,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:37:49,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:49,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:37:49,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:49,831 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 09:37:49,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:37:49,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728216334] [2024-11-10 09:37:49,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728216334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:37:49,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:37:49,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-10 09:37:49,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146695251] [2024-11-10 09:37:49,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:37:49,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-10 09:37:49,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:37:49,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-10 09:37:49,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2024-11-10 09:37:49,834 INFO L87 Difference]: Start difference. First operand 505 states and 595 transitions. Second operand has 17 states, 16 states have (on average 4.0625) internal successors, (65), 17 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-10 09:37:52,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:37:52,041 INFO L93 Difference]: Finished difference Result 1101 states and 1301 transitions. [2024-11-10 09:37:52,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-10 09:37:52,042 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.0625) internal successors, (65), 17 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 162 [2024-11-10 09:37:52,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:37:52,046 INFO L225 Difference]: With dead ends: 1101 [2024-11-10 09:37:52,046 INFO L226 Difference]: Without dead ends: 797 [2024-11-10 09:37:52,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=152, Invalid=840, Unknown=0, NotChecked=0, Total=992 [2024-11-10 09:37:52,048 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 176 mSDsluCounter, 1212 mSDsCounter, 0 mSdLazyCounter, 1074 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 1369 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-10 09:37:52,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 1369 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1074 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-10 09:37:52,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2024-11-10 09:37:52,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 787. [2024-11-10 09:37:52,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 636 states have (on average 1.0644654088050314) internal successors, (677), 639 states have internal predecessors, (677), 128 states have call successors, (128), 22 states have call predecessors, (128), 22 states have return successors, (128), 125 states have call predecessors, (128), 128 states have call successors, (128) [2024-11-10 09:37:52,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 933 transitions. [2024-11-10 09:37:52,157 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 933 transitions. Word has length 162 [2024-11-10 09:37:52,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:37:52,157 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 933 transitions. [2024-11-10 09:37:52,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.0625) internal successors, (65), 17 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-10 09:37:52,158 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 933 transitions. [2024-11-10 09:37:52,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-10 09:37:52,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:37:52,159 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:37:52,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-10 09:37:52,160 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:37:52,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:37:52,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1888253268, now seen corresponding path program 1 times [2024-11-10 09:37:52,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:37:52,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978701307] [2024-11-10 09:37:52,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:37:52,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:37:52,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:53,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:37:53,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:53,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:37:53,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:53,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:37:53,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:53,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:37:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:53,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:37:53,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:53,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:37:53,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:53,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:37:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:53,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:37:53,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:53,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:37:53,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:53,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:37:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:53,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:37:53,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:53,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:37:53,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:53,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:37:53,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:53,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:37:53,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:53,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:37:53,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:53,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:37:53,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:53,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:37:53,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:53,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:37:53,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:53,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:37:53,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:53,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:37:53,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:53,659 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 09:37:53,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:37:53,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978701307] [2024-11-10 09:37:53,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978701307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:37:53,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:37:53,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 09:37:53,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821301638] [2024-11-10 09:37:53,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:37:53,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 09:37:53,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:37:53,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 09:37:53,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-10 09:37:53,661 INFO L87 Difference]: Start difference. First operand 787 states and 933 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 09:37:54,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:37:54,739 INFO L93 Difference]: Finished difference Result 1353 states and 1600 transitions. [2024-11-10 09:37:54,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 09:37:54,739 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 162 [2024-11-10 09:37:54,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:37:54,745 INFO L225 Difference]: With dead ends: 1353 [2024-11-10 09:37:54,745 INFO L226 Difference]: Without dead ends: 853 [2024-11-10 09:37:54,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2024-11-10 09:37:54,747 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 133 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1338 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 09:37:54,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1338 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 09:37:54,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2024-11-10 09:37:54,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 839. [2024-11-10 09:37:54,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 672 states have (on average 1.0610119047619047) internal successors, (713), 676 states have internal predecessors, (713), 141 states have call successors, (141), 25 states have call predecessors, (141), 25 states have return successors, (141), 137 states have call predecessors, (141), 141 states have call successors, (141) [2024-11-10 09:37:54,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 995 transitions. [2024-11-10 09:37:54,867 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 995 transitions. Word has length 162 [2024-11-10 09:37:54,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:37:54,868 INFO L471 AbstractCegarLoop]: Abstraction has 839 states and 995 transitions. [2024-11-10 09:37:54,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 09:37:54,868 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 995 transitions. [2024-11-10 09:37:54,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-10 09:37:54,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:37:54,870 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:37:54,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-10 09:37:54,871 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:37:54,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:37:54,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1901155403, now seen corresponding path program 1 times [2024-11-10 09:37:54,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:37:54,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808515034] [2024-11-10 09:37:54,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:37:54,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:37:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:55,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:37:55,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:55,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:37:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:55,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:37:55,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:55,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:37:55,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:55,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:37:55,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:55,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:37:55,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:55,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:37:55,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:55,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:37:55,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:55,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:37:55,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:55,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:37:55,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:55,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:37:55,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:55,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:37:55,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:55,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:37:55,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:55,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:37:55,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:55,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:37:55,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:55,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:37:55,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:55,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:37:55,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:55,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:37:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:55,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:37:55,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:55,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:37:55,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:55,181 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 09:37:55,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:37:55,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808515034] [2024-11-10 09:37:55,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808515034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:37:55,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:37:55,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:37:55,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121836680] [2024-11-10 09:37:55,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:37:55,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:37:55,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:37:55,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:37:55,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:37:55,184 INFO L87 Difference]: Start difference. First operand 839 states and 995 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 09:37:55,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:37:55,478 INFO L93 Difference]: Finished difference Result 1452 states and 1718 transitions. [2024-11-10 09:37:55,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:37:55,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 162 [2024-11-10 09:37:55,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:37:55,484 INFO L225 Difference]: With dead ends: 1452 [2024-11-10 09:37:55,485 INFO L226 Difference]: Without dead ends: 900 [2024-11-10 09:37:55,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:37:55,487 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 81 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:37:55,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 716 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:37:55,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2024-11-10 09:37:55,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 765. [2024-11-10 09:37:55,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 614 states have (on average 1.0570032573289903) internal successors, (649), 617 states have internal predecessors, (649), 128 states have call successors, (128), 22 states have call predecessors, (128), 22 states have return successors, (128), 125 states have call predecessors, (128), 128 states have call successors, (128) [2024-11-10 09:37:55,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 905 transitions. [2024-11-10 09:37:55,590 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 905 transitions. Word has length 162 [2024-11-10 09:37:55,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:37:55,591 INFO L471 AbstractCegarLoop]: Abstraction has 765 states and 905 transitions. [2024-11-10 09:37:55,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 09:37:55,591 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 905 transitions. [2024-11-10 09:37:55,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-10 09:37:55,593 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:37:55,593 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:37:55,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-10 09:37:55,593 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:37:55,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:37:55,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1165914269, now seen corresponding path program 1 times [2024-11-10 09:37:55,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:37:55,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328931808] [2024-11-10 09:37:55,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:37:55,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:37:55,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:57,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:37:57,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:57,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:37:57,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:57,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:37:57,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:57,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:37:57,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:57,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:37:57,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:57,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:37:57,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:57,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:37:57,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:57,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:37:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:57,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:37:57,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:57,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:37:57,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:57,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:37:57,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:57,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:37:57,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:57,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:37:57,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:57,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:37:57,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:57,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:37:57,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:57,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:37:57,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:57,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:37:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:57,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:37:57,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:57,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:37:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:57,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:37:57,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:37:57,875 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 09:37:57,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:37:57,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328931808] [2024-11-10 09:37:57,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328931808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:37:57,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:37:57,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-10 09:37:57,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50786504] [2024-11-10 09:37:57,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:37:57,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-10 09:37:57,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:37:57,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-10 09:37:57,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2024-11-10 09:37:57,878 INFO L87 Difference]: Start difference. First operand 765 states and 905 transitions. Second operand has 17 states, 16 states have (on average 4.25) internal successors, (68), 17 states have internal predecessors, (68), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-10 09:37:59,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:37:59,950 INFO L93 Difference]: Finished difference Result 1263 states and 1483 transitions. [2024-11-10 09:37:59,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-10 09:37:59,951 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.25) internal successors, (68), 17 states have internal predecessors, (68), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 165 [2024-11-10 09:37:59,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:37:59,957 INFO L225 Difference]: With dead ends: 1263 [2024-11-10 09:37:59,957 INFO L226 Difference]: Without dead ends: 970 [2024-11-10 09:37:59,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=198, Invalid=1062, Unknown=0, NotChecked=0, Total=1260 [2024-11-10 09:37:59,963 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 206 mSDsluCounter, 1606 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 1821 SdHoareTripleChecker+Invalid, 1390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-10 09:37:59,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 1821 Invalid, 1390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1343 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-10 09:37:59,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2024-11-10 09:38:00,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 822. [2024-11-10 09:38:00,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 655 states have (on average 1.0549618320610687) internal successors, (691), 659 states have internal predecessors, (691), 141 states have call successors, (141), 25 states have call predecessors, (141), 25 states have return successors, (141), 137 states have call predecessors, (141), 141 states have call successors, (141) [2024-11-10 09:38:00,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 973 transitions. [2024-11-10 09:38:00,117 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 973 transitions. Word has length 165 [2024-11-10 09:38:00,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:38:00,117 INFO L471 AbstractCegarLoop]: Abstraction has 822 states and 973 transitions. [2024-11-10 09:38:00,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.25) internal successors, (68), 17 states have internal predecessors, (68), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-10 09:38:00,118 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 973 transitions. [2024-11-10 09:38:00,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-10 09:38:00,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:38:00,119 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:38:00,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-10 09:38:00,120 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:38:00,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:38:00,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1685847643, now seen corresponding path program 1 times [2024-11-10 09:38:00,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:38:00,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951450196] [2024-11-10 09:38:00,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:38:00,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:38:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:09,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:38:09,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:09,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:38:09,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:09,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:38:09,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:09,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:38:09,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:09,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:38:09,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:09,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:38:09,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:09,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:38:09,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:09,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:38:09,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:09,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:38:09,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:09,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:38:09,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:09,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:38:09,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:09,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:38:09,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:09,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:38:09,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:09,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:38:09,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:09,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:38:09,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:09,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:38:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:09,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:38:09,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:09,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:38:09,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:09,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:38:09,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:09,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:38:09,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:09,584 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 09:38:09,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:38:09,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951450196] [2024-11-10 09:38:09,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951450196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:38:09,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:38:09,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-10 09:38:09,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401066997] [2024-11-10 09:38:09,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:38:09,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-10 09:38:09,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:38:09,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-10 09:38:09,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=264, Unknown=1, NotChecked=0, Total=306 [2024-11-10 09:38:09,587 INFO L87 Difference]: Start difference. First operand 822 states and 973 transitions. Second operand has 18 states, 17 states have (on average 4.0) internal successors, (68), 18 states have internal predecessors, (68), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-10 09:38:16,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:38:16,699 INFO L93 Difference]: Finished difference Result 1287 states and 1518 transitions. [2024-11-10 09:38:16,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 09:38:16,700 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.0) internal successors, (68), 18 states have internal predecessors, (68), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 165 [2024-11-10 09:38:16,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:38:16,705 INFO L225 Difference]: With dead ends: 1287 [2024-11-10 09:38:16,705 INFO L226 Difference]: Without dead ends: 937 [2024-11-10 09:38:16,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=151, Invalid=970, Unknown=1, NotChecked=0, Total=1122 [2024-11-10 09:38:16,707 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 178 mSDsluCounter, 1285 mSDsCounter, 0 mSdLazyCounter, 1107 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 1455 SdHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-10 09:38:16,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 1455 Invalid, 1162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1107 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-10 09:38:16,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2024-11-10 09:38:16,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 822. [2024-11-10 09:38:16,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 655 states have (on average 1.0549618320610687) internal successors, (691), 659 states have internal predecessors, (691), 141 states have call successors, (141), 25 states have call predecessors, (141), 25 states have return successors, (141), 137 states have call predecessors, (141), 141 states have call successors, (141) [2024-11-10 09:38:16,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 973 transitions. [2024-11-10 09:38:16,838 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 973 transitions. Word has length 165 [2024-11-10 09:38:16,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:38:16,839 INFO L471 AbstractCegarLoop]: Abstraction has 822 states and 973 transitions. [2024-11-10 09:38:16,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.0) internal successors, (68), 18 states have internal predecessors, (68), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-10 09:38:16,839 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 973 transitions. [2024-11-10 09:38:16,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2024-11-10 09:38:16,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:38:16,842 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:38:16,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-10 09:38:16,843 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:38:16,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:38:16,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1898102101, now seen corresponding path program 1 times [2024-11-10 09:38:16,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:38:16,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950653888] [2024-11-10 09:38:16,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:38:16,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:38:17,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:20,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:38:20,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:20,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:38:20,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:20,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:38:20,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:20,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:38:20,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:20,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:38:20,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:20,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:38:20,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:20,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:38:20,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:20,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:38:20,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:20,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:38:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:20,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:38:20,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:20,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:38:20,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:20,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:38:20,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:20,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:38:20,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:20,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:38:20,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:20,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:38:20,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:20,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:38:20,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:20,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:38:20,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:20,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:38:20,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:20,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:38:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:20,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:38:20,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:20,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-10 09:38:20,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:20,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-10 09:38:20,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:20,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-10 09:38:20,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:20,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-10 09:38:20,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:20,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-10 09:38:20,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:20,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-10 09:38:20,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:20,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-10 09:38:20,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:20,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-10 09:38:20,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:20,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-11-10 09:38:20,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:20,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-11-10 09:38:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:20,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-11-10 09:38:20,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:20,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-11-10 09:38:20,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:20,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-11-10 09:38:20,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:20,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-10 09:38:20,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:20,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-11-10 09:38:20,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:20,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-10 09:38:20,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:20,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2024-11-10 09:38:20,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:20,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-11-10 09:38:20,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:20,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-11-10 09:38:20,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:20,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-11-10 09:38:20,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:20,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3193 backedges. 14 proven. 59 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-11-10 09:38:20,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:38:20,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950653888] [2024-11-10 09:38:20,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950653888] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:38:20,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715627229] [2024-11-10 09:38:20,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:38:20,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:38:20,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:38:20,565 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 09:38:20,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 09:38:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:38:21,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 1072 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-11-10 09:38:21,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:38:22,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 09:38:23,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-10 09:38:23,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 09:38:24,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 09:38:25,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 09:38:25,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2024-11-10 09:38:25,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 36 [2024-11-10 09:38:25,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2024-11-10 09:38:26,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 33 [2024-11-10 09:38:26,208 INFO L134 CoverageAnalysis]: Checked inductivity of 3193 backedges. 41 proven. 2393 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2024-11-10 09:38:26,208 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:38:26,960 INFO L134 CoverageAnalysis]: Checked inductivity of 3193 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 3167 trivial. 0 not checked. [2024-11-10 09:38:26,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715627229] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 09:38:26,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-10 09:38:26,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [16, 26] total 41 [2024-11-10 09:38:26,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575438637] [2024-11-10 09:38:26,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:38:26,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 09:38:26,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:38:26,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 09:38:26,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1521, Unknown=0, NotChecked=0, Total=1640 [2024-11-10 09:38:26,963 INFO L87 Difference]: Start difference. First operand 822 states and 973 transitions. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 09:38:28,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:38:28,066 INFO L93 Difference]: Finished difference Result 1278 states and 1507 transitions. [2024-11-10 09:38:28,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 09:38:28,067 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 319 [2024-11-10 09:38:28,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:38:28,069 INFO L225 Difference]: With dead ends: 1278 [2024-11-10 09:38:28,069 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 09:38:28,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 744 GetRequests, 696 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=147, Invalid=2015, Unknown=0, NotChecked=0, Total=2162 [2024-11-10 09:38:28,074 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 69 mSDsluCounter, 1112 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 09:38:28,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 1287 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 09:38:28,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 09:38:28,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 09:38:28,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 09:38:28,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 09:38:28,076 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 319 [2024-11-10 09:38:28,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:38:28,076 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 09:38:28,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 09:38:28,076 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 09:38:28,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 09:38:28,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 09:38:28,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 09:38:28,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-11-10 09:38:28,284 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:38:28,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.