./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-18.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-18.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 8167bb57c72da66729eaf4d0bfb99f298c96636d95817c5a55fbaebfee04d766 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:33:43,990 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:33:44,077 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 09:33:44,085 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:33:44,086 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:33:44,112 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:33:44,112 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:33:44,113 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:33:44,113 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:33:44,113 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:33:44,114 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:33:44,114 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:33:44,115 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:33:44,115 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:33:44,116 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:33:44,116 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:33:44,116 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:33:44,117 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:33:44,117 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 09:33:44,117 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:33:44,117 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:33:44,118 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:33:44,118 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:33:44,119 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:33:44,119 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:33:44,119 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:33:44,119 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:33:44,120 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:33:44,120 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:33:44,120 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:33:44,121 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:33:44,121 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:33:44,121 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:33:44,122 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:33:44,122 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:33:44,122 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:33:44,123 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 09:33:44,123 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 09:33:44,123 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:33:44,124 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:33:44,124 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:33:44,125 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:33:44,125 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 -> 8167bb57c72da66729eaf4d0bfb99f298c96636d95817c5a55fbaebfee04d766 [2024-11-10 09:33:44,380 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:33:44,407 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:33:44,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:33:44,410 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:33:44,411 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:33:44,412 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-18.i [2024-11-10 09:33:45,892 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:33:46,091 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:33:46,092 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-18.i [2024-11-10 09:33:46,102 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62f0e4582/fd0d1d685b7e4970b9aaa644e21d7af8/FLAG3861b0662 [2024-11-10 09:33:46,115 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62f0e4582/fd0d1d685b7e4970b9aaa644e21d7af8 [2024-11-10 09:33:46,117 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:33:46,119 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:33:46,120 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:33:46,120 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:33:46,124 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:33:46,125 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:33:46" (1/1) ... [2024-11-10 09:33:46,125 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69418d14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:33:46, skipping insertion in model container [2024-11-10 09:33:46,125 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:33:46" (1/1) ... [2024-11-10 09:33:46,153 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:33:46,330 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-18.i[916,929] [2024-11-10 09:33:46,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:33:46,396 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:33:46,406 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-18.i[916,929] [2024-11-10 09:33:46,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:33:46,461 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:33:46,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:33:46 WrapperNode [2024-11-10 09:33:46,463 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:33:46,464 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:33:46,465 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:33:46,465 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:33:46,472 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:33:46" (1/1) ... [2024-11-10 09:33:46,483 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:33:46" (1/1) ... [2024-11-10 09:33:46,526 INFO L138 Inliner]: procedures = 29, calls = 148, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 500 [2024-11-10 09:33:46,527 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:33:46,528 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:33:46,528 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:33:46,529 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:33:46,540 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:33:46" (1/1) ... [2024-11-10 09:33:46,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:33:46" (1/1) ... [2024-11-10 09:33:46,550 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:33:46" (1/1) ... [2024-11-10 09:33:46,584 INFO L175 MemorySlicer]: Split 115 memory accesses to 11 slices as follows [2, 5, 14, 8, 12, 12, 26, 12, 8, 10, 6]. 23 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 13 writes are split as follows [0, 2, 1, 1, 1, 1, 2, 1, 1, 2, 1]. [2024-11-10 09:33:46,585 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:33:46" (1/1) ... [2024-11-10 09:33:46,585 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:33:46" (1/1) ... [2024-11-10 09:33:46,615 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:33:46" (1/1) ... [2024-11-10 09:33:46,616 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:33:46" (1/1) ... [2024-11-10 09:33:46,620 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:33:46" (1/1) ... [2024-11-10 09:33:46,623 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:33:46" (1/1) ... [2024-11-10 09:33:46,630 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:33:46,631 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:33:46,631 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:33:46,631 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:33:46,632 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:33:46" (1/1) ... [2024-11-10 09:33:46,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:33:46,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:33:46,681 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:33:46,684 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:33:46,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:33:46,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-10 09:33:46,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-10 09:33:46,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-10 09:33:46,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-10 09:33:46,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-10 09:33:46,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-10 09:33:46,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-10 09:33:46,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-11-10 09:33:46,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-11-10 09:33:46,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-11-10 09:33:46,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-11-10 09:33:46,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 09:33:46,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 09:33:46,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 09:33:46,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-10 09:33:46,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-10 09:33:46,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-10 09:33:46,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-10 09:33:46,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-10 09:33:46,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-10 09:33:46,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-10 09:33:46,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-10 09:33:46,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-10 09:33:46,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-10 09:33:46,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-10 09:33:46,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-10 09:33:46,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-10 09:33:46,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-10 09:33:46,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-10 09:33:46,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-11-10 09:33:46,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-11-10 09:33:46,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-11-10 09:33:46,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-11-10 09:33:46,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 09:33:46,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 09:33:46,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 09:33:46,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-10 09:33:46,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-10 09:33:46,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-10 09:33:46,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-10 09:33:46,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-10 09:33:46,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-10 09:33:46,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-10 09:33:46,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-10 09:33:46,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-10 09:33:46,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-10 09:33:46,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-10 09:33:46,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-10 09:33:46,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-10 09:33:46,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-10 09:33:46,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-10 09:33:46,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-11-10 09:33:46,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-11-10 09:33:46,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-11-10 09:33:46,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-11-10 09:33:46,744 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:33:46,744 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:33:46,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 09:33:46,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 09:33:46,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 09:33:46,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-10 09:33:46,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-10 09:33:46,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-10 09:33:46,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-10 09:33:46,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-10 09:33:46,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-10 09:33:46,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-10 09:33:46,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-10 09:33:46,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:33:46,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:33:46,923 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:33:46,926 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:33:47,508 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L99: havoc property_#t~mem80#1;havoc property_#t~mem75#1;havoc property_#t~mem76#1;havoc property_#t~ite79#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~bitwise81#1;havoc property_#t~mem82#1;havoc property_#t~ite95#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite93#1;havoc property_#t~mem92#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~ite91#1;havoc property_#t~mem89#1;havoc property_#t~mem90#1;havoc property_#t~mem94#1;havoc property_#t~mem96#1;havoc property_#t~ite108#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~ite107#1;havoc property_#t~mem104#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~ite103#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~mem106#1;havoc property_#t~mem105#1;havoc property_#t~short109#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~bitwise112#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~ite125#1;havoc property_#t~mem118#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~short119#1;havoc property_#t~ite122#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~mem124#1;havoc property_#t~mem123#1;havoc property_#t~short126#1; [2024-11-10 09:33:47,560 INFO L? ?]: Removed 145 outVars from TransFormulas that were not future-live. [2024-11-10 09:33:47,562 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:33:47,584 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:33:47,584 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:33:47,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:33:47 BoogieIcfgContainer [2024-11-10 09:33:47,585 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:33:47,587 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:33:47,587 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:33:47,590 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:33:47,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:33:46" (1/3) ... [2024-11-10 09:33:47,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a504386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:33:47, skipping insertion in model container [2024-11-10 09:33:47,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:33:46" (2/3) ... [2024-11-10 09:33:47,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a504386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:33:47, skipping insertion in model container [2024-11-10 09:33:47,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:33:47" (3/3) ... [2024-11-10 09:33:47,593 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-18.i [2024-11-10 09:33:47,607 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:33:47,608 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:33:47,672 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:33:47,679 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;@773264e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:33:47,679 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:33:47,684 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 96 states have (on average 1.4479166666666667) internal successors, (139), 97 states have internal predecessors, (139), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 09:33:47,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-10 09:33:47,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:33:47,700 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:33:47,701 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:33:47,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:33:47,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1545646572, now seen corresponding path program 1 times [2024-11-10 09:33:47,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:33:47,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787361174] [2024-11-10 09:33:47,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:33:47,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:33:47,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:48,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:33:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:48,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:33:48,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:48,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:33:48,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:48,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:33:48,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:48,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:33:48,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:48,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:33:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:48,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:33:48,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:48,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:33:48,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:48,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:33:48,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:48,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:33:48,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:48,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:33:48,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:48,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:33:48,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:48,184 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:33:48,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:33:48,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787361174] [2024-11-10 09:33:48,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787361174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:33:48,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:33:48,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:33:48,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653726144] [2024-11-10 09:33:48,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:33:48,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:33:48,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:33:48,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:33:48,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:33:48,223 INFO L87 Difference]: Start difference. First operand has 111 states, 96 states have (on average 1.4479166666666667) internal successors, (139), 97 states have internal predecessors, (139), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-10 09:33:48,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:33:48,271 INFO L93 Difference]: Finished difference Result 214 states and 331 transitions. [2024-11-10 09:33:48,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:33:48,275 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2024-11-10 09:33:48,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:33:48,287 INFO L225 Difference]: With dead ends: 214 [2024-11-10 09:33:48,288 INFO L226 Difference]: Without dead ends: 106 [2024-11-10 09:33:48,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:33:48,296 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 151 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:33:48,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:33:48,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-10 09:33:48,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-10 09:33:48,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 92 states have (on average 1.423913043478261) internal successors, (131), 92 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 09:33:48,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2024-11-10 09:33:48,349 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 109 [2024-11-10 09:33:48,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:33:48,349 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2024-11-10 09:33:48,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-10 09:33:48,351 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2024-11-10 09:33:48,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-10 09:33:48,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:33:48,354 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:33:48,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 09:33:48,355 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:33:48,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:33:48,356 INFO L85 PathProgramCache]: Analyzing trace with hash 106545494, now seen corresponding path program 1 times [2024-11-10 09:33:48,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:33:48,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593097443] [2024-11-10 09:33:48,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:33:48,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:33:48,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:49,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:33:49,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:49,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:33:49,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:49,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:33:49,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:49,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:33:49,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:49,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:33:49,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:49,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:33:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:49,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:33:49,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:49,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:33:49,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:49,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:33:49,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:49,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:33:49,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:49,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:33:49,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:49,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:33:49,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:49,149 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:33:49,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:33:49,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593097443] [2024-11-10 09:33:49,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593097443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:33:49,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:33:49,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:33:49,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821059586] [2024-11-10 09:33:49,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:33:49,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:33:49,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:33:49,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:33:49,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:33:49,157 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:33:49,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:33:49,477 INFO L93 Difference]: Finished difference Result 312 states and 459 transitions. [2024-11-10 09:33:49,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:33:49,481 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2024-11-10 09:33:49,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:33:49,484 INFO L225 Difference]: With dead ends: 312 [2024-11-10 09:33:49,486 INFO L226 Difference]: Without dead ends: 209 [2024-11-10 09:33:49,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:33:49,489 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 252 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:33:49,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 599 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:33:49,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-10 09:33:49,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 203. [2024-11-10 09:33:49,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 176 states have (on average 1.4261363636363635) internal successors, (251), 176 states have internal predecessors, (251), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 09:33:49,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 299 transitions. [2024-11-10 09:33:49,521 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 299 transitions. Word has length 109 [2024-11-10 09:33:49,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:33:49,522 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 299 transitions. [2024-11-10 09:33:49,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:33:49,522 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 299 transitions. [2024-11-10 09:33:49,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-10 09:33:49,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:33:49,524 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:33:49,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 09:33:49,525 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:33:49,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:33:49,525 INFO L85 PathProgramCache]: Analyzing trace with hash 631472821, now seen corresponding path program 1 times [2024-11-10 09:33:49,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:33:49,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314484866] [2024-11-10 09:33:49,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:33:49,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:33:49,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:50,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:33:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:50,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:33:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:50,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:33:50,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:50,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:33:50,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:50,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:33:50,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:50,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:33:50,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:50,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:33:50,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:50,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:33:50,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:50,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:33:50,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:50,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:33:50,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:50,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:33:50,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:50,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:33:50,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:50,728 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:33:50,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:33:50,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314484866] [2024-11-10 09:33:50,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314484866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:33:50,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:33:50,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 09:33:50,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338945591] [2024-11-10 09:33:50,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:33:50,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 09:33:50,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:33:50,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 09:33:50,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:33:50,735 INFO L87 Difference]: Start difference. First operand 203 states and 299 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:33:51,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:33:51,505 INFO L93 Difference]: Finished difference Result 605 states and 894 transitions. [2024-11-10 09:33:51,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 09:33:51,507 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2024-11-10 09:33:51,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:33:51,510 INFO L225 Difference]: With dead ends: 605 [2024-11-10 09:33:51,512 INFO L226 Difference]: Without dead ends: 405 [2024-11-10 09:33:51,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-11-10 09:33:51,517 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 817 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 09:33:51,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 512 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 09:33:51,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2024-11-10 09:33:51,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 398. [2024-11-10 09:33:51,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 345 states have (on average 1.4260869565217391) internal successors, (492), 345 states have internal predecessors, (492), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-10 09:33:51,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 588 transitions. [2024-11-10 09:33:51,577 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 588 transitions. Word has length 110 [2024-11-10 09:33:51,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:33:51,578 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 588 transitions. [2024-11-10 09:33:51,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:33:51,579 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 588 transitions. [2024-11-10 09:33:51,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-10 09:33:51,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:33:51,581 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:33:51,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 09:33:51,582 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:33:51,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:33:51,584 INFO L85 PathProgramCache]: Analyzing trace with hash 338069814, now seen corresponding path program 1 times [2024-11-10 09:33:51,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:33:51,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547992369] [2024-11-10 09:33:51,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:33:51,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:33:51,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:51,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:33:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:51,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:33:51,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:51,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:33:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:51,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:33:51,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:51,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:33:51,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:51,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:33:51,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:51,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:33:51,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:51,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:33:51,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:51,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:33:51,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:51,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:33:51,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:51,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:33:51,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:51,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:33:51,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:51,946 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:33:51,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:33:51,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547992369] [2024-11-10 09:33:51,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547992369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:33:51,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:33:51,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:33:51,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575857579] [2024-11-10 09:33:51,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:33:51,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:33:51,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:33:51,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:33:51,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:33:51,948 INFO L87 Difference]: Start difference. First operand 398 states and 588 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:33:52,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:33:52,084 INFO L93 Difference]: Finished difference Result 504 states and 744 transitions. [2024-11-10 09:33:52,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:33:52,085 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2024-11-10 09:33:52,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:33:52,089 INFO L225 Difference]: With dead ends: 504 [2024-11-10 09:33:52,089 INFO L226 Difference]: Without dead ends: 303 [2024-11-10 09:33:52,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:33:52,092 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 8 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:33:52,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 397 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:33:52,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-11-10 09:33:52,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 301. [2024-11-10 09:33:52,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 261 states have (on average 1.421455938697318) internal successors, (371), 261 states have internal predecessors, (371), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-10 09:33:52,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 443 transitions. [2024-11-10 09:33:52,138 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 443 transitions. Word has length 110 [2024-11-10 09:33:52,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:33:52,140 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 443 transitions. [2024-11-10 09:33:52,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:33:52,141 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 443 transitions. [2024-11-10 09:33:52,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-10 09:33:52,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:33:52,143 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:33:52,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 09:33:52,144 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:33:52,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:33:52,146 INFO L85 PathProgramCache]: Analyzing trace with hash -365599532, now seen corresponding path program 1 times [2024-11-10 09:33:52,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:33:52,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336494987] [2024-11-10 09:33:52,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:33:52,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:33:52,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:52,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:33:52,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:52,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:33:52,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:52,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:33:52,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:52,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:33:52,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:52,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:33:52,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:52,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:33:52,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:52,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:33:52,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:52,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:33:52,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:52,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:33:52,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:52,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:33:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:52,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:33:52,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:52,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:33:52,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:52,535 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:33:52,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:33:52,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336494987] [2024-11-10 09:33:52,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336494987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:33:52,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:33:52,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:33:52,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238073778] [2024-11-10 09:33:52,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:33:52,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:33:52,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:33:52,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:33:52,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:33:52,541 INFO L87 Difference]: Start difference. First operand 301 states and 443 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:33:52,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:33:52,763 INFO L93 Difference]: Finished difference Result 507 states and 746 transitions. [2024-11-10 09:33:52,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:33:52,763 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2024-11-10 09:33:52,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:33:52,766 INFO L225 Difference]: With dead ends: 507 [2024-11-10 09:33:52,766 INFO L226 Difference]: Without dead ends: 403 [2024-11-10 09:33:52,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:33:52,767 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 260 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:33:52,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 703 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:33:52,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-11-10 09:33:52,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 397. [2024-11-10 09:33:52,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 344 states have (on average 1.4186046511627908) internal successors, (488), 344 states have internal predecessors, (488), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-10 09:33:52,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 584 transitions. [2024-11-10 09:33:52,801 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 584 transitions. Word has length 110 [2024-11-10 09:33:52,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:33:52,803 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 584 transitions. [2024-11-10 09:33:52,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:33:52,803 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 584 transitions. [2024-11-10 09:33:52,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-10 09:33:52,805 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:33:52,806 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:33:52,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 09:33:52,806 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:33:52,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:33:52,807 INFO L85 PathProgramCache]: Analyzing trace with hash -659002539, now seen corresponding path program 1 times [2024-11-10 09:33:52,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:33:52,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718492826] [2024-11-10 09:33:52,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:33:52,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:33:52,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:53,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:33:53,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:53,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:33:53,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:53,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:33:53,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:53,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:33:53,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:53,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:33:53,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:53,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:33:53,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:53,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:33:53,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:53,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:33:53,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:53,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:33:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:53,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:33:53,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:53,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:33:53,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:53,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:33:53,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:53,543 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-10 09:33:53,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:33:53,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718492826] [2024-11-10 09:33:53,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718492826] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:33:53,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620310508] [2024-11-10 09:33:53,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:33:53,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:33:53,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:33:53,547 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:33:53,553 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:33:53,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:53,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-10 09:33:53,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:33:53,900 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:33:54,364 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 30 treesize of output 18 [2024-11-10 09:33:54,373 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:33:54,383 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 22 treesize of output 10 [2024-11-10 09:33:54,418 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-10 09:33:54,418 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:33:54,826 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 32 treesize of output 28 [2024-11-10 09:33:54,863 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-10 09:33:54,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620310508] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 09:33:54,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 09:33:54,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 26 [2024-11-10 09:33:54,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471411078] [2024-11-10 09:33:54,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 09:33:54,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-10 09:33:54,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:33:54,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-10 09:33:54,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2024-11-10 09:33:54,868 INFO L87 Difference]: Start difference. First operand 397 states and 584 transitions. Second operand has 26 states, 23 states have (on average 4.434782608695652) internal successors, (102), 24 states have internal predecessors, (102), 5 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 3 states have call predecessors, (36), 5 states have call successors, (36) [2024-11-10 09:33:56,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:33:56,203 INFO L93 Difference]: Finished difference Result 1039 states and 1509 transitions. [2024-11-10 09:33:56,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-10 09:33:56,204 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 4.434782608695652) internal successors, (102), 24 states have internal predecessors, (102), 5 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 3 states have call predecessors, (36), 5 states have call successors, (36) Word has length 110 [2024-11-10 09:33:56,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:33:56,208 INFO L225 Difference]: With dead ends: 1039 [2024-11-10 09:33:56,208 INFO L226 Difference]: Without dead ends: 645 [2024-11-10 09:33:56,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=472, Invalid=2078, Unknown=0, NotChecked=0, Total=2550 [2024-11-10 09:33:56,212 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 827 mSDsluCounter, 1874 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 2054 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 09:33:56,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 2054 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 09:33:56,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2024-11-10 09:33:56,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 627. [2024-11-10 09:33:56,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 542 states have (on average 1.3837638376383763) internal successors, (750), 542 states have internal predecessors, (750), 72 states have call successors, (72), 12 states have call predecessors, (72), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-10 09:33:56,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 894 transitions. [2024-11-10 09:33:56,270 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 894 transitions. Word has length 110 [2024-11-10 09:33:56,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:33:56,270 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 894 transitions. [2024-11-10 09:33:56,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 4.434782608695652) internal successors, (102), 24 states have internal predecessors, (102), 5 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 3 states have call predecessors, (36), 5 states have call successors, (36) [2024-11-10 09:33:56,271 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 894 transitions. [2024-11-10 09:33:56,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-10 09:33:56,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:33:56,272 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:33:56,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 09:33:56,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-10 09:33:56,477 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:33:56,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:33:56,477 INFO L85 PathProgramCache]: Analyzing trace with hash -26458237, now seen corresponding path program 1 times [2024-11-10 09:33:56,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:33:56,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057412810] [2024-11-10 09:33:56,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:33:56,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:33:56,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:57,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:33:57,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:57,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:33:57,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:57,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:33:57,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:57,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:33:57,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:57,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:33:57,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:57,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:33:57,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:57,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:33:57,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:57,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:33:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:57,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:33:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:57,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:33:57,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:57,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:33:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:57,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:33:57,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:57,564 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:33:57,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:33:57,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057412810] [2024-11-10 09:33:57,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057412810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:33:57,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:33:57,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-10 09:33:57,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145069722] [2024-11-10 09:33:57,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:33:57,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 09:33:57,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:33:57,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 09:33:57,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-11-10 09:33:57,567 INFO L87 Difference]: Start difference. First operand 627 states and 894 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:33:59,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:33:59,197 INFO L93 Difference]: Finished difference Result 1900 states and 2712 transitions. [2024-11-10 09:33:59,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-10 09:33:59,198 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2024-11-10 09:33:59,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:33:59,208 INFO L225 Difference]: With dead ends: 1900 [2024-11-10 09:33:59,208 INFO L226 Difference]: Without dead ends: 1276 [2024-11-10 09:33:59,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=200, Invalid=1060, Unknown=0, NotChecked=0, Total=1260 [2024-11-10 09:33:59,210 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 654 mSDsluCounter, 1818 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 2041 SdHoareTripleChecker+Invalid, 1177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:33:59,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 2041 Invalid, 1177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1120 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 09:33:59,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2024-11-10 09:33:59,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 954. [2024-11-10 09:33:59,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 827 states have (on average 1.3796856106408706) internal successors, (1141), 827 states have internal predecessors, (1141), 108 states have call successors, (108), 18 states have call predecessors, (108), 18 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-10 09:33:59,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1357 transitions. [2024-11-10 09:33:59,275 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1357 transitions. Word has length 111 [2024-11-10 09:33:59,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:33:59,276 INFO L471 AbstractCegarLoop]: Abstraction has 954 states and 1357 transitions. [2024-11-10 09:33:59,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:33:59,276 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1357 transitions. [2024-11-10 09:33:59,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-10 09:33:59,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:33:59,278 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:33:59,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 09:33:59,278 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:33:59,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:33:59,279 INFO L85 PathProgramCache]: Analyzing trace with hash 761465246, now seen corresponding path program 1 times [2024-11-10 09:33:59,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:33:59,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655793894] [2024-11-10 09:33:59,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:33:59,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:33:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:59,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:33:59,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:59,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:33:59,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:59,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:33:59,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:59,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:33:59,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:59,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:33:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:59,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:33:59,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:59,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:33:59,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:59,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:33:59,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:59,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:33:59,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:59,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:33:59,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:59,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:33:59,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:59,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:33:59,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:33:59,528 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:33:59,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:33:59,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655793894] [2024-11-10 09:33:59,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655793894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:33:59,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:33:59,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:33:59,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803949138] [2024-11-10 09:33:59,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:33:59,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:33:59,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:33:59,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:33:59,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:33:59,530 INFO L87 Difference]: Start difference. First operand 954 states and 1357 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:33:59,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:33:59,793 INFO L93 Difference]: Finished difference Result 1900 states and 2706 transitions. [2024-11-10 09:33:59,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:33:59,795 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2024-11-10 09:33:59,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:33:59,801 INFO L225 Difference]: With dead ends: 1900 [2024-11-10 09:33:59,803 INFO L226 Difference]: Without dead ends: 1267 [2024-11-10 09:33:59,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:33:59,806 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 152 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:33:59,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 646 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:33:59,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2024-11-10 09:33:59,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1050. [2024-11-10 09:33:59,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 909 states have (on average 1.3795379537953796) internal successors, (1254), 909 states have internal predecessors, (1254), 120 states have call successors, (120), 20 states have call predecessors, (120), 20 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2024-11-10 09:33:59,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1494 transitions. [2024-11-10 09:33:59,908 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1494 transitions. Word has length 112 [2024-11-10 09:33:59,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:33:59,908 INFO L471 AbstractCegarLoop]: Abstraction has 1050 states and 1494 transitions. [2024-11-10 09:33:59,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:33:59,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1494 transitions. [2024-11-10 09:33:59,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-10 09:33:59,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:33:59,910 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:33:59,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 09:33:59,911 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:33:59,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:33:59,911 INFO L85 PathProgramCache]: Analyzing trace with hash 259950920, now seen corresponding path program 1 times [2024-11-10 09:33:59,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:33:59,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653368644] [2024-11-10 09:33:59,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:33:59,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:33:59,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:00,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:34:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:00,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:34:00,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:00,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:34:00,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:00,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:34:00,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:00,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:34:00,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:00,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:34:00,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:00,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:34:00,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:00,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:34:00,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:00,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:34:00,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:00,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:34:00,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:00,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:34:00,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:00,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:34:00,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:00,179 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:34:00,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:34:00,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653368644] [2024-11-10 09:34:00,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653368644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:34:00,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:34:00,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:34:00,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169295603] [2024-11-10 09:34:00,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:34:00,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:34:00,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:34:00,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:34:00,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:34:00,181 INFO L87 Difference]: Start difference. First operand 1050 states and 1494 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:00,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:34:00,419 INFO L93 Difference]: Finished difference Result 2310 states and 3289 transitions. [2024-11-10 09:34:00,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:34:00,420 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2024-11-10 09:34:00,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:34:00,427 INFO L225 Difference]: With dead ends: 2310 [2024-11-10 09:34:00,427 INFO L226 Difference]: Without dead ends: 1263 [2024-11-10 09:34:00,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:34:00,432 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 242 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:34:00,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 583 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:34:00,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2024-11-10 09:34:00,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 1254. [2024-11-10 09:34:00,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 1085 states have (on average 1.376958525345622) internal successors, (1494), 1085 states have internal predecessors, (1494), 144 states have call successors, (144), 24 states have call predecessors, (144), 24 states have return successors, (144), 144 states have call predecessors, (144), 144 states have call successors, (144) [2024-11-10 09:34:00,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1782 transitions. [2024-11-10 09:34:00,556 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1782 transitions. Word has length 112 [2024-11-10 09:34:00,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:34:00,557 INFO L471 AbstractCegarLoop]: Abstraction has 1254 states and 1782 transitions. [2024-11-10 09:34:00,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:00,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1782 transitions. [2024-11-10 09:34:00,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-10 09:34:00,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:34:00,559 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:34:00,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 09:34:00,559 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:34:00,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:34:00,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1425731814, now seen corresponding path program 1 times [2024-11-10 09:34:00,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:34:00,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795293524] [2024-11-10 09:34:00,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:34:00,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:34:00,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:00,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:34:00,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:00,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:34:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:00,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:34:00,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:00,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:34:00,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:00,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:34:00,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:00,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:34:00,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:00,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:34:00,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:00,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:34:00,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:00,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:34:00,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:00,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:34:00,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:00,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:34:00,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:00,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:34:00,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:00,818 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:34:00,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:34:00,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795293524] [2024-11-10 09:34:00,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795293524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:34:00,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:34:00,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:34:00,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676892264] [2024-11-10 09:34:00,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:34:00,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:34:00,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:34:00,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:34:00,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:34:00,820 INFO L87 Difference]: Start difference. First operand 1254 states and 1782 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:00,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:34:00,956 INFO L93 Difference]: Finished difference Result 2496 states and 3543 transitions. [2024-11-10 09:34:00,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:34:00,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2024-11-10 09:34:00,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:34:00,963 INFO L225 Difference]: With dead ends: 2496 [2024-11-10 09:34:00,963 INFO L226 Difference]: Without dead ends: 1245 [2024-11-10 09:34:00,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:34:00,966 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 239 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:34:00,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 470 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:34:00,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2024-11-10 09:34:01,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 934. [2024-11-10 09:34:01,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 807 states have (on average 1.365551425030979) internal successors, (1102), 807 states have internal predecessors, (1102), 108 states have call successors, (108), 18 states have call predecessors, (108), 18 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-10 09:34:01,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1318 transitions. [2024-11-10 09:34:01,054 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1318 transitions. Word has length 113 [2024-11-10 09:34:01,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:34:01,054 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1318 transitions. [2024-11-10 09:34:01,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:01,054 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1318 transitions. [2024-11-10 09:34:01,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-10 09:34:01,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:34:01,057 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:34:01,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 09:34:01,057 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:34:01,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:34:01,058 INFO L85 PathProgramCache]: Analyzing trace with hash -284754879, now seen corresponding path program 1 times [2024-11-10 09:34:01,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:34:01,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418626953] [2024-11-10 09:34:01,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:34:01,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:34:01,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:01,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:34:01,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:01,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:34:01,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:01,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:34:01,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:01,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:34:01,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:01,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:34:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:01,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:34:01,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:01,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:34:01,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:01,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:34:01,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:01,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:34:01,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:01,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:34:01,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:01,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:34:01,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:01,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:34:01,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:01,436 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:34:01,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:34:01,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418626953] [2024-11-10 09:34:01,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418626953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:34:01,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:34:01,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 09:34:01,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945992994] [2024-11-10 09:34:01,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:34:01,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 09:34:01,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:34:01,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 09:34:01,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:34:01,439 INFO L87 Difference]: Start difference. First operand 934 states and 1318 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:01,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:34:01,699 INFO L93 Difference]: Finished difference Result 2190 states and 3098 transitions. [2024-11-10 09:34:01,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:34:01,700 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2024-11-10 09:34:01,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:34:01,707 INFO L225 Difference]: With dead ends: 2190 [2024-11-10 09:34:01,707 INFO L226 Difference]: Without dead ends: 1259 [2024-11-10 09:34:01,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:34:01,710 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 156 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:34:01,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 1018 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:34:01,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2024-11-10 09:34:01,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 1254. [2024-11-10 09:34:01,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 1085 states have (on average 1.3649769585253457) internal successors, (1481), 1085 states have internal predecessors, (1481), 144 states have call successors, (144), 24 states have call predecessors, (144), 24 states have return successors, (144), 144 states have call predecessors, (144), 144 states have call successors, (144) [2024-11-10 09:34:01,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1769 transitions. [2024-11-10 09:34:01,817 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1769 transitions. Word has length 113 [2024-11-10 09:34:01,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:34:01,817 INFO L471 AbstractCegarLoop]: Abstraction has 1254 states and 1769 transitions. [2024-11-10 09:34:01,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:01,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1769 transitions. [2024-11-10 09:34:01,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-10 09:34:01,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:34:01,820 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:34:01,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 09:34:01,820 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:34:01,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:34:01,821 INFO L85 PathProgramCache]: Analyzing trace with hash 394024841, now seen corresponding path program 1 times [2024-11-10 09:34:01,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:34:01,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099451659] [2024-11-10 09:34:01,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:34:01,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:34:01,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:02,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:34:02,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:02,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:34:02,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:02,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:34:02,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:02,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:34:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:02,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:34:02,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:02,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:34:02,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:02,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:34:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:02,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:34:02,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:02,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:34:02,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:02,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:34:02,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:02,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:34:02,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:02,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:34:02,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:02,468 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:34:02,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:34:02,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099451659] [2024-11-10 09:34:02,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099451659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:34:02,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:34:02,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 09:34:02,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127038858] [2024-11-10 09:34:02,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:34:02,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 09:34:02,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:34:02,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 09:34:02,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:34:02,471 INFO L87 Difference]: Start difference. First operand 1254 states and 1769 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:03,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:34:03,352 INFO L93 Difference]: Finished difference Result 2296 states and 3223 transitions. [2024-11-10 09:34:03,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 09:34:03,353 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2024-11-10 09:34:03,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:34:03,360 INFO L225 Difference]: With dead ends: 2296 [2024-11-10 09:34:03,361 INFO L226 Difference]: Without dead ends: 1575 [2024-11-10 09:34:03,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2024-11-10 09:34:03,363 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 833 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 09:34:03,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 1401 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 09:34:03,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2024-11-10 09:34:03,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1147. [2024-11-10 09:34:03,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1147 states, 992 states have (on average 1.3608870967741935) internal successors, (1350), 992 states have internal predecessors, (1350), 132 states have call successors, (132), 22 states have call predecessors, (132), 22 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2024-11-10 09:34:03,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1614 transitions. [2024-11-10 09:34:03,462 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1614 transitions. Word has length 113 [2024-11-10 09:34:03,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:34:03,463 INFO L471 AbstractCegarLoop]: Abstraction has 1147 states and 1614 transitions. [2024-11-10 09:34:03,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:03,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1614 transitions. [2024-11-10 09:34:03,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-10 09:34:03,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:34:03,470 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:34:03,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 09:34:03,470 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:34:03,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:34:03,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1692417312, now seen corresponding path program 1 times [2024-11-10 09:34:03,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:34:03,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132976799] [2024-11-10 09:34:03,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:34:03,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:34:03,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:03,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:34:03,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:03,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:34:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:03,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:34:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:03,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:34:03,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:03,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:34:03,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:03,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:34:03,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:03,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:34:03,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:03,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:34:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:03,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:34:03,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:03,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:34:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:03,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:34:03,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:03,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:34:03,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:03,790 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:34:03,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:34:03,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132976799] [2024-11-10 09:34:03,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132976799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:34:03,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:34:03,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 09:34:03,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328031650] [2024-11-10 09:34:03,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:34:03,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 09:34:03,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:34:03,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 09:34:03,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:34:03,794 INFO L87 Difference]: Start difference. First operand 1147 states and 1614 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:04,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:34:04,124 INFO L93 Difference]: Finished difference Result 2079 states and 2926 transitions. [2024-11-10 09:34:04,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 09:34:04,126 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2024-11-10 09:34:04,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:34:04,132 INFO L225 Difference]: With dead ends: 2079 [2024-11-10 09:34:04,132 INFO L226 Difference]: Without dead ends: 1244 [2024-11-10 09:34:04,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:34:04,134 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 240 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:34:04,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 861 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:34:04,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2024-11-10 09:34:04,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 1235. [2024-11-10 09:34:04,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1235 states, 1066 states have (on average 1.3564727954971858) internal successors, (1446), 1066 states have internal predecessors, (1446), 144 states have call successors, (144), 24 states have call predecessors, (144), 24 states have return successors, (144), 144 states have call predecessors, (144), 144 states have call successors, (144) [2024-11-10 09:34:04,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1734 transitions. [2024-11-10 09:34:04,219 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1734 transitions. Word has length 113 [2024-11-10 09:34:04,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:34:04,222 INFO L471 AbstractCegarLoop]: Abstraction has 1235 states and 1734 transitions. [2024-11-10 09:34:04,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:04,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1734 transitions. [2024-11-10 09:34:04,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-10 09:34:04,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:34:04,224 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:34:04,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 09:34:04,224 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:34:04,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:34:04,225 INFO L85 PathProgramCache]: Analyzing trace with hash 521281865, now seen corresponding path program 1 times [2024-11-10 09:34:04,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:34:04,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685783737] [2024-11-10 09:34:04,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:34:04,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:34:04,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:04,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:34:04,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:04,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:34:04,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:04,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:34:04,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:04,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:34:04,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:04,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:34:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:04,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:34:04,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:04,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:34:04,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:04,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:34:04,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:04,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:34:04,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:04,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:34:04,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:04,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:34:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:04,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:34:04,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:04,370 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:34:04,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:34:04,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685783737] [2024-11-10 09:34:04,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685783737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:34:04,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:34:04,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:34:04,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895595412] [2024-11-10 09:34:04,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:34:04,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:34:04,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:34:04,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:34:04,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:34:04,372 INFO L87 Difference]: Start difference. First operand 1235 states and 1734 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:04,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:34:04,472 INFO L93 Difference]: Finished difference Result 2503 states and 3513 transitions. [2024-11-10 09:34:04,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:34:04,473 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2024-11-10 09:34:04,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:34:04,479 INFO L225 Difference]: With dead ends: 2503 [2024-11-10 09:34:04,479 INFO L226 Difference]: Without dead ends: 1271 [2024-11-10 09:34:04,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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:34:04,483 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:34:04,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 565 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:34:04,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2024-11-10 09:34:04,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 1271. [2024-11-10 09:34:04,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1271 states, 1102 states have (on average 1.3448275862068966) internal successors, (1482), 1102 states have internal predecessors, (1482), 144 states have call successors, (144), 24 states have call predecessors, (144), 24 states have return successors, (144), 144 states have call predecessors, (144), 144 states have call successors, (144) [2024-11-10 09:34:04,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 1770 transitions. [2024-11-10 09:34:04,605 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 1770 transitions. Word has length 113 [2024-11-10 09:34:04,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:34:04,606 INFO L471 AbstractCegarLoop]: Abstraction has 1271 states and 1770 transitions. [2024-11-10 09:34:04,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:04,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1770 transitions. [2024-11-10 09:34:04,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-10 09:34:04,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:34:04,608 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:34:04,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 09:34:04,608 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:34:04,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:34:04,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1674247908, now seen corresponding path program 1 times [2024-11-10 09:34:04,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:34:04,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971709455] [2024-11-10 09:34:04,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:34:04,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:34:04,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:04,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:34:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:04,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:34:04,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:04,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:34:04,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:04,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:34:04,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:04,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:34:04,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:04,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:34:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:04,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:34:04,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:04,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:34:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:04,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:34:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:04,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:34:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:04,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:34:04,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:04,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:34:04,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:04,871 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:34:04,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:34:04,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971709455] [2024-11-10 09:34:04,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971709455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:34:04,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:34:04,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:34:04,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365031570] [2024-11-10 09:34:04,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:34:04,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:34:04,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:34:04,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:34:04,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:34:04,873 INFO L87 Difference]: Start difference. First operand 1271 states and 1770 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:05,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:34:05,105 INFO L93 Difference]: Finished difference Result 2226 states and 3102 transitions. [2024-11-10 09:34:05,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:34:05,106 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2024-11-10 09:34:05,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:34:05,111 INFO L225 Difference]: With dead ends: 2226 [2024-11-10 09:34:05,111 INFO L226 Difference]: Without dead ends: 1276 [2024-11-10 09:34:05,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:34:05,115 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 142 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:34:05,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 632 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:34:05,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2024-11-10 09:34:05,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1057. [2024-11-10 09:34:05,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1057 states, 916 states have (on average 1.341703056768559) internal successors, (1229), 916 states have internal predecessors, (1229), 120 states have call successors, (120), 20 states have call predecessors, (120), 20 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2024-11-10 09:34:05,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1469 transitions. [2024-11-10 09:34:05,187 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1469 transitions. Word has length 114 [2024-11-10 09:34:05,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:34:05,187 INFO L471 AbstractCegarLoop]: Abstraction has 1057 states and 1469 transitions. [2024-11-10 09:34:05,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:05,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1469 transitions. [2024-11-10 09:34:05,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-10 09:34:05,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:34:05,189 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:34:05,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 09:34:05,189 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:34:05,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:34:05,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1056931115, now seen corresponding path program 1 times [2024-11-10 09:34:05,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:34:05,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955304741] [2024-11-10 09:34:05,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:34:05,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:34:05,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:05,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:34:05,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:05,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:34:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:05,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:34:05,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:05,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:34:05,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:05,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:34:05,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:05,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:34:05,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:05,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:34:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:05,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:34:05,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:05,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:34:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:05,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:34:05,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:05,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:34:05,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:05,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:34:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:05,620 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:34:05,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:34:05,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955304741] [2024-11-10 09:34:05,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955304741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:34:05,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:34:05,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 09:34:05,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909124052] [2024-11-10 09:34:05,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:34:05,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 09:34:05,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:34:05,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 09:34:05,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:34:05,623 INFO L87 Difference]: Start difference. First operand 1057 states and 1469 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:06,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:34:06,083 INFO L93 Difference]: Finished difference Result 1904 states and 2644 transitions. [2024-11-10 09:34:06,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 09:34:06,083 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2024-11-10 09:34:06,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:34:06,090 INFO L225 Difference]: With dead ends: 1904 [2024-11-10 09:34:06,090 INFO L226 Difference]: Without dead ends: 1280 [2024-11-10 09:34:06,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-10 09:34:06,092 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 233 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 09:34:06,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 910 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 09:34:06,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2024-11-10 09:34:06,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 1165. [2024-11-10 09:34:06,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1165 states, 1010 states have (on average 1.3435643564356436) internal successors, (1357), 1010 states have internal predecessors, (1357), 132 states have call successors, (132), 22 states have call predecessors, (132), 22 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2024-11-10 09:34:06,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1621 transitions. [2024-11-10 09:34:06,196 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1621 transitions. Word has length 114 [2024-11-10 09:34:06,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:34:06,197 INFO L471 AbstractCegarLoop]: Abstraction has 1165 states and 1621 transitions. [2024-11-10 09:34:06,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:06,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1621 transitions. [2024-11-10 09:34:06,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-10 09:34:06,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:34:06,200 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:34:06,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 09:34:06,200 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:34:06,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:34:06,201 INFO L85 PathProgramCache]: Analyzing trace with hash 551372490, now seen corresponding path program 1 times [2024-11-10 09:34:06,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:34:06,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008315889] [2024-11-10 09:34:06,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:34:06,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:34:06,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:06,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:34:06,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:06,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:34:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:06,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:34:06,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:06,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:34:06,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:06,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:34:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:06,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:34:06,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:06,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:34:06,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:06,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:34:06,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:06,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:34:06,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:06,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:34:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:06,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:34:06,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:06,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:34:06,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:06,559 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:34:06,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:34:06,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008315889] [2024-11-10 09:34:06,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008315889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:34:06,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:34:06,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 09:34:06,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136423906] [2024-11-10 09:34:06,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:34:06,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 09:34:06,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:34:06,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 09:34:06,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:34:06,562 INFO L87 Difference]: Start difference. First operand 1165 states and 1621 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:07,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:34:07,018 INFO L93 Difference]: Finished difference Result 2679 states and 3730 transitions. [2024-11-10 09:34:07,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 09:34:07,018 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2024-11-10 09:34:07,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:34:07,026 INFO L225 Difference]: With dead ends: 2679 [2024-11-10 09:34:07,026 INFO L226 Difference]: Without dead ends: 1947 [2024-11-10 09:34:07,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-11-10 09:34:07,029 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 363 mSDsluCounter, 1202 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 1477 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 09:34:07,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 1477 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 09:34:07,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1947 states. [2024-11-10 09:34:07,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1947 to 1615. [2024-11-10 09:34:07,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1615 states, 1404 states have (on average 1.353988603988604) internal successors, (1901), 1404 states have internal predecessors, (1901), 180 states have call successors, (180), 30 states have call predecessors, (180), 30 states have return successors, (180), 180 states have call predecessors, (180), 180 states have call successors, (180) [2024-11-10 09:34:07,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 2261 transitions. [2024-11-10 09:34:07,154 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 2261 transitions. Word has length 114 [2024-11-10 09:34:07,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:34:07,154 INFO L471 AbstractCegarLoop]: Abstraction has 1615 states and 2261 transitions. [2024-11-10 09:34:07,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:07,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2261 transitions. [2024-11-10 09:34:07,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-10 09:34:07,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:34:07,157 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:34:07,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 09:34:07,157 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:34:07,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:34:07,157 INFO L85 PathProgramCache]: Analyzing trace with hash -733705242, now seen corresponding path program 1 times [2024-11-10 09:34:07,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:34:07,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547785608] [2024-11-10 09:34:07,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:34:07,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:34:07,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:07,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:34:07,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:07,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:34:07,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:07,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:34:07,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:07,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:34:07,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:07,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:34:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:07,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:34:07,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:07,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:34:07,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:07,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:34:07,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:07,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:34:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:07,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:34:07,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:07,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:34:07,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:07,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:34:07,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:07,743 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:34:07,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:34:07,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547785608] [2024-11-10 09:34:07,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547785608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:34:07,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:34:07,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 09:34:07,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890657797] [2024-11-10 09:34:07,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:34:07,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 09:34:07,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:34:07,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 09:34:07,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:34:07,746 INFO L87 Difference]: Start difference. First operand 1615 states and 2261 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:08,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:34:08,299 INFO L93 Difference]: Finished difference Result 2740 states and 3821 transitions. [2024-11-10 09:34:08,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 09:34:08,300 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2024-11-10 09:34:08,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:34:08,309 INFO L225 Difference]: With dead ends: 2740 [2024-11-10 09:34:08,309 INFO L226 Difference]: Without dead ends: 1786 [2024-11-10 09:34:08,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2024-11-10 09:34:08,312 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 363 mSDsluCounter, 1278 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 1509 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 09:34:08,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 1509 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 09:34:08,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1786 states. [2024-11-10 09:34:08,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1786 to 1615. [2024-11-10 09:34:08,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1615 states, 1404 states have (on average 1.3497150997150997) internal successors, (1895), 1404 states have internal predecessors, (1895), 180 states have call successors, (180), 30 states have call predecessors, (180), 30 states have return successors, (180), 180 states have call predecessors, (180), 180 states have call successors, (180) [2024-11-10 09:34:08,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 2255 transitions. [2024-11-10 09:34:08,493 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 2255 transitions. Word has length 114 [2024-11-10 09:34:08,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:34:08,493 INFO L471 AbstractCegarLoop]: Abstraction has 1615 states and 2255 transitions. [2024-11-10 09:34:08,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:08,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2255 transitions. [2024-11-10 09:34:08,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-10 09:34:08,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:34:08,496 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:34:08,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 09:34:08,496 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:34:08,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:34:08,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1052950316, now seen corresponding path program 1 times [2024-11-10 09:34:08,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:34:08,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143107333] [2024-11-10 09:34:08,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:34:08,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:34:08,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:08,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:34:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:08,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:34:08,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:08,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:34:08,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:08,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:34:08,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:08,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:34:08,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:08,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:34:08,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:08,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:34:08,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:08,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:34:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:08,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:34:08,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:08,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:34:08,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:08,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:34:08,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:08,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:34:08,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:08,794 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:34:08,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:34:08,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143107333] [2024-11-10 09:34:08,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143107333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:34:08,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:34:08,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:34:08,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997951555] [2024-11-10 09:34:08,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:34:08,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:34:08,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:34:08,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:34:08,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:34:08,798 INFO L87 Difference]: Start difference. First operand 1615 states and 2255 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:09,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:34:09,094 INFO L93 Difference]: Finished difference Result 2910 states and 4066 transitions. [2024-11-10 09:34:09,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:34:09,096 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-10 09:34:09,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:34:09,104 INFO L225 Difference]: With dead ends: 2910 [2024-11-10 09:34:09,105 INFO L226 Difference]: Without dead ends: 1634 [2024-11-10 09:34:09,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:34:09,108 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 135 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:34:09,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 807 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:34:09,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2024-11-10 09:34:09,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1615. [2024-11-10 09:34:09,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1615 states, 1404 states have (on average 1.3482905982905984) internal successors, (1893), 1404 states have internal predecessors, (1893), 180 states have call successors, (180), 30 states have call predecessors, (180), 30 states have return successors, (180), 180 states have call predecessors, (180), 180 states have call successors, (180) [2024-11-10 09:34:09,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 2253 transitions. [2024-11-10 09:34:09,236 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 2253 transitions. Word has length 115 [2024-11-10 09:34:09,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:34:09,236 INFO L471 AbstractCegarLoop]: Abstraction has 1615 states and 2253 transitions. [2024-11-10 09:34:09,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:09,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2253 transitions. [2024-11-10 09:34:09,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-10 09:34:09,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:34:09,242 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:34:09,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 09:34:09,242 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:34:09,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:34:09,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1279055047, now seen corresponding path program 1 times [2024-11-10 09:34:09,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:34:09,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490766313] [2024-11-10 09:34:09,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:34:09,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:34:09,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:09,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:34:09,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:09,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:34:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:09,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:34:09,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:09,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:34:09,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:09,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:34:09,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:09,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:34:09,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:09,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:34:09,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:09,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:34:09,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:09,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:34:09,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:09,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:34:09,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:09,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:34:09,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:09,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:34:09,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:09,491 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:34:09,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:34:09,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490766313] [2024-11-10 09:34:09,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490766313] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:34:09,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:34:09,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:34:09,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612052960] [2024-11-10 09:34:09,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:34:09,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:34:09,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:34:09,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:34:09,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:34:09,493 INFO L87 Difference]: Start difference. First operand 1615 states and 2253 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:09,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:34:09,719 INFO L93 Difference]: Finished difference Result 2888 states and 4027 transitions. [2024-11-10 09:34:09,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:34:09,719 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-10 09:34:09,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:34:09,727 INFO L225 Difference]: With dead ends: 2888 [2024-11-10 09:34:09,727 INFO L226 Difference]: Without dead ends: 1612 [2024-11-10 09:34:09,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:34:09,731 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 143 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:34:09,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 840 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:34:09,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1612 states. [2024-11-10 09:34:09,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1612 to 1609. [2024-11-10 09:34:09,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1609 states, 1398 states have (on average 1.3454935622317596) internal successors, (1881), 1398 states have internal predecessors, (1881), 180 states have call successors, (180), 30 states have call predecessors, (180), 30 states have return successors, (180), 180 states have call predecessors, (180), 180 states have call successors, (180) [2024-11-10 09:34:09,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2241 transitions. [2024-11-10 09:34:09,869 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2241 transitions. Word has length 115 [2024-11-10 09:34:09,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:34:09,869 INFO L471 AbstractCegarLoop]: Abstraction has 1609 states and 2241 transitions. [2024-11-10 09:34:09,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:09,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2241 transitions. [2024-11-10 09:34:09,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-10 09:34:09,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:34:09,872 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:34:09,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 09:34:09,873 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:34:09,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:34:09,873 INFO L85 PathProgramCache]: Analyzing trace with hash -737686041, now seen corresponding path program 1 times [2024-11-10 09:34:09,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:34:09,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107357788] [2024-11-10 09:34:09,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:34:09,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:34:09,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:10,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:34:10,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:10,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:34:10,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:10,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:34:10,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:10,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:34:10,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:10,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:34:10,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:10,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:34:10,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:10,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:34:10,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:10,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:34:10,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:10,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:34:10,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:10,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:34:10,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:10,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:34:10,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:10,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:34:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:10,577 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:34:10,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:34:10,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107357788] [2024-11-10 09:34:10,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107357788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:34:10,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:34:10,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 09:34:10,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406001622] [2024-11-10 09:34:10,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:34:10,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 09:34:10,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:34:10,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 09:34:10,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-10 09:34:10,579 INFO L87 Difference]: Start difference. First operand 1609 states and 2241 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:11,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:34:11,874 INFO L93 Difference]: Finished difference Result 3372 states and 4681 transitions. [2024-11-10 09:34:11,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 09:34:11,875 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-10 09:34:11,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:34:11,888 INFO L225 Difference]: With dead ends: 3372 [2024-11-10 09:34:11,888 INFO L226 Difference]: Without dead ends: 2422 [2024-11-10 09:34:11,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=188, Invalid=568, Unknown=0, NotChecked=0, Total=756 [2024-11-10 09:34:11,892 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 977 mSDsluCounter, 1692 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 977 SdHoareTripleChecker+Valid, 1985 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 09:34:11,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [977 Valid, 1985 Invalid, 1003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 09:34:11,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2024-11-10 09:34:12,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 2032. [2024-11-10 09:34:12,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2032 states, 1765 states have (on average 1.3461756373937677) internal successors, (2376), 1765 states have internal predecessors, (2376), 228 states have call successors, (228), 38 states have call predecessors, (228), 38 states have return successors, (228), 228 states have call predecessors, (228), 228 states have call successors, (228) [2024-11-10 09:34:12,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2032 states to 2032 states and 2832 transitions. [2024-11-10 09:34:12,072 INFO L78 Accepts]: Start accepts. Automaton has 2032 states and 2832 transitions. Word has length 115 [2024-11-10 09:34:12,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:34:12,073 INFO L471 AbstractCegarLoop]: Abstraction has 2032 states and 2832 transitions. [2024-11-10 09:34:12,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:12,073 INFO L276 IsEmpty]: Start isEmpty. Operand 2032 states and 2832 transitions. [2024-11-10 09:34:12,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-10 09:34:12,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:34:12,076 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:34:12,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 09:34:12,076 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:34:12,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:34:12,077 INFO L85 PathProgramCache]: Analyzing trace with hash -2102935513, now seen corresponding path program 1 times [2024-11-10 09:34:12,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:34:12,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356786250] [2024-11-10 09:34:12,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:34:12,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:34:12,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:13,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:34:13,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:13,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:34:13,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:13,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:34:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:13,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:34:13,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:13,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:34:13,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:13,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:34:13,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:13,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:34:13,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:13,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:34:13,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:13,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:34:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:13,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:34:13,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:13,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:34:13,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:13,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:34:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:13,558 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:34:13,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:34:13,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356786250] [2024-11-10 09:34:13,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356786250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:34:13,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:34:13,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 09:34:13,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30848433] [2024-11-10 09:34:13,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:34:13,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 09:34:13,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:34:13,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 09:34:13,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-10 09:34:13,561 INFO L87 Difference]: Start difference. First operand 2032 states and 2832 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:14,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:34:14,837 INFO L93 Difference]: Finished difference Result 4152 states and 5757 transitions. [2024-11-10 09:34:14,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 09:34:14,841 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-10 09:34:14,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:34:14,863 INFO L225 Difference]: With dead ends: 4152 [2024-11-10 09:34:14,864 INFO L226 Difference]: Without dead ends: 2779 [2024-11-10 09:34:14,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2024-11-10 09:34:14,876 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 332 mSDsluCounter, 1574 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 1753 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 09:34:14,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 1753 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 09:34:14,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2779 states. [2024-11-10 09:34:15,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2779 to 2099. [2024-11-10 09:34:15,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2099 states, 1832 states have (on average 1.341703056768559) internal successors, (2458), 1832 states have internal predecessors, (2458), 228 states have call successors, (228), 38 states have call predecessors, (228), 38 states have return successors, (228), 228 states have call predecessors, (228), 228 states have call successors, (228) [2024-11-10 09:34:15,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2099 states to 2099 states and 2914 transitions. [2024-11-10 09:34:15,080 INFO L78 Accepts]: Start accepts. Automaton has 2099 states and 2914 transitions. Word has length 115 [2024-11-10 09:34:15,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:34:15,081 INFO L471 AbstractCegarLoop]: Abstraction has 2099 states and 2914 transitions. [2024-11-10 09:34:15,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:15,081 INFO L276 IsEmpty]: Start isEmpty. Operand 2099 states and 2914 transitions. [2024-11-10 09:34:15,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-10 09:34:15,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:34:15,084 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:34:15,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 09:34:15,084 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:34:15,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:34:15,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1886866094, now seen corresponding path program 1 times [2024-11-10 09:34:15,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:34:15,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730294549] [2024-11-10 09:34:15,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:34:15,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:34:15,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:15,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:34:15,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:15,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:34:15,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:15,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:34:15,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:15,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:34:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:15,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:34:15,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:15,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:34:15,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:15,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:34:15,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:15,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:34:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:15,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:34:15,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:15,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:34:15,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:15,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:34:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:15,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:34:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:15,241 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:34:15,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:34:15,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730294549] [2024-11-10 09:34:15,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730294549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:34:15,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:34:15,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:34:15,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355325561] [2024-11-10 09:34:15,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:34:15,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:34:15,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:34:15,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:34:15,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:34:15,242 INFO L87 Difference]: Start difference. First operand 2099 states and 2914 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:15,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:34:15,405 INFO L93 Difference]: Finished difference Result 4252 states and 5901 transitions. [2024-11-10 09:34:15,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:34:15,406 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-10 09:34:15,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:34:15,423 INFO L225 Difference]: With dead ends: 4252 [2024-11-10 09:34:15,424 INFO L226 Difference]: Without dead ends: 2156 [2024-11-10 09:34:15,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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:34:15,431 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 564 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.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:34:15,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 564 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:34:15,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2024-11-10 09:34:15,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2156. [2024-11-10 09:34:15,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 1889 states have (on average 1.3313922710428798) internal successors, (2515), 1889 states have internal predecessors, (2515), 228 states have call successors, (228), 38 states have call predecessors, (228), 38 states have return successors, (228), 228 states have call predecessors, (228), 228 states have call successors, (228) [2024-11-10 09:34:15,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 2971 transitions. [2024-11-10 09:34:15,588 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 2971 transitions. Word has length 115 [2024-11-10 09:34:15,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:34:15,588 INFO L471 AbstractCegarLoop]: Abstraction has 2156 states and 2971 transitions. [2024-11-10 09:34:15,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:15,589 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 2971 transitions. [2024-11-10 09:34:15,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-10 09:34:15,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:34:15,590 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:34:15,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 09:34:15,591 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:34:15,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:34:15,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1319439459, now seen corresponding path program 1 times [2024-11-10 09:34:15,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:34:15,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003895722] [2024-11-10 09:34:15,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:34:15,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:34:15,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:15,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:34:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:15,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:34:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:15,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:34:15,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:15,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:34:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:15,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:34:15,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:15,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:34:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:15,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:34:15,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:15,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:34:15,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:15,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:34:15,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:15,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:34:15,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:15,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:34:15,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:15,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:34:15,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:15,888 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:34:15,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:34:15,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003895722] [2024-11-10 09:34:15,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003895722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:34:15,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:34:15,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 09:34:15,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345157629] [2024-11-10 09:34:15,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:34:15,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 09:34:15,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:34:15,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 09:34:15,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:34:15,892 INFO L87 Difference]: Start difference. First operand 2156 states and 2971 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:16,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:34:16,158 INFO L93 Difference]: Finished difference Result 3881 states and 5351 transitions. [2024-11-10 09:34:16,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:34:16,159 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-10 09:34:16,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:34:16,166 INFO L225 Difference]: With dead ends: 3881 [2024-11-10 09:34:16,166 INFO L226 Difference]: Without dead ends: 2172 [2024-11-10 09:34:16,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:34:16,171 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 228 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:34:16,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 680 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:34:16,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2172 states. [2024-11-10 09:34:16,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2172 to 2160. [2024-11-10 09:34:16,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2160 states, 1893 states have (on average 1.3306920232435289) internal successors, (2519), 1893 states have internal predecessors, (2519), 228 states have call successors, (228), 38 states have call predecessors, (228), 38 states have return successors, (228), 228 states have call predecessors, (228), 228 states have call successors, (228) [2024-11-10 09:34:16,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2160 states to 2160 states and 2975 transitions. [2024-11-10 09:34:16,324 INFO L78 Accepts]: Start accepts. Automaton has 2160 states and 2975 transitions. Word has length 115 [2024-11-10 09:34:16,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:34:16,324 INFO L471 AbstractCegarLoop]: Abstraction has 2160 states and 2975 transitions. [2024-11-10 09:34:16,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:16,325 INFO L276 IsEmpty]: Start isEmpty. Operand 2160 states and 2975 transitions. [2024-11-10 09:34:16,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-10 09:34:16,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:34:16,327 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:34:16,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-10 09:34:16,327 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:34:16,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:34:16,327 INFO L85 PathProgramCache]: Analyzing trace with hash -821895509, now seen corresponding path program 1 times [2024-11-10 09:34:16,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:34:16,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939581250] [2024-11-10 09:34:16,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:34:16,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:34:16,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:16,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:34:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:16,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:34:16,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:16,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:34:16,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:16,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:34:16,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:16,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:34:16,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:16,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:34:16,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:16,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:34:16,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:16,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:34:16,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:16,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:34:16,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:16,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:34:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:16,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:34:16,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:16,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:34:16,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:16,946 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:34:16,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:34:16,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939581250] [2024-11-10 09:34:16,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939581250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:34:16,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:34:16,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 09:34:16,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641742299] [2024-11-10 09:34:16,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:34:16,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 09:34:16,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:34:16,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 09:34:16,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-10 09:34:16,948 INFO L87 Difference]: Start difference. First operand 2160 states and 2975 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:17,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:34:17,604 INFO L93 Difference]: Finished difference Result 4030 states and 5549 transitions. [2024-11-10 09:34:17,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 09:34:17,605 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-10 09:34:17,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:34:17,612 INFO L225 Difference]: With dead ends: 4030 [2024-11-10 09:34:17,612 INFO L226 Difference]: Without dead ends: 2317 [2024-11-10 09:34:17,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2024-11-10 09:34:17,618 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 660 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 09:34:17,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 766 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 09:34:17,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2317 states. [2024-11-10 09:34:17,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2317 to 1694. [2024-11-10 09:34:17,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1694 states, 1483 states have (on average 1.3189480782198246) internal successors, (1956), 1483 states have internal predecessors, (1956), 180 states have call successors, (180), 30 states have call predecessors, (180), 30 states have return successors, (180), 180 states have call predecessors, (180), 180 states have call successors, (180) [2024-11-10 09:34:17,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1694 states and 2316 transitions. [2024-11-10 09:34:17,772 INFO L78 Accepts]: Start accepts. Automaton has 1694 states and 2316 transitions. Word has length 115 [2024-11-10 09:34:17,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:34:17,772 INFO L471 AbstractCegarLoop]: Abstraction has 1694 states and 2316 transitions. [2024-11-10 09:34:17,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:17,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 2316 transitions. [2024-11-10 09:34:17,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-10 09:34:17,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:34:17,775 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:34:17,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-10 09:34:17,776 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:34:17,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:34:17,776 INFO L85 PathProgramCache]: Analyzing trace with hash -311517119, now seen corresponding path program 1 times [2024-11-10 09:34:17,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:34:17,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298195152] [2024-11-10 09:34:17,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:34:17,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:34:17,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:17,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:34:17,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:17,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:34:17,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:17,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:34:17,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:17,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:34:17,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:17,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:34:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:17,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:34:17,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:17,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:34:17,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:17,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:34:17,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:17,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:34:17,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:17,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:34:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:17,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:34:17,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:17,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:34:17,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:17,989 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:34:17,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:34:17,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298195152] [2024-11-10 09:34:17,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298195152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:34:17,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:34:17,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 09:34:17,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115949263] [2024-11-10 09:34:17,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:34:17,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 09:34:17,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:34:17,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 09:34:17,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:34:17,991 INFO L87 Difference]: Start difference. First operand 1694 states and 2316 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:18,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:34:18,298 INFO L93 Difference]: Finished difference Result 2852 states and 3901 transitions. [2024-11-10 09:34:18,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:34:18,299 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2024-11-10 09:34:18,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:34:18,304 INFO L225 Difference]: With dead ends: 2852 [2024-11-10 09:34:18,304 INFO L226 Difference]: Without dead ends: 1710 [2024-11-10 09:34:18,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:34:18,307 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 130 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:34:18,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 951 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:34:18,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1710 states. [2024-11-10 09:34:18,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1710 to 1698. [2024-11-10 09:34:18,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1698 states, 1487 states have (on average 1.3180901143241426) internal successors, (1960), 1487 states have internal predecessors, (1960), 180 states have call successors, (180), 30 states have call predecessors, (180), 30 states have return successors, (180), 180 states have call predecessors, (180), 180 states have call successors, (180) [2024-11-10 09:34:18,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 1698 states and 2320 transitions. [2024-11-10 09:34:18,473 INFO L78 Accepts]: Start accepts. Automaton has 1698 states and 2320 transitions. Word has length 116 [2024-11-10 09:34:18,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:34:18,474 INFO L471 AbstractCegarLoop]: Abstraction has 1698 states and 2320 transitions. [2024-11-10 09:34:18,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:18,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1698 states and 2320 transitions. [2024-11-10 09:34:18,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-10 09:34:18,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:34:18,476 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:34:18,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-10 09:34:18,476 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:34:18,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:34:18,476 INFO L85 PathProgramCache]: Analyzing trace with hash -57144476, now seen corresponding path program 1 times [2024-11-10 09:34:18,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:34:18,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556324551] [2024-11-10 09:34:18,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:34:18,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:34:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:19,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:34:19,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:19,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:34:19,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:19,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:34:19,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:19,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:34:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:19,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:34:19,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:19,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:34:19,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:19,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:34:19,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:19,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:34:19,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:19,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:34:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:19,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:34:19,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:19,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:34:19,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:19,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:34:19,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:19,093 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:34:19,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:34:19,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556324551] [2024-11-10 09:34:19,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556324551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:34:19,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:34:19,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 09:34:19,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059700127] [2024-11-10 09:34:19,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:34:19,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 09:34:19,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:34:19,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 09:34:19,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:34:19,095 INFO L87 Difference]: Start difference. First operand 1698 states and 2320 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:19,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:34:19,862 INFO L93 Difference]: Finished difference Result 3144 states and 4279 transitions. [2024-11-10 09:34:19,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 09:34:19,863 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2024-11-10 09:34:19,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:34:19,868 INFO L225 Difference]: With dead ends: 3144 [2024-11-10 09:34:19,868 INFO L226 Difference]: Without dead ends: 1984 [2024-11-10 09:34:19,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2024-11-10 09:34:19,871 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 605 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 1574 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 09:34:19,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 1574 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 09:34:19,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1984 states. [2024-11-10 09:34:19,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1984 to 1444. [2024-11-10 09:34:19,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1444 states, 1261 states have (on average 1.3180015860428231) internal successors, (1662), 1261 states have internal predecessors, (1662), 156 states have call successors, (156), 26 states have call predecessors, (156), 26 states have return successors, (156), 156 states have call predecessors, (156), 156 states have call successors, (156) [2024-11-10 09:34:19,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 1974 transitions. [2024-11-10 09:34:19,973 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 1974 transitions. Word has length 116 [2024-11-10 09:34:19,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:34:19,974 INFO L471 AbstractCegarLoop]: Abstraction has 1444 states and 1974 transitions. [2024-11-10 09:34:19,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:19,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 1974 transitions. [2024-11-10 09:34:19,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-10 09:34:19,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:34:19,976 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:34:19,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-10 09:34:19,976 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:34:19,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:34:19,977 INFO L85 PathProgramCache]: Analyzing trace with hash -710763416, now seen corresponding path program 1 times [2024-11-10 09:34:19,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:34:19,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467538156] [2024-11-10 09:34:19,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:34:19,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:34:20,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:20,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:34:20,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:20,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:34:20,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:20,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:34:20,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:20,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:34:20,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:20,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:34:20,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:20,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:34:20,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:20,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:34:20,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:20,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:34:20,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:20,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:34:20,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:20,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:34:20,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:20,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:34:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:20,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:34:20,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:20,531 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:34:20,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:34:20,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467538156] [2024-11-10 09:34:20,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467538156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:34:20,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:34:20,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 09:34:20,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904680209] [2024-11-10 09:34:20,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:34:20,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 09:34:20,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:34:20,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 09:34:20,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:34:20,534 INFO L87 Difference]: Start difference. First operand 1444 states and 1974 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:21,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:34:21,028 INFO L93 Difference]: Finished difference Result 2586 states and 3530 transitions. [2024-11-10 09:34:21,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 09:34:21,029 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2024-11-10 09:34:21,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:34:21,035 INFO L225 Difference]: With dead ends: 2586 [2024-11-10 09:34:21,035 INFO L226 Difference]: Without dead ends: 1576 [2024-11-10 09:34:21,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-10 09:34:21,039 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 231 mSDsluCounter, 1192 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 1433 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 09:34:21,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 1433 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 09:34:21,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2024-11-10 09:34:21,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1444. [2024-11-10 09:34:21,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1444 states, 1261 states have (on average 1.3180015860428231) internal successors, (1662), 1261 states have internal predecessors, (1662), 156 states have call successors, (156), 26 states have call predecessors, (156), 26 states have return successors, (156), 156 states have call predecessors, (156), 156 states have call successors, (156) [2024-11-10 09:34:21,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 1974 transitions. [2024-11-10 09:34:21,183 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 1974 transitions. Word has length 116 [2024-11-10 09:34:21,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:34:21,183 INFO L471 AbstractCegarLoop]: Abstraction has 1444 states and 1974 transitions. [2024-11-10 09:34:21,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:21,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 1974 transitions. [2024-11-10 09:34:21,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-10 09:34:21,185 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:34:21,185 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:34:21,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-10 09:34:21,185 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:34:21,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:34:21,185 INFO L85 PathProgramCache]: Analyzing trace with hash 269190218, now seen corresponding path program 1 times [2024-11-10 09:34:21,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:34:21,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793685707] [2024-11-10 09:34:21,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:34:21,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:34:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:21,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:34:21,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:21,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:34:21,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:21,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:34:21,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:21,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:34:21,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:21,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:34:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:21,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:34:21,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:21,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:34:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:21,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:34:21,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:21,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:34:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:21,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:34:21,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:21,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:34:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:21,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:34:21,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:21,609 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:34:21,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:34:21,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793685707] [2024-11-10 09:34:21,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793685707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:34:21,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:34:21,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 09:34:21,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17731099] [2024-11-10 09:34:21,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:34:21,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 09:34:21,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:34:21,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 09:34:21,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:34:21,612 INFO L87 Difference]: Start difference. First operand 1444 states and 1974 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:22,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:34:22,091 INFO L93 Difference]: Finished difference Result 2826 states and 3850 transitions. [2024-11-10 09:34:22,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 09:34:22,092 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2024-11-10 09:34:22,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:34:22,098 INFO L225 Difference]: With dead ends: 2826 [2024-11-10 09:34:22,098 INFO L226 Difference]: Without dead ends: 1934 [2024-11-10 09:34:22,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2024-11-10 09:34:22,101 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 340 mSDsluCounter, 1138 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 1387 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 09:34:22,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 1387 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 09:34:22,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1934 states. [2024-11-10 09:34:22,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1934 to 1573. [2024-11-10 09:34:22,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1573 states, 1376 states have (on average 1.322674418604651) internal successors, (1820), 1376 states have internal predecessors, (1820), 168 states have call successors, (168), 28 states have call predecessors, (168), 28 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168) [2024-11-10 09:34:22,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2156 transitions. [2024-11-10 09:34:22,218 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2156 transitions. Word has length 117 [2024-11-10 09:34:22,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:34:22,219 INFO L471 AbstractCegarLoop]: Abstraction has 1573 states and 2156 transitions. [2024-11-10 09:34:22,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:22,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2156 transitions. [2024-11-10 09:34:22,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-10 09:34:22,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:34:22,221 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:34:22,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-10 09:34:22,221 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:34:22,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:34:22,221 INFO L85 PathProgramCache]: Analyzing trace with hash -241343959, now seen corresponding path program 1 times [2024-11-10 09:34:22,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:34:22,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451031588] [2024-11-10 09:34:22,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:34:22,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:34:22,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:22,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:34:22,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:22,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:34:22,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:22,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:34:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:22,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:34:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:22,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:34:22,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:22,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:34:22,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:22,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:34:22,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:22,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:34:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:22,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:34:22,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:22,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:34:22,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:22,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:34:22,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:22,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:34:22,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:22,785 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:34:22,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:34:22,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451031588] [2024-11-10 09:34:22,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451031588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:34:22,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:34:22,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 09:34:22,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141870976] [2024-11-10 09:34:22,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:34:22,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 09:34:22,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:34:22,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 09:34:22,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:34:22,787 INFO L87 Difference]: Start difference. First operand 1573 states and 2156 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:23,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:34:23,107 INFO L93 Difference]: Finished difference Result 2773 states and 3783 transitions. [2024-11-10 09:34:23,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 09:34:23,108 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2024-11-10 09:34:23,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:34:23,114 INFO L225 Difference]: With dead ends: 2773 [2024-11-10 09:34:23,114 INFO L226 Difference]: Without dead ends: 1751 [2024-11-10 09:34:23,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-10 09:34:23,117 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 84 mSDsluCounter, 998 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:34:23,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 1192 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:34:23,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1751 states. [2024-11-10 09:34:23,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1751 to 1444. [2024-11-10 09:34:23,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1444 states, 1261 states have (on average 1.3180015860428231) internal successors, (1662), 1261 states have internal predecessors, (1662), 156 states have call successors, (156), 26 states have call predecessors, (156), 26 states have return successors, (156), 156 states have call predecessors, (156), 156 states have call successors, (156) [2024-11-10 09:34:23,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 1974 transitions. [2024-11-10 09:34:23,224 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 1974 transitions. Word has length 117 [2024-11-10 09:34:23,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:34:23,225 INFO L471 AbstractCegarLoop]: Abstraction has 1444 states and 1974 transitions. [2024-11-10 09:34:23,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:23,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 1974 transitions. [2024-11-10 09:34:23,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-10 09:34:23,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:34:23,226 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:34:23,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-10 09:34:23,227 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:34:23,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:34:23,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1992432155, now seen corresponding path program 1 times [2024-11-10 09:34:23,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:34:23,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208985331] [2024-11-10 09:34:23,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:34:23,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:34:23,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:23,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:34:23,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:23,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:34:23,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:23,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:34:23,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:23,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:34:23,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:23,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:34:23,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:23,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:34:23,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:23,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:34:23,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:23,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:34:23,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:23,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:34:23,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:23,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:34:23,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:23,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:34:23,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:23,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:34:23,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:23,344 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:34:23,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:34:23,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208985331] [2024-11-10 09:34:23,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208985331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:34:23,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:34:23,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 09:34:23,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903727376] [2024-11-10 09:34:23,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:34:23,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 09:34:23,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:34:23,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 09:34:23,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:34:23,347 INFO L87 Difference]: Start difference. First operand 1444 states and 1974 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:23,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:34:23,417 INFO L93 Difference]: Finished difference Result 2226 states and 3034 transitions. [2024-11-10 09:34:23,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 09:34:23,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2024-11-10 09:34:23,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:34:23,422 INFO L225 Difference]: With dead ends: 2226 [2024-11-10 09:34:23,422 INFO L226 Difference]: Without dead ends: 775 [2024-11-10 09:34:23,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:34:23,424 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:34:23,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 287 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:34:23,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2024-11-10 09:34:23,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 765. [2024-11-10 09:34:23,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 666 states have (on average 1.2987987987987988) internal successors, (865), 666 states have internal predecessors, (865), 84 states have call successors, (84), 14 states have call predecessors, (84), 14 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-10 09:34:23,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1033 transitions. [2024-11-10 09:34:23,492 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1033 transitions. Word has length 117 [2024-11-10 09:34:23,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:34:23,493 INFO L471 AbstractCegarLoop]: Abstraction has 765 states and 1033 transitions. [2024-11-10 09:34:23,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:23,493 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1033 transitions. [2024-11-10 09:34:23,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-10 09:34:23,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:34:23,494 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:34:23,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-10 09:34:23,495 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:34:23,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:34:23,495 INFO L85 PathProgramCache]: Analyzing trace with hash -941045972, now seen corresponding path program 1 times [2024-11-10 09:34:23,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:34:23,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126703820] [2024-11-10 09:34:23,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:34:23,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:34:23,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:24,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:34:24,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:24,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:34:24,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:24,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:34:24,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:24,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:34:24,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:24,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:34:24,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:24,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:34:24,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:24,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:34:24,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:24,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:34:24,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:24,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:34:24,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:24,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:34:24,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:24,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:34:24,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:24,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:34:24,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:24,630 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:34:24,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:34:24,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126703820] [2024-11-10 09:34:24,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126703820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:34:24,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:34:24,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-10 09:34:24,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129821519] [2024-11-10 09:34:24,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:34:24,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 09:34:24,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:34:24,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 09:34:24,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-10 09:34:24,632 INFO L87 Difference]: Start difference. First operand 765 states and 1033 transitions. Second operand has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:25,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:34:25,394 INFO L93 Difference]: Finished difference Result 1777 states and 2386 transitions. [2024-11-10 09:34:25,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-10 09:34:25,395 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2024-11-10 09:34:25,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:34:25,399 INFO L225 Difference]: With dead ends: 1777 [2024-11-10 09:34:25,400 INFO L226 Difference]: Without dead ends: 1239 [2024-11-10 09:34:25,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2024-11-10 09:34:25,402 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 251 mSDsluCounter, 2713 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 2946 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 09:34:25,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 2946 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 09:34:25,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2024-11-10 09:34:25,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 1213. [2024-11-10 09:34:25,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1213 states, 1074 states have (on average 1.3054003724394785) internal successors, (1402), 1079 states have internal predecessors, (1402), 114 states have call successors, (114), 24 states have call predecessors, (114), 24 states have return successors, (114), 109 states have call predecessors, (114), 114 states have call successors, (114) [2024-11-10 09:34:25,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 1630 transitions. [2024-11-10 09:34:25,498 INFO L78 Accepts]: Start accepts. Automaton has 1213 states and 1630 transitions. Word has length 117 [2024-11-10 09:34:25,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:34:25,498 INFO L471 AbstractCegarLoop]: Abstraction has 1213 states and 1630 transitions. [2024-11-10 09:34:25,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:25,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1630 transitions. [2024-11-10 09:34:25,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-10 09:34:25,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:34:25,500 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:34:25,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-10 09:34:25,500 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:34:25,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:34:25,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1866350583, now seen corresponding path program 1 times [2024-11-10 09:34:25,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:34:25,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157612770] [2024-11-10 09:34:25,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:34:25,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:34:25,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 09:34:25,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [31928015] [2024-11-10 09:34:25,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:34:25,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:34:25,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:34:25,559 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:34:25,560 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:34:26,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:34:26,377 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 09:34:26,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:34:26,578 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 09:34:26,578 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 09:34:26,579 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 09:34:26,594 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:34:26,785 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,SelfDestructingSolverStorable32 [2024-11-10 09:34:26,789 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, 1, 1] [2024-11-10 09:34:26,928 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 09:34:26,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 09:34:26 BoogieIcfgContainer [2024-11-10 09:34:26,933 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 09:34:26,933 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 09:34:26,933 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 09:34:26,934 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 09:34:26,934 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:33:47" (3/4) ... [2024-11-10 09:34:26,936 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 09:34:26,938 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 09:34:26,938 INFO L158 Benchmark]: Toolchain (without parser) took 40819.38ms. Allocated memory was 176.2MB in the beginning and 1.2GB in the end (delta: 985.7MB). Free memory was 119.9MB in the beginning and 495.4MB in the end (delta: -375.5MB). Peak memory consumption was 613.2MB. Max. memory is 16.1GB. [2024-11-10 09:34:26,940 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 176.2MB. Free memory is still 138.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:34:26,940 INFO L158 Benchmark]: CACSL2BoogieTranslator took 343.59ms. Allocated memory is still 176.2MB. Free memory was 119.9MB in the beginning and 103.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 09:34:26,940 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.91ms. Allocated memory is still 176.2MB. Free memory was 103.1MB in the beginning and 98.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 09:34:26,941 INFO L158 Benchmark]: Boogie Preprocessor took 102.54ms. Allocated memory is still 176.2MB. Free memory was 98.9MB in the beginning and 94.6MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 09:34:26,941 INFO L158 Benchmark]: IcfgBuilder took 954.06ms. Allocated memory is still 176.2MB. Free memory was 94.1MB in the beginning and 120.0MB in the end (delta: -25.9MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. [2024-11-10 09:34:26,941 INFO L158 Benchmark]: TraceAbstraction took 39346.02ms. Allocated memory was 176.2MB in the beginning and 1.2GB in the end (delta: 985.7MB). Free memory was 119.0MB in the beginning and 495.4MB in the end (delta: -376.3MB). Peak memory consumption was 612.2MB. Max. memory is 16.1GB. [2024-11-10 09:34:26,941 INFO L158 Benchmark]: Witness Printer took 4.36ms. Allocated memory is still 1.2GB. Free memory is still 495.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:34:26,942 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 176.2MB. Free memory is still 138.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 343.59ms. Allocated memory is still 176.2MB. Free memory was 119.9MB in the beginning and 103.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.91ms. Allocated memory is still 176.2MB. Free memory was 103.1MB in the beginning and 98.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 102.54ms. Allocated memory is still 176.2MB. Free memory was 98.9MB in the beginning and 94.6MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 954.06ms. Allocated memory is still 176.2MB. Free memory was 94.1MB in the beginning and 120.0MB in the end (delta: -25.9MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. * TraceAbstraction took 39346.02ms. Allocated memory was 176.2MB in the beginning and 1.2GB in the end (delta: 985.7MB). Free memory was 119.0MB in the beginning and 495.4MB in the end (delta: -376.3MB). Peak memory consumption was 612.2MB. Max. memory is 16.1GB. * Witness Printer took 4.36ms. Allocated memory is still 1.2GB. Free memory is still 495.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 99, overapproximation of bitwiseOr at line 99, overapproximation of bitwiseAnd at line 56. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 99.25; [L22] float var_1_1 = 99.25; [L23] float* var_1_1_Pointer = &(var_1_1); [L24] signed short int var_1_7 = 18477; [L24] signed short int var_1_7 = 18477; [L25] signed short int* var_1_7_Pointer = &(var_1_7); [L26] signed short int var_1_8 = 5; [L26] signed short int var_1_8 = 5; [L27] signed short int* var_1_8_Pointer = &(var_1_8); [L28] float var_1_9 = 5.8; [L28] float var_1_9 = 5.8; [L29] float* var_1_9_Pointer = &(var_1_9); [L30] float var_1_10 = 0.5; [L30] float var_1_10 = 0.5; [L31] float* var_1_10_Pointer = &(var_1_10); [L32] unsigned char var_1_11 = 16; [L32] unsigned char var_1_11 = 16; [L33] unsigned char* var_1_11_Pointer = &(var_1_11); [L34] unsigned char var_1_12 = 50; [L34] unsigned char var_1_12 = 50; [L35] unsigned char* var_1_12_Pointer = &(var_1_12); [L36] unsigned char var_1_13 = 1; [L36] unsigned char var_1_13 = 1; [L37] unsigned char* var_1_13_Pointer = &(var_1_13); [L38] unsigned long int var_1_14 = 256; [L38] unsigned long int var_1_14 = 256; [L39] unsigned long int* var_1_14_Pointer = &(var_1_14); [L40] unsigned char var_1_15 = 0; [L40] unsigned char var_1_15 = 0; [L41] unsigned char* var_1_15_Pointer = &(var_1_15); [L42] unsigned char last_1_var_1_11 = 16; [L43] unsigned long int last_1_var_1_14 = 256; VAL [isInitial=0, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L103] isInitial = 1 [L104] FCALL initially() [L105] COND TRUE 1 [L106] CALL updateLastVariables() [L95] EXPR \read(var_1_11) [L95] last_1_var_1_11 = var_1_11 [L96] EXPR \read(var_1_14) [L96] last_1_var_1_14 = var_1_14 [L106] RET updateLastVariables() [L107] CALL updateVariables() [L74] var_1_7 = __VERIFIER_nondet_short() [L75] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L75] CALL assume_abort_if_not(var_1_7 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L75] RET assume_abort_if_not(var_1_7 >= 16383) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L76] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L76] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L76] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L77] var_1_8 = __VERIFIER_nondet_short() [L78] EXPR \read(var_1_8) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L78] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L78] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L79] EXPR \read(var_1_8) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L79] CALL assume_abort_if_not(var_1_8 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L79] RET assume_abort_if_not(var_1_8 <= 16383) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L80] var_1_9 = __VERIFIER_nondet_float() [L81] EXPR \read(var_1_9) [L81] EXPR var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L81] EXPR var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F [L81] EXPR \read(var_1_9) [L81] EXPR var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L81] EXPR (var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L81] EXPR (var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L81] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L81] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L82] var_1_10 = __VERIFIER_nondet_float() [L83] EXPR \read(var_1_10) [L83] EXPR var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L83] EXPR var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F [L83] EXPR \read(var_1_10) [L83] EXPR var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L83] EXPR (var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L83] EXPR (var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L83] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L83] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L84] var_1_12 = __VERIFIER_nondet_uchar() [L85] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L85] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L85] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L86] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L86] CALL assume_abort_if_not(var_1_12 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L86] RET assume_abort_if_not(var_1_12 <= 254) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L87] var_1_13 = __VERIFIER_nondet_uchar() [L88] EXPR \read(var_1_13) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L88] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L88] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] EXPR \read(var_1_13) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] CALL assume_abort_if_not(var_1_13 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] RET assume_abort_if_not(var_1_13 <= 254) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L90] var_1_15 = __VERIFIER_nondet_uchar() [L91] EXPR \read(var_1_15) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L91] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L91] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L92] EXPR \read(var_1_15) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L92] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L92] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L107] RET updateVariables() [L108] CALL step() [L47] EXPR \read(*var_1_8_Pointer) [L47] signed short int stepLocal_3 = (*(var_1_8_Pointer)); [L48] unsigned long int stepLocal_2 = last_1_var_1_14; VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_2=256, stepLocal_3=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L49] COND FALSE !(last_1_var_1_14 > stepLocal_3) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L56] EXPR \read(*var_1_11_Pointer) [L56] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L56] EXPR (*(var_1_11_Pointer)) & (*(var_1_7_Pointer)) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_2=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L56] EXPR \read(*var_1_12_Pointer) [L56] EXPR \read(*var_1_11_Pointer) [L56] EXPR \read(*var_1_11_Pointer) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L56] COND FALSE !(((*(var_1_11_Pointer)) & (*(var_1_7_Pointer))) > (((*(var_1_12_Pointer)) * last_1_var_1_14) * ((*(var_1_11_Pointer)) + (*(var_1_11_Pointer))))) [L61] EXPR \read(*var_1_7_Pointer) [L61] (*(var_1_14_Pointer)) = (*(var_1_7_Pointer)) [L63] EXPR \read(*var_1_11_Pointer) [L63] unsigned char stepLocal_1 = (*(var_1_11_Pointer)); [L64] EXPR \read(*var_1_11_Pointer) [L64] EXPR \read(*var_1_11_Pointer) [L64] EXPR \read(*var_1_14_Pointer) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L64] EXPR (((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer))) [L64] EXPR \read(*var_1_14_Pointer) [L64] EXPR (((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer))) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_1=16, stepLocal_2=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L64] EXPR (*(var_1_11_Pointer)) ^ (((((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer))))) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_1=16, stepLocal_2=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L64] unsigned long int stepLocal_0 = (*(var_1_11_Pointer)) ^ (((((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer))))); [L65] EXPR \read(*var_1_11_Pointer) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L65] COND FALSE !(stepLocal_0 != (*(var_1_11_Pointer))) [L70] (*(var_1_1_Pointer)) = 10.5f VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L108] RET step() [L109] CALL, EXPR property() [L99] EXPR \read(*var_1_11_Pointer) [L99] EXPR \read(*var_1_11_Pointer) [L99] EXPR \read(*var_1_14_Pointer) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L99] EXPR (((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer))) [L99] EXPR \read(*var_1_14_Pointer) [L99] EXPR (((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer))) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L99] EXPR (*(var_1_11_Pointer)) ^ (((((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer))))) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L99] EXPR \read(*var_1_11_Pointer) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L99] EXPR (((*(var_1_11_Pointer)) ^ (((((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer)))))) != (*(var_1_11_Pointer))) ? (((*(var_1_11_Pointer)) == ((*(var_1_11_Pointer)) - ((*(var_1_7_Pointer)) - (*(var_1_11_Pointer))))) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) 10.5f)) [L99] EXPR \read(*var_1_1_Pointer) [L99] EXPR (((*(var_1_11_Pointer)) ^ (((((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer)))))) != (*(var_1_11_Pointer))) ? (((*(var_1_11_Pointer)) == ((*(var_1_11_Pointer)) - ((*(var_1_7_Pointer)) - (*(var_1_11_Pointer))))) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) 10.5f)) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L99] EXPR ((((*(var_1_11_Pointer)) ^ (((((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer)))))) != (*(var_1_11_Pointer))) ? (((*(var_1_11_Pointer)) == ((*(var_1_11_Pointer)) - ((*(var_1_7_Pointer)) - (*(var_1_11_Pointer))))) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) 10.5f))) && ((last_1_var_1_14 > (*(var_1_8_Pointer))) ? ((((last_1_var_1_11 - (*(var_1_8_Pointer))) + (*(var_1_7_Pointer))) > last_1_var_1_14) ? ((*(var_1_11_Pointer)) == ((unsigned char) (((((*(var_1_12_Pointer))) < ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_11_Pointer)) == ((unsigned char) (*(var_1_12_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L99] EXPR ((((*(var_1_11_Pointer)) ^ (((((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer)))))) != (*(var_1_11_Pointer))) ? (((*(var_1_11_Pointer)) == ((*(var_1_11_Pointer)) - ((*(var_1_7_Pointer)) - (*(var_1_11_Pointer))))) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) 10.5f))) && ((last_1_var_1_14 > (*(var_1_8_Pointer))) ? ((((last_1_var_1_11 - (*(var_1_8_Pointer))) + (*(var_1_7_Pointer))) > last_1_var_1_14) ? ((*(var_1_11_Pointer)) == ((unsigned char) (((((*(var_1_12_Pointer))) < ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_11_Pointer)) == ((unsigned char) (*(var_1_12_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L99] EXPR (((((*(var_1_11_Pointer)) ^ (((((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer)))))) != (*(var_1_11_Pointer))) ? (((*(var_1_11_Pointer)) == ((*(var_1_11_Pointer)) - ((*(var_1_7_Pointer)) - (*(var_1_11_Pointer))))) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) 10.5f))) && ((last_1_var_1_14 > (*(var_1_8_Pointer))) ? ((((last_1_var_1_11 - (*(var_1_8_Pointer))) + (*(var_1_7_Pointer))) > last_1_var_1_14) ? ((*(var_1_11_Pointer)) == ((unsigned char) (((((*(var_1_12_Pointer))) < ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_11_Pointer)) == ((unsigned char) (*(var_1_12_Pointer))))) : 1)) && ((((*(var_1_11_Pointer)) & (*(var_1_7_Pointer))) > (((*(var_1_12_Pointer)) * last_1_var_1_14) * ((*(var_1_11_Pointer)) + (*(var_1_11_Pointer))))) ? (((*(var_1_15_Pointer)) && ((*(var_1_9_Pointer)) > (*(var_1_10_Pointer)))) ? ((*(var_1_14_Pointer)) == ((unsigned long int) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_14_Pointer)) == ((unsigned long int) (*(var_1_7_Pointer))))) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L99] EXPR (((((*(var_1_11_Pointer)) ^ (((((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer)))))) != (*(var_1_11_Pointer))) ? (((*(var_1_11_Pointer)) == ((*(var_1_11_Pointer)) - ((*(var_1_7_Pointer)) - (*(var_1_11_Pointer))))) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) 10.5f))) && ((last_1_var_1_14 > (*(var_1_8_Pointer))) ? ((((last_1_var_1_11 - (*(var_1_8_Pointer))) + (*(var_1_7_Pointer))) > last_1_var_1_14) ? ((*(var_1_11_Pointer)) == ((unsigned char) (((((*(var_1_12_Pointer))) < ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_11_Pointer)) == ((unsigned char) (*(var_1_12_Pointer))))) : 1)) && ((((*(var_1_11_Pointer)) & (*(var_1_7_Pointer))) > (((*(var_1_12_Pointer)) * last_1_var_1_14) * ((*(var_1_11_Pointer)) + (*(var_1_11_Pointer))))) ? (((*(var_1_15_Pointer)) && ((*(var_1_9_Pointer)) > (*(var_1_10_Pointer)))) ? ((*(var_1_14_Pointer)) == ((unsigned long int) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_14_Pointer)) == ((unsigned long int) (*(var_1_7_Pointer))))) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L99-L100] return (((((*(var_1_11_Pointer)) ^ (((((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer)))))) != (*(var_1_11_Pointer))) ? (((*(var_1_11_Pointer)) == ((*(var_1_11_Pointer)) - ((*(var_1_7_Pointer)) - (*(var_1_11_Pointer))))) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) 10.5f))) && ((last_1_var_1_14 > (*(var_1_8_Pointer))) ? ((((last_1_var_1_11 - (*(var_1_8_Pointer))) + (*(var_1_7_Pointer))) > last_1_var_1_14) ? ((*(var_1_11_Pointer)) == ((unsigned char) (((((*(var_1_12_Pointer))) < ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_11_Pointer)) == ((unsigned char) (*(var_1_12_Pointer))))) : 1)) && ((((*(var_1_11_Pointer)) & (*(var_1_7_Pointer))) > (((*(var_1_12_Pointer)) * last_1_var_1_14) * ((*(var_1_11_Pointer)) + (*(var_1_11_Pointer))))) ? (((*(var_1_15_Pointer)) && ((*(var_1_9_Pointer)) > (*(var_1_10_Pointer)))) ? ((*(var_1_14_Pointer)) == ((unsigned long int) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_14_Pointer)) == ((unsigned long int) (*(var_1_7_Pointer))))) ; [L109] RET, EXPR property() [L109] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 111 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 39.1s, OverallIterations: 33, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 16.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9897 SdHoareTripleChecker+Valid, 9.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9897 mSDsluCounter, 33694 SdHoareTripleChecker+Invalid, 7.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27398 mSDsCounter, 918 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11075 IncrementalHoareTripleChecker+Invalid, 11993 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 918 mSolverCounterUnsat, 6296 mSDtfsCounter, 11075 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1465 GetRequests, 1083 SyntacticMatches, 2 SemanticMatches, 380 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1251 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2160occurred in iteration=24, InterpolantAutomatonStates: 312, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.4s AutomataMinimizationTime, 32 MinimizatonAttempts, 5292 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 15.6s InterpolantComputationTime, 3979 NumberOfCodeBlocks, 3979 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 3821 ConstructedInterpolants, 0 QuantifiedInterpolants, 15360 SizeOfPredicates, 14 NumberOfNonLiveVariables, 490 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 34 InterpolantComputations, 31 PerfectInterpolantSequences, 8866/8976 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 09:34:27,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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-18.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 8167bb57c72da66729eaf4d0bfb99f298c96636d95817c5a55fbaebfee04d766 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:34:29,341 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:34:29,416 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 09:34:29,422 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:34:29,423 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:34:29,455 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:34:29,456 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:34:29,456 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:34:29,456 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:34:29,457 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:34:29,457 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:34:29,457 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:34:29,458 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:34:29,459 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:34:29,460 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:34:29,460 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:34:29,460 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:34:29,461 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:34:29,461 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:34:29,461 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:34:29,461 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:34:29,463 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:34:29,464 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:34:29,466 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 09:34:29,466 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 09:34:29,473 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:34:29,474 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 09:34:29,475 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:34:29,475 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:34:29,475 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:34:29,476 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:34:29,476 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:34:29,477 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:34:29,477 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:34:29,478 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:34:29,478 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:34:29,478 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:34:29,479 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:34:29,479 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 09:34:29,479 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 09:34:29,479 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:34:29,480 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:34:29,480 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:34:29,480 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:34:29,480 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 -> 8167bb57c72da66729eaf4d0bfb99f298c96636d95817c5a55fbaebfee04d766 [2024-11-10 09:34:29,785 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:34:29,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:34:29,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:34:29,813 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:34:29,813 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:34:29,815 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-18.i [2024-11-10 09:34:31,440 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:34:31,651 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:34:31,651 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-18.i [2024-11-10 09:34:31,663 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d283f4e3/f78e3dd1d748459aa42e2939f542dbec/FLAG46f92be44 [2024-11-10 09:34:32,005 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d283f4e3/f78e3dd1d748459aa42e2939f542dbec [2024-11-10 09:34:32,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:34:32,008 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:34:32,009 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:34:32,009 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:34:32,014 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:34:32,015 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:34:32" (1/1) ... [2024-11-10 09:34:32,015 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c665b12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:34:32, skipping insertion in model container [2024-11-10 09:34:32,016 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:34:32" (1/1) ... [2024-11-10 09:34:32,041 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:34:32,240 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-18.i[916,929] [2024-11-10 09:34:32,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:34:32,323 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:34:32,336 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-18.i[916,929] [2024-11-10 09:34:32,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:34:32,398 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:34:32,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:34:32 WrapperNode [2024-11-10 09:34:32,399 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:34:32,400 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:34:32,400 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:34:32,400 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:34:32,406 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:34:32" (1/1) ... [2024-11-10 09:34:32,428 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:34:32" (1/1) ... [2024-11-10 09:34:32,466 INFO L138 Inliner]: procedures = 36, calls = 148, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 459 [2024-11-10 09:34:32,467 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:34:32,468 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:34:32,468 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:34:32,468 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:34:32,477 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:34:32" (1/1) ... [2024-11-10 09:34:32,477 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:34:32" (1/1) ... [2024-11-10 09:34:32,486 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:34:32" (1/1) ... [2024-11-10 09:34:32,527 INFO L175 MemorySlicer]: Split 115 memory accesses to 11 slices as follows [2, 5, 14, 8, 12, 12, 26, 12, 8, 10, 6]. 23 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 13 writes are split as follows [0, 2, 1, 1, 1, 1, 2, 1, 1, 2, 1]. [2024-11-10 09:34:32,527 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:34:32" (1/1) ... [2024-11-10 09:34:32,528 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:34:32" (1/1) ... [2024-11-10 09:34:32,567 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:34:32" (1/1) ... [2024-11-10 09:34:32,568 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:34:32" (1/1) ... [2024-11-10 09:34:32,577 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:34:32" (1/1) ... [2024-11-10 09:34:32,583 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:34:32" (1/1) ... [2024-11-10 09:34:32,597 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:34:32,599 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:34:32,600 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:34:32,600 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:34:32,601 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:34:32" (1/1) ... [2024-11-10 09:34:32,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:34:32,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:34:32,634 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:34:32,637 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:34:32,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:34:32,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-10 09:34:32,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-10 09:34:32,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-10 09:34:32,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-10 09:34:32,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-10 09:34:32,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-10 09:34:32,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-10 09:34:32,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-10 09:34:32,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-11-10 09:34:32,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-11-10 09:34:32,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-11-10 09:34:32,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-10 09:34:32,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-10 09:34:32,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-10 09:34:32,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-10 09:34:32,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-10 09:34:32,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-10 09:34:32,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-10 09:34:32,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-11-10 09:34:32,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-11-10 09:34:32,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-11-10 09:34:32,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-11-10 09:34:32,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 09:34:32,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 09:34:32,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-10 09:34:32,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-10 09:34:32,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-10 09:34:32,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-10 09:34:32,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-10 09:34:32,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-10 09:34:32,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-11-10 09:34:32,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-11-10 09:34:32,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-11-10 09:34:32,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-10 09:34:32,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-10 09:34:32,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-10 09:34:32,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-10 09:34:32,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-10 09:34:32,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-10 09:34:32,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-10 09:34:32,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-11-10 09:34:32,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-11-10 09:34:32,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-11-10 09:34:32,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2024-11-10 09:34:32,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-10 09:34:32,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-10 09:34:32,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-10 09:34:32,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-10 09:34:32,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-10 09:34:32,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-10 09:34:32,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-11-10 09:34:32,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-11-10 09:34:32,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2024-11-10 09:34:32,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2024-11-10 09:34:32,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2024-11-10 09:34:32,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-10 09:34:32,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-10 09:34:32,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-10 09:34:32,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-10 09:34:32,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-10 09:34:32,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-10 09:34:32,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-10 09:34:32,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-11-10 09:34:32,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-11-10 09:34:32,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-11-10 09:34:32,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2024-11-10 09:34:32,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-10 09:34:32,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-10 09:34:32,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-10 09:34:32,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-10 09:34:32,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-10 09:34:32,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-10 09:34:32,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-11-10 09:34:32,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-11-10 09:34:32,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2024-11-10 09:34:32,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2024-11-10 09:34:32,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2024-11-10 09:34:32,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-10 09:34:32,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-10 09:34:32,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-10 09:34:32,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-10 09:34:32,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-10 09:34:32,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-10 09:34:32,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-11-10 09:34:32,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-11-10 09:34:32,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2024-11-10 09:34:32,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2024-11-10 09:34:32,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2024-11-10 09:34:32,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-10 09:34:32,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-10 09:34:32,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-10 09:34:32,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-10 09:34:32,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-10 09:34:32,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-10 09:34:32,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-11-10 09:34:32,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-11-10 09:34:32,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2024-11-10 09:34:32,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2024-11-10 09:34:32,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2024-11-10 09:34:32,696 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:34:32,696 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:34:32,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:34:32,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:34:32,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-10 09:34:32,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-10 09:34:32,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-10 09:34:32,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-10 09:34:32,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-10 09:34:32,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-10 09:34:32,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-10 09:34:32,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-10 09:34:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-11-10 09:34:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-11-10 09:34:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-11-10 09:34:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-10 09:34:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-10 09:34:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-10 09:34:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-10 09:34:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-10 09:34:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-10 09:34:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-11-10 09:34:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-11-10 09:34:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2024-11-10 09:34:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2024-11-10 09:34:32,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2024-11-10 09:34:32,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-10 09:34:32,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-10 09:34:32,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-10 09:34:32,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-10 09:34:32,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-10 09:34:32,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-10 09:34:32,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-10 09:34:32,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-11-10 09:34:32,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-11-10 09:34:32,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2024-11-10 09:34:32,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2024-11-10 09:34:32,915 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:34:32,917 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:34:33,653 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L99: havoc property_#t~mem78#1;havoc property_#t~mem73#1;havoc property_#t~mem74#1;havoc property_#t~ite77#1;havoc property_#t~mem75#1;havoc property_#t~mem76#1;havoc property_#t~mem79#1;havoc property_#t~ite92#1;havoc property_#t~mem83#1;havoc property_#t~mem82#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~ite90#1;havoc property_#t~mem89#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~ite88#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~mem91#1;havoc property_#t~mem93#1;havoc property_#t~ite105#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite104#1;havoc property_#t~mem101#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~ite100#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~mem103#1;havoc property_#t~mem102#1;havoc property_#t~short106#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~ite121#1;havoc property_#t~mem114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~short115#1;havoc property_#t~ite118#1;havoc property_#t~mem117#1;havoc property_#t~mem116#1;havoc property_#t~mem120#1;havoc property_#t~mem119#1;havoc property_#t~short122#1; [2024-11-10 09:34:33,702 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2024-11-10 09:34:33,703 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:34:33,721 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:34:33,721 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:34:33,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:34:33 BoogieIcfgContainer [2024-11-10 09:34:33,721 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:34:33,723 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:34:33,723 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:34:33,728 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:34:33,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:34:32" (1/3) ... [2024-11-10 09:34:33,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14360bcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:34:33, skipping insertion in model container [2024-11-10 09:34:33,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:34:32" (2/3) ... [2024-11-10 09:34:33,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14360bcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:34:33, skipping insertion in model container [2024-11-10 09:34:33,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:34:33" (3/3) ... [2024-11-10 09:34:33,732 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-18.i [2024-11-10 09:34:33,745 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:34:33,745 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:34:33,803 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:34:33,809 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;@3b601162, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:34:33,809 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:34:33,812 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 80 states have (on average 1.4125) internal successors, (113), 81 states have internal predecessors, (113), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 09:34:33,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-10 09:34:33,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:34:33,824 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:34:33,825 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:34:33,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:34:33,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1217543565, now seen corresponding path program 1 times [2024-11-10 09:34:33,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:34:33,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1590700187] [2024-11-10 09:34:33,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:34:33,841 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:34:33,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:34:33,842 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:34:33,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 09:34:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:34,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 09:34:34,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:34:34,275 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2024-11-10 09:34:34,277 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:34:34,277 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:34:34,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1590700187] [2024-11-10 09:34:34,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1590700187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:34:34,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:34:34,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:34:34,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537940899] [2024-11-10 09:34:34,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:34:34,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:34:34,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:34:34,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:34:34,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:34:34,316 INFO L87 Difference]: Start difference. First operand has 95 states, 80 states have (on average 1.4125) internal successors, (113), 81 states have internal predecessors, (113), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-10 09:34:34,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:34:34,341 INFO L93 Difference]: Finished difference Result 182 states and 279 transitions. [2024-11-10 09:34:34,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:34:34,343 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2024-11-10 09:34:34,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:34:34,351 INFO L225 Difference]: With dead ends: 182 [2024-11-10 09:34:34,352 INFO L226 Difference]: Without dead ends: 90 [2024-11-10 09:34:34,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 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:34:34,360 INFO L432 NwaCegarLoop]: 129 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, 129 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:34:34,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:34:34,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-10 09:34:34,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-10 09:34:34,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 76 states have (on average 1.381578947368421) internal successors, (105), 76 states have internal predecessors, (105), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 09:34:34,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 129 transitions. [2024-11-10 09:34:34,404 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 129 transitions. Word has length 105 [2024-11-10 09:34:34,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:34:34,405 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 129 transitions. [2024-11-10 09:34:34,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-10 09:34:34,406 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 129 transitions. [2024-11-10 09:34:34,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-10 09:34:34,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:34:34,410 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:34:34,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 09:34:34,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:34:34,611 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:34:34,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:34:34,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1413508617, now seen corresponding path program 1 times [2024-11-10 09:34:34,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:34:34,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1396031936] [2024-11-10 09:34:34,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:34:34,613 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:34:34,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:34:34,615 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:34:34,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 09:34:34,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:34,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 09:34:35,010 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:34:35,421 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 27 treesize of output 19 [2024-11-10 09:34:35,437 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 13 treesize of output 9 [2024-11-10 09:34:35,554 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 17 treesize of output 9 [2024-11-10 09:34:35,606 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-10 09:34:35,607 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:34:35,751 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:34:35,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1396031936] [2024-11-10 09:34:35,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1396031936] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:34:35,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [806242464] [2024-11-10 09:34:35,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:34:35,753 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 09:34:35,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 09:34:35,758 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 09:34:35,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-10 09:34:36,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:36,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 09:34:36,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:34:37,371 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 34 treesize of output 18 [2024-11-10 09:34:37,407 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:34:37,407 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:34:37,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [806242464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:34:37,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 09:34:37,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2024-11-10 09:34:37,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925210692] [2024-11-10 09:34:37,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:34:37,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:34:37,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:34:37,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:34:37,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2024-11-10 09:34:37,410 INFO L87 Difference]: Start difference. First operand 90 states and 129 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:37,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:34:37,638 INFO L93 Difference]: Finished difference Result 266 states and 384 transitions. [2024-11-10 09:34:37,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:34:37,639 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2024-11-10 09:34:37,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:34:37,642 INFO L225 Difference]: With dead ends: 266 [2024-11-10 09:34:37,642 INFO L226 Difference]: Without dead ends: 179 [2024-11-10 09:34:37,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2024-11-10 09:34:37,644 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 73 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:34:37,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 424 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:34:37,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-10 09:34:37,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 173. [2024-11-10 09:34:37,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 146 states have (on average 1.3835616438356164) internal successors, (202), 146 states have internal predecessors, (202), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 09:34:37,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 250 transitions. [2024-11-10 09:34:37,664 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 250 transitions. Word has length 105 [2024-11-10 09:34:37,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:34:37,665 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 250 transitions. [2024-11-10 09:34:37,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:37,665 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 250 transitions. [2024-11-10 09:34:37,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-10 09:34:37,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:34:37,667 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:34:37,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2024-11-10 09:34:37,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-10 09:34:38,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:34:38,069 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:34:38,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:34:38,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1924042794, now seen corresponding path program 1 times [2024-11-10 09:34:38,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:34:38,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678287908] [2024-11-10 09:34:38,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:34:38,073 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:34:38,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:34:38,077 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:34:38,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 09:34:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:38,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 09:34:38,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:34:38,644 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 27 treesize of output 19 [2024-11-10 09:34:38,649 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 13 treesize of output 9 [2024-11-10 09:34:38,699 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 17 treesize of output 9 [2024-11-10 09:34:38,769 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-10 09:34:38,770 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:34:38,928 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:34:38,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1678287908] [2024-11-10 09:34:38,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1678287908] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:34:38,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1715414560] [2024-11-10 09:34:38,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:34:38,929 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 09:34:38,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 09:34:38,931 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 09:34:38,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-10 09:34:39,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:39,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 09:34:39,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:34:40,308 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 34 treesize of output 18 [2024-11-10 09:34:40,344 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:34:40,345 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:34:40,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1715414560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:34:40,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 09:34:40,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2024-11-10 09:34:40,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451660691] [2024-11-10 09:34:40,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:34:40,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:34:40,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:34:40,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:34:40,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2024-11-10 09:34:40,348 INFO L87 Difference]: Start difference. First operand 173 states and 250 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:40,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:34:40,588 INFO L93 Difference]: Finished difference Result 351 states and 507 transitions. [2024-11-10 09:34:40,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:34:40,589 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2024-11-10 09:34:40,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:34:40,591 INFO L225 Difference]: With dead ends: 351 [2024-11-10 09:34:40,591 INFO L226 Difference]: Without dead ends: 181 [2024-11-10 09:34:40,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2024-11-10 09:34:40,593 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 69 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:34:40,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 420 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:34:40,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-10 09:34:40,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 175. [2024-11-10 09:34:40,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 148 states have (on average 1.3783783783783783) internal successors, (204), 148 states have internal predecessors, (204), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 09:34:40,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 252 transitions. [2024-11-10 09:34:40,616 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 252 transitions. Word has length 105 [2024-11-10 09:34:40,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:34:40,616 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 252 transitions. [2024-11-10 09:34:40,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:40,617 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 252 transitions. [2024-11-10 09:34:40,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-10 09:34:40,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:34:40,619 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:34:40,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-10 09:34:40,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2024-11-10 09:34:41,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-10 09:34:41,023 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:34:41,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:34:41,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1794960075, now seen corresponding path program 1 times [2024-11-10 09:34:41,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:34:41,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1075075303] [2024-11-10 09:34:41,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:34:41,025 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:34:41,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:34:41,029 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:34:41,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-10 09:34:41,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:41,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 09:34:41,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:34:41,549 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 27 treesize of output 19 [2024-11-10 09:34:41,552 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 13 treesize of output 9 [2024-11-10 09:34:41,589 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 17 treesize of output 9 [2024-11-10 09:34:41,637 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-10 09:34:41,638 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:34:41,743 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:34:41,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1075075303] [2024-11-10 09:34:41,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1075075303] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:34:41,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1563439708] [2024-11-10 09:34:41,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:34:41,743 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 09:34:41,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 09:34:41,746 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 09:34:41,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-10 09:34:42,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:42,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-10 09:34:42,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:34:43,174 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 21 [2024-11-10 09:34:43,235 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 35 treesize of output 19 [2024-11-10 09:34:43,283 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:34:43,283 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:34:43,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1563439708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:34:43,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 09:34:43,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 18 [2024-11-10 09:34:43,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956377652] [2024-11-10 09:34:43,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:34:43,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 09:34:43,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:34:43,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 09:34:43,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2024-11-10 09:34:43,286 INFO L87 Difference]: Start difference. First operand 175 states and 252 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:44,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:34:44,414 INFO L93 Difference]: Finished difference Result 442 states and 636 transitions. [2024-11-10 09:34:44,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 09:34:44,414 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2024-11-10 09:34:44,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:34:44,417 INFO L225 Difference]: With dead ends: 442 [2024-11-10 09:34:44,417 INFO L226 Difference]: Without dead ends: 270 [2024-11-10 09:34:44,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=81, Invalid=621, Unknown=0, NotChecked=0, Total=702 [2024-11-10 09:34:44,419 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 200 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1353 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 09:34:44,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1353 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 09:34:44,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-11-10 09:34:44,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 256. [2024-11-10 09:34:44,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 216 states have (on average 1.375) internal successors, (297), 216 states have internal predecessors, (297), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-10 09:34:44,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 369 transitions. [2024-11-10 09:34:44,455 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 369 transitions. Word has length 105 [2024-11-10 09:34:44,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:34:44,456 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 369 transitions. [2024-11-10 09:34:44,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:34:44,456 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 369 transitions. [2024-11-10 09:34:44,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-10 09:34:44,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:34:44,458 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:34:44,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-10 09:34:44,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2024-11-10 09:34:44,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-10 09:34:44,859 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:34:44,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:34:44,860 INFO L85 PathProgramCache]: Analyzing trace with hash 631590028, now seen corresponding path program 1 times [2024-11-10 09:34:44,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:34:44,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1417930259] [2024-11-10 09:34:44,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:34:44,861 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:34:44,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:34:44,864 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:34:44,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-10 09:34:45,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:45,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 09:34:45,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:34:45,258 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 27 treesize of output 19 [2024-11-10 09:34:45,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-10 09:34:45,289 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 17 treesize of output 9 [2024-11-10 09:34:45,309 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-10 09:34:45,310 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:34:45,399 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:34:45,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1417930259] [2024-11-10 09:34:45,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1417930259] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:34:45,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1910720061] [2024-11-10 09:34:45,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:34:45,400 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 09:34:45,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 09:34:45,401 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 09:34:45,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-11-10 09:34:45,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:34:45,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 09:34:45,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:34:45,998 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:34:46,580 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 17 treesize of output 13 [2024-11-10 09:34:46,583 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 23 treesize of output 15 [2024-11-10 09:34:46,609 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 17 treesize of output 9 [2024-11-10 09:34:46,624 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-10 09:34:46,625 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:34:46,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1910720061] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:34:46,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 09:34:46,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-11-10 09:34:46,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702524855] [2024-11-10 09:34:46,653 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 09:34:46,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 09:34:46,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:34:46,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 09:34:46,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2024-11-10 09:34:46,655 INFO L87 Difference]: Start difference. First operand 256 states and 369 transitions. Second operand has 15 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 2 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-10 09:34:47,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:34:47,871 INFO L93 Difference]: Finished difference Result 796 states and 1129 transitions. [2024-11-10 09:34:47,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-10 09:34:47,873 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 2 states have call predecessors, (24), 4 states have call successors, (24) Word has length 106 [2024-11-10 09:34:47,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:34:47,877 INFO L225 Difference]: With dead ends: 796 [2024-11-10 09:34:47,877 INFO L226 Difference]: Without dead ends: 543 [2024-11-10 09:34:47,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 241 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=276, Invalid=984, Unknown=0, NotChecked=0, Total=1260 [2024-11-10 09:34:47,879 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 790 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 790 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 09:34:47,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [790 Valid, 1043 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 09:34:47,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2024-11-10 09:34:47,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 528. [2024-11-10 09:34:47,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 443 states have (on average 1.3611738148984198) internal successors, (603), 443 states have internal predecessors, (603), 72 states have call successors, (72), 12 states have call predecessors, (72), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-10 09:34:47,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 747 transitions. [2024-11-10 09:34:47,931 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 747 transitions. Word has length 106 [2024-11-10 09:34:47,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:34:47,931 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 747 transitions. [2024-11-10 09:34:47,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 2 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-10 09:34:47,932 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 747 transitions. [2024-11-10 09:34:47,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-10 09:34:47,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:34:47,934 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:34:47,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-10 09:34:48,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0