./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-76.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26add9e-1c94-457f-b35d-c66188b941d0/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26add9e-1c94-457f-b35d-c66188b941d0/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26add9e-1c94-457f-b35d-c66188b941d0/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26add9e-1c94-457f-b35d-c66188b941d0/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-76.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26add9e-1c94-457f-b35d-c66188b941d0/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26add9e-1c94-457f-b35d-c66188b941d0/bin/uautomizer-verify-qhAvR1uOyd --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 dd98e02a958c2e630fe387017d194cc2d0adeeb7f7dbaa6eeae7739b76f0d917 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 16:28:58,293 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 16:28:58,395 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26add9e-1c94-457f-b35d-c66188b941d0/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 16:28:58,406 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 16:28:58,406 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 16:28:58,444 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 16:28:58,445 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 16:28:58,445 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 16:28:58,446 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 16:28:58,446 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 16:28:58,447 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 16:28:58,448 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 16:28:58,448 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 16:28:58,448 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 16:28:58,448 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 16:28:58,449 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 16:28:58,449 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 16:28:58,449 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 16:28:58,449 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 16:28:58,449 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 16:28:58,449 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 16:28:58,449 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 16:28:58,449 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 16:28:58,449 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 16:28:58,449 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 16:28:58,449 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 16:28:58,449 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 16:28:58,449 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 16:28:58,450 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 16:28:58,450 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 16:28:58,450 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 16:28:58,450 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 16:28:58,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:28:58,450 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 16:28:58,450 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 16:28:58,450 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 16:28:58,450 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 16:28:58,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 16:28:58,450 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 16:28:58,451 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 16:28:58,451 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 16:28:58,451 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 16:28:58,451 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26add9e-1c94-457f-b35d-c66188b941d0/bin/uautomizer-verify-qhAvR1uOyd 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 -> dd98e02a958c2e630fe387017d194cc2d0adeeb7f7dbaa6eeae7739b76f0d917 [2024-11-13 16:28:58,797 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 16:28:58,811 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 16:28:58,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 16:28:58,817 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 16:28:58,817 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 16:28:58,818 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26add9e-1c94-457f-b35d-c66188b941d0/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-76.i Unable to find full path for "g++" [2024-11-13 16:29:00,856 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 16:29:01,205 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 16:29:01,205 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26add9e-1c94-457f-b35d-c66188b941d0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-76.i [2024-11-13 16:29:01,221 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26add9e-1c94-457f-b35d-c66188b941d0/bin/uautomizer-verify-qhAvR1uOyd/data/8d385b408/ea12713a9332454db0f6aba0e1e93f27/FLAG911de344d [2024-11-13 16:29:01,241 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26add9e-1c94-457f-b35d-c66188b941d0/bin/uautomizer-verify-qhAvR1uOyd/data/8d385b408/ea12713a9332454db0f6aba0e1e93f27 [2024-11-13 16:29:01,246 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 16:29:01,248 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 16:29:01,250 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 16:29:01,250 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 16:29:01,255 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 16:29:01,256 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:29:01" (1/1) ... [2024-11-13 16:29:01,257 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@704822f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:29:01, skipping insertion in model container [2024-11-13 16:29:01,259 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:29:01" (1/1) ... [2024-11-13 16:29:01,279 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 16:29:01,461 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26add9e-1c94-457f-b35d-c66188b941d0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-76.i[916,929] [2024-11-13 16:29:01,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:29:01,610 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 16:29:01,625 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26add9e-1c94-457f-b35d-c66188b941d0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-76.i[916,929] [2024-11-13 16:29:01,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:29:01,728 INFO L204 MainTranslator]: Completed translation [2024-11-13 16:29:01,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:29:01 WrapperNode [2024-11-13 16:29:01,729 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 16:29:01,730 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 16:29:01,731 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 16:29:01,731 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 16:29:01,743 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:29:01" (1/1) ... [2024-11-13 16:29:01,760 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:29:01" (1/1) ... [2024-11-13 16:29:01,801 INFO L138 Inliner]: procedures = 29, calls = 138, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 417 [2024-11-13 16:29:01,801 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 16:29:01,802 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 16:29:01,802 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 16:29:01,802 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 16:29:01,813 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:29:01" (1/1) ... [2024-11-13 16:29:01,813 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:29:01" (1/1) ... [2024-11-13 16:29:01,818 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:29:01" (1/1) ... [2024-11-13 16:29:01,855 INFO L175 MemorySlicer]: Split 107 memory accesses to 6 slices as follows [2, 40, 15, 38, 6, 6]. 37 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 2, 4, 1, 1]. The 17 writes are split as follows [0, 7, 2, 6, 1, 1]. [2024-11-13 16:29:01,858 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:29:01" (1/1) ... [2024-11-13 16:29:01,858 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:29:01" (1/1) ... [2024-11-13 16:29:01,901 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:29:01" (1/1) ... [2024-11-13 16:29:01,909 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:29:01" (1/1) ... [2024-11-13 16:29:01,913 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:29:01" (1/1) ... [2024-11-13 16:29:01,915 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:29:01" (1/1) ... [2024-11-13 16:29:01,920 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 16:29:01,921 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 16:29:01,921 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 16:29:01,921 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 16:29:01,922 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:29:01" (1/1) ... [2024-11-13 16:29:01,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:29:01,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26add9e-1c94-457f-b35d-c66188b941d0/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:29:01,976 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26add9e-1c94-457f-b35d-c66188b941d0/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 16:29:01,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26add9e-1c94-457f-b35d-c66188b941d0/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 16:29:02,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 16:29:02,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-13 16:29:02,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-13 16:29:02,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-13 16:29:02,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-13 16:29:02,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-13 16:29:02,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-13 16:29:02,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 16:29:02,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 16:29:02,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-13 16:29:02,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-13 16:29:02,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-13 16:29:02,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-13 16:29:02,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-13 16:29:02,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-13 16:29:02,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-13 16:29:02,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-13 16:29:02,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-13 16:29:02,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-13 16:29:02,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 16:29:02,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 16:29:02,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-13 16:29:02,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-13 16:29:02,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-13 16:29:02,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-13 16:29:02,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-13 16:29:02,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-13 16:29:02,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-13 16:29:02,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-13 16:29:02,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-13 16:29:02,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-13 16:29:02,011 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 16:29:02,011 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 16:29:02,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 16:29:02,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 16:29:02,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 16:29:02,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-13 16:29:02,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-13 16:29:02,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-13 16:29:02,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 16:29:02,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 16:29:02,247 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 16:29:02,249 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 16:29:02,880 INFO L? ?]: Removed 93 outVars from TransFormulas that were not future-live. [2024-11-13 16:29:02,881 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 16:29:02,892 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 16:29:02,892 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 16:29:02,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:29:02 BoogieIcfgContainer [2024-11-13 16:29:02,893 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 16:29:02,896 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 16:29:02,896 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 16:29:02,901 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 16:29:02,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 04:29:01" (1/3) ... [2024-11-13 16:29:02,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a7ac2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:29:02, skipping insertion in model container [2024-11-13 16:29:02,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:29:01" (2/3) ... [2024-11-13 16:29:02,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a7ac2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:29:02, skipping insertion in model container [2024-11-13 16:29:02,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:29:02" (3/3) ... [2024-11-13 16:29:02,905 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-76.i [2024-11-13 16:29:02,920 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 16:29:02,921 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-76.i that has 2 procedures, 102 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 16:29:03,002 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 16:29:03,014 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;@7c29f291, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 16:29:03,014 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 16:29:03,018 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 85 states have internal predecessors, (119), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 16:29:03,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-13 16:29:03,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:29:03,029 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 16:29:03,030 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:29:03,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:29:03,034 INFO L85 PathProgramCache]: Analyzing trace with hash 182009789, now seen corresponding path program 1 times [2024-11-13 16:29:03,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:29:03,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317968439] [2024-11-13 16:29:03,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:29:03,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:29:03,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:03,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:29:03,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:03,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:29:03,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:03,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:29:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:03,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:29:03,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:03,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:29:03,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:03,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 16:29:03,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:03,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 16:29:03,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:03,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:29:03,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:03,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 16:29:03,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:03,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 16:29:03,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:03,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 16:29:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:03,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 16:29:03,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:03,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 16:29:03,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:03,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 16:29:03,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:03,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 16:29:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:03,430 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-13 16:29:03,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:29:03,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317968439] [2024-11-13 16:29:03,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317968439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:29:03,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:29:03,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:29:03,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770983651] [2024-11-13 16:29:03,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:29:03,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 16:29:03,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:29:03,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 16:29:03,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 16:29:03,467 INFO L87 Difference]: Start difference. First operand has 102 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 85 states have internal predecessors, (119), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-13 16:29:03,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:29:03,503 INFO L93 Difference]: Finished difference Result 193 states and 301 transitions. [2024-11-13 16:29:03,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 16:29:03,505 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 119 [2024-11-13 16:29:03,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:29:03,514 INFO L225 Difference]: With dead ends: 193 [2024-11-13 16:29:03,514 INFO L226 Difference]: Without dead ends: 94 [2024-11-13 16:29:03,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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-13 16:29:03,524 INFO L432 NwaCegarLoop]: 133 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, 133 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-13 16:29:03,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:29:03,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-13 16:29:03,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-13 16:29:03,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 77 states have internal predecessors, (103), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 16:29:03,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 133 transitions. [2024-11-13 16:29:03,582 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 133 transitions. Word has length 119 [2024-11-13 16:29:03,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:29:03,584 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 133 transitions. [2024-11-13 16:29:03,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-13 16:29:03,585 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 133 transitions. [2024-11-13 16:29:03,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-13 16:29:03,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:29:03,591 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 16:29:03,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 16:29:03,591 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:29:03,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:29:03,592 INFO L85 PathProgramCache]: Analyzing trace with hash -358641971, now seen corresponding path program 1 times [2024-11-13 16:29:03,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:29:03,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155336536] [2024-11-13 16:29:03,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:29:03,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:29:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:04,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:29:04,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:04,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:29:04,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:04,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:29:04,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:04,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:29:04,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:04,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:29:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:04,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 16:29:04,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:04,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 16:29:04,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:04,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:29:04,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:04,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 16:29:04,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:04,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 16:29:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:04,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 16:29:04,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:04,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 16:29:04,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:04,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 16:29:04,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:04,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 16:29:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:04,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 16:29:04,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:04,087 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-13 16:29:04,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:29:04,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155336536] [2024-11-13 16:29:04,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155336536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:29:04,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:29:04,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:29:04,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759973392] [2024-11-13 16:29:04,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:29:04,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:29:04,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:29:04,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:29:04,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:29:04,091 INFO L87 Difference]: Start difference. First operand 94 states and 133 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-13 16:29:04,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:29:04,135 INFO L93 Difference]: Finished difference Result 185 states and 263 transitions. [2024-11-13 16:29:04,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:29:04,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2024-11-13 16:29:04,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:29:04,137 INFO L225 Difference]: With dead ends: 185 [2024-11-13 16:29:04,138 INFO L226 Difference]: Without dead ends: 94 [2024-11-13 16:29:04,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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-13 16:29:04,139 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:29:04,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 258 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:29:04,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-13 16:29:04,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-13 16:29:04,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 77 states have internal predecessors, (102), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 16:29:04,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 132 transitions. [2024-11-13 16:29:04,159 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 132 transitions. Word has length 119 [2024-11-13 16:29:04,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:29:04,161 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 132 transitions. [2024-11-13 16:29:04,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-13 16:29:04,161 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 132 transitions. [2024-11-13 16:29:04,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-13 16:29:04,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:29:04,164 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 16:29:04,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 16:29:04,165 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:29:04,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:29:04,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1176290421, now seen corresponding path program 1 times [2024-11-13 16:29:04,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:29:04,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705521789] [2024-11-13 16:29:04,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:29:04,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:29:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:04,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:29:04,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:04,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:29:04,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:04,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:29:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:04,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:29:04,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:04,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:29:04,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:04,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 16:29:04,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:04,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 16:29:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:04,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:29:04,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:04,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 16:29:04,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:04,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 16:29:04,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:04,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 16:29:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:04,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 16:29:04,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:04,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 16:29:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:04,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 16:29:04,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:04,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 16:29:04,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:04,567 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-13 16:29:04,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:29:04,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705521789] [2024-11-13 16:29:04,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705521789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:29:04,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:29:04,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:29:04,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827021186] [2024-11-13 16:29:04,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:29:04,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:29:04,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:29:04,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:29:04,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:29:04,572 INFO L87 Difference]: Start difference. First operand 94 states and 132 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-13 16:29:04,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:29:04,621 INFO L93 Difference]: Finished difference Result 185 states and 261 transitions. [2024-11-13 16:29:04,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:29:04,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2024-11-13 16:29:04,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:29:04,627 INFO L225 Difference]: With dead ends: 185 [2024-11-13 16:29:04,628 INFO L226 Difference]: Without dead ends: 94 [2024-11-13 16:29:04,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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-13 16:29:04,632 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 257 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-13 16:29:04,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 257 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:29:04,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-13 16:29:04,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-13 16:29:04,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 77 states have internal predecessors, (101), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 16:29:04,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 131 transitions. [2024-11-13 16:29:04,651 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 131 transitions. Word has length 119 [2024-11-13 16:29:04,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:29:04,651 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 131 transitions. [2024-11-13 16:29:04,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-13 16:29:04,652 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 131 transitions. [2024-11-13 16:29:04,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-13 16:29:04,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:29:04,654 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 16:29:04,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 16:29:04,654 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:29:04,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:29:04,655 INFO L85 PathProgramCache]: Analyzing trace with hash 856866228, now seen corresponding path program 1 times [2024-11-13 16:29:04,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:29:04,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550603658] [2024-11-13 16:29:04,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:29:04,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:29:04,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:06,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:29:06,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:06,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:29:06,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:06,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:29:06,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:06,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:29:06,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:06,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:29:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:06,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 16:29:06,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:06,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 16:29:06,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:06,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:29:06,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:06,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 16:29:06,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:06,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 16:29:06,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:06,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 16:29:06,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:06,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 16:29:06,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:06,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 16:29:06,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:06,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 16:29:06,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:06,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 16:29:06,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:06,817 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-13 16:29:06,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:29:06,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550603658] [2024-11-13 16:29:06,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550603658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:29:06,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:29:06,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 16:29:06,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269210653] [2024-11-13 16:29:06,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:29:06,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 16:29:06,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:29:06,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 16:29:06,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-13 16:29:06,821 INFO L87 Difference]: Start difference. First operand 94 states and 131 transitions. Second operand has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-13 16:29:07,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:29:07,298 INFO L93 Difference]: Finished difference Result 238 states and 328 transitions. [2024-11-13 16:29:07,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 16:29:07,304 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 120 [2024-11-13 16:29:07,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:29:07,306 INFO L225 Difference]: With dead ends: 238 [2024-11-13 16:29:07,306 INFO L226 Difference]: Without dead ends: 147 [2024-11-13 16:29:07,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-13 16:29:07,308 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 129 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 16:29:07,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 676 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 16:29:07,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-13 16:29:07,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 108. [2024-11-13 16:29:07,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 90 states have (on average 1.3111111111111111) internal successors, (118), 90 states have internal predecessors, (118), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 16:29:07,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 148 transitions. [2024-11-13 16:29:07,323 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 148 transitions. Word has length 120 [2024-11-13 16:29:07,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:29:07,324 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 148 transitions. [2024-11-13 16:29:07,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-13 16:29:07,324 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 148 transitions. [2024-11-13 16:29:07,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-13 16:29:07,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:29:07,330 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 16:29:07,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 16:29:07,330 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:29:07,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:29:07,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1131085025, now seen corresponding path program 1 times [2024-11-13 16:29:07,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:29:07,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340922965] [2024-11-13 16:29:07,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:29:07,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:29:07,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:07,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:29:07,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:07,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:29:07,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:07,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:29:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:07,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:29:07,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:07,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:29:07,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:07,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 16:29:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:07,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 16:29:07,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:07,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:29:07,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:07,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 16:29:07,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:07,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 16:29:07,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:07,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 16:29:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:07,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 16:29:07,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:07,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 16:29:07,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:07,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 16:29:07,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:07,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 16:29:07,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:07,635 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-13 16:29:07,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:29:07,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340922965] [2024-11-13 16:29:07,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340922965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:29:07,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:29:07,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 16:29:07,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955105446] [2024-11-13 16:29:07,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:29:07,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 16:29:07,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:29:07,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 16:29:07,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 16:29:07,638 INFO L87 Difference]: Start difference. First operand 108 states and 148 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-13 16:29:07,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:29:07,699 INFO L93 Difference]: Finished difference Result 216 states and 297 transitions. [2024-11-13 16:29:07,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:29:07,701 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2024-11-13 16:29:07,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:29:07,704 INFO L225 Difference]: With dead ends: 216 [2024-11-13 16:29:07,705 INFO L226 Difference]: Without dead ends: 111 [2024-11-13 16:29:07,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 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-13 16:29:07,708 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:29:07,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 495 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:29:07,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-13 16:29:07,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-13 16:29:07,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 93 states have (on average 1.3010752688172043) internal successors, (121), 93 states have internal predecessors, (121), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 16:29:07,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 151 transitions. [2024-11-13 16:29:07,728 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 151 transitions. Word has length 122 [2024-11-13 16:29:07,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:29:07,728 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 151 transitions. [2024-11-13 16:29:07,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-13 16:29:07,729 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 151 transitions. [2024-11-13 16:29:07,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-13 16:29:07,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:29:07,731 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 16:29:07,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 16:29:07,732 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:29:07,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:29:07,732 INFO L85 PathProgramCache]: Analyzing trace with hash -376420113, now seen corresponding path program 1 times [2024-11-13 16:29:07,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:29:07,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384083199] [2024-11-13 16:29:07,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:29:07,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:29:07,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:07,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:29:07,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:08,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:29:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:08,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:29:08,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:08,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:29:08,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:08,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:29:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:08,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 16:29:08,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:08,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 16:29:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:08,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:29:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:08,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 16:29:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:08,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 16:29:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:08,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 16:29:08,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:08,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 16:29:08,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:08,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 16:29:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:08,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 16:29:08,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:08,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 16:29:08,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:08,056 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-13 16:29:08,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:29:08,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384083199] [2024-11-13 16:29:08,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384083199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:29:08,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:29:08,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 16:29:08,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087865445] [2024-11-13 16:29:08,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:29:08,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 16:29:08,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:29:08,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 16:29:08,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 16:29:08,061 INFO L87 Difference]: Start difference. First operand 111 states and 151 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-13 16:29:08,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:29:08,388 INFO L93 Difference]: Finished difference Result 298 states and 405 transitions. [2024-11-13 16:29:08,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:29:08,392 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2024-11-13 16:29:08,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:29:08,394 INFO L225 Difference]: With dead ends: 298 [2024-11-13 16:29:08,394 INFO L226 Difference]: Without dead ends: 190 [2024-11-13 16:29:08,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:29:08,395 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 112 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 16:29:08,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 524 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 16:29:08,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-13 16:29:08,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 111. [2024-11-13 16:29:08,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 93 states have internal predecessors, (120), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 16:29:08,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 150 transitions. [2024-11-13 16:29:08,411 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 150 transitions. Word has length 122 [2024-11-13 16:29:08,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:29:08,411 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 150 transitions. [2024-11-13 16:29:08,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-13 16:29:08,412 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 150 transitions. [2024-11-13 16:29:08,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-13 16:29:08,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:29:08,414 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 16:29:08,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 16:29:08,414 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:29:08,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:29:08,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1847476333, now seen corresponding path program 1 times [2024-11-13 16:29:08,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:29:08,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065898539] [2024-11-13 16:29:08,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:29:08,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:29:08,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:08,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:29:08,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:08,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:29:08,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:08,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:29:08,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:08,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:29:08,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:08,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:29:08,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:08,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 16:29:08,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:08,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 16:29:08,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:08,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:29:08,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:08,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 16:29:08,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:08,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 16:29:08,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:08,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 16:29:08,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:08,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 16:29:08,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:08,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 16:29:08,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:08,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 16:29:08,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:08,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 16:29:08,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:08,732 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-13 16:29:08,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:29:08,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065898539] [2024-11-13 16:29:08,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065898539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:29:08,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:29:08,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 16:29:08,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704779009] [2024-11-13 16:29:08,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:29:08,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:29:08,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:29:08,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:29:08,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:29:08,735 INFO L87 Difference]: Start difference. First operand 111 states and 150 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-13 16:29:08,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:29:08,805 INFO L93 Difference]: Finished difference Result 223 states and 302 transitions. [2024-11-13 16:29:08,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:29:08,809 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-13 16:29:08,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:29:08,810 INFO L225 Difference]: With dead ends: 223 [2024-11-13 16:29:08,810 INFO L226 Difference]: Without dead ends: 115 [2024-11-13 16:29:08,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:29:08,811 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:29:08,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 614 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:29:08,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-13 16:29:08,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2024-11-13 16:29:08,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 94 states have (on average 1.2872340425531914) internal successors, (121), 94 states have internal predecessors, (121), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 16:29:08,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 151 transitions. [2024-11-13 16:29:08,841 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 151 transitions. Word has length 124 [2024-11-13 16:29:08,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:29:08,841 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 151 transitions. [2024-11-13 16:29:08,842 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-13 16:29:08,842 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 151 transitions. [2024-11-13 16:29:08,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-13 16:29:08,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:29:08,844 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 16:29:08,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 16:29:08,844 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:29:08,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:29:08,845 INFO L85 PathProgramCache]: Analyzing trace with hash -2142169911, now seen corresponding path program 1 times [2024-11-13 16:29:08,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:29:08,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603529387] [2024-11-13 16:29:08,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:29:08,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:29:08,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:08,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:29:08,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:08,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:29:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:08,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:29:08,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:08,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:29:08,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:08,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:29:08,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:08,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 16:29:08,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:08,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 16:29:08,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:08,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:29:08,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:08,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 16:29:08,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:08,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 16:29:09,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:09,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 16:29:09,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:09,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 16:29:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:09,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 16:29:09,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:09,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 16:29:09,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:09,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 16:29:09,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:09,015 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-13 16:29:09,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:29:09,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603529387] [2024-11-13 16:29:09,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603529387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:29:09,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:29:09,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:29:09,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691868020] [2024-11-13 16:29:09,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:29:09,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:29:09,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:29:09,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:29:09,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:29:09,019 INFO L87 Difference]: Start difference. First operand 112 states and 151 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-13 16:29:09,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:29:09,045 INFO L93 Difference]: Finished difference Result 223 states and 303 transitions. [2024-11-13 16:29:09,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:29:09,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-13 16:29:09,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:29:09,048 INFO L225 Difference]: With dead ends: 223 [2024-11-13 16:29:09,048 INFO L226 Difference]: Without dead ends: 114 [2024-11-13 16:29:09,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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-13 16:29:09,049 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:29:09,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 254 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:29:09,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-13 16:29:09,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-13 16:29:09,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 96 states have (on average 1.28125) internal successors, (123), 96 states have internal predecessors, (123), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 16:29:09,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 153 transitions. [2024-11-13 16:29:09,065 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 153 transitions. Word has length 124 [2024-11-13 16:29:09,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:29:09,066 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 153 transitions. [2024-11-13 16:29:09,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-13 16:29:09,066 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 153 transitions. [2024-11-13 16:29:09,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-13 16:29:09,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:29:09,068 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 16:29:09,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 16:29:09,068 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:29:09,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:29:09,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1141680135, now seen corresponding path program 1 times [2024-11-13 16:29:09,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:29:09,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422149795] [2024-11-13 16:29:09,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:29:09,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:29:09,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:09,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:29:09,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:09,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:29:09,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:09,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:29:09,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:09,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:29:09,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:09,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:29:09,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:09,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 16:29:09,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:09,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 16:29:09,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:09,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:29:09,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:09,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 16:29:09,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:09,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 16:29:09,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:09,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 16:29:09,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:09,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 16:29:09,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:09,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 16:29:09,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:09,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 16:29:09,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:09,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 16:29:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:09,932 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-13 16:29:09,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:29:09,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422149795] [2024-11-13 16:29:09,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422149795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:29:09,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:29:09,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 16:29:09,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44920162] [2024-11-13 16:29:09,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:29:09,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 16:29:09,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:29:09,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 16:29:09,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 16:29:09,934 INFO L87 Difference]: Start difference. First operand 114 states and 153 transitions. Second operand has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-13 16:29:10,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:29:10,335 INFO L93 Difference]: Finished difference Result 278 states and 369 transitions. [2024-11-13 16:29:10,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 16:29:10,335 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2024-11-13 16:29:10,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:29:10,337 INFO L225 Difference]: With dead ends: 278 [2024-11-13 16:29:10,337 INFO L226 Difference]: Without dead ends: 167 [2024-11-13 16:29:10,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-13 16:29:10,339 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 128 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 16:29:10,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 674 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 16:29:10,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-13 16:29:10,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 113. [2024-11-13 16:29:10,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 95 states have internal predecessors, (121), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 16:29:10,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 151 transitions. [2024-11-13 16:29:10,356 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 151 transitions. Word has length 124 [2024-11-13 16:29:10,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:29:10,357 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 151 transitions. [2024-11-13 16:29:10,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-13 16:29:10,358 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 151 transitions. [2024-11-13 16:29:10,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-13 16:29:10,360 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:29:10,360 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 16:29:10,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 16:29:10,362 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:29:10,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:29:10,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1820988120, now seen corresponding path program 1 times [2024-11-13 16:29:10,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:29:10,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146939893] [2024-11-13 16:29:10,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:29:10,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:29:10,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:11,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:29:11,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:11,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:29:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:11,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:29:11,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:11,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:29:11,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:11,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:29:11,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:11,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 16:29:11,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:11,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 16:29:11,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:11,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:29:11,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:11,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 16:29:11,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:11,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 16:29:11,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:11,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 16:29:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:11,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 16:29:11,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:11,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 16:29:11,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:11,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 16:29:11,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:11,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 16:29:11,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:11,264 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-13 16:29:11,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:29:11,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146939893] [2024-11-13 16:29:11,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146939893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:29:11,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:29:11,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 16:29:11,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334571272] [2024-11-13 16:29:11,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:29:11,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:29:11,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:29:11,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:29:11,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:29:11,266 INFO L87 Difference]: Start difference. First operand 113 states and 151 transitions. Second operand has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-13 16:29:11,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:29:11,609 INFO L93 Difference]: Finished difference Result 297 states and 398 transitions. [2024-11-13 16:29:11,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 16:29:11,610 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 126 [2024-11-13 16:29:11,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:29:11,612 INFO L225 Difference]: With dead ends: 297 [2024-11-13 16:29:11,612 INFO L226 Difference]: Without dead ends: 187 [2024-11-13 16:29:11,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-13 16:29:11,613 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 97 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 16:29:11,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 655 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 16:29:11,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-13 16:29:11,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 115. [2024-11-13 16:29:11,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 97 states have (on average 1.2783505154639174) internal successors, (124), 97 states have internal predecessors, (124), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 16:29:11,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 154 transitions. [2024-11-13 16:29:11,628 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 154 transitions. Word has length 126 [2024-11-13 16:29:11,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:29:11,628 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 154 transitions. [2024-11-13 16:29:11,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-13 16:29:11,629 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 154 transitions. [2024-11-13 16:29:11,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-13 16:29:11,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:29:11,630 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 16:29:11,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 16:29:11,631 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:29:11,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:29:11,631 INFO L85 PathProgramCache]: Analyzing trace with hash -357496186, now seen corresponding path program 1 times [2024-11-13 16:29:11,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:29:11,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020335834] [2024-11-13 16:29:11,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:29:11,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:29:11,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:11,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:29:11,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:11,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:29:11,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:11,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:29:11,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:11,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:29:11,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:11,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:29:11,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:11,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 16:29:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:11,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 16:29:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:11,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:29:11,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:11,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 16:29:11,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:11,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 16:29:11,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:11,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 16:29:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:11,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 16:29:11,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:11,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 16:29:11,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:11,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 16:29:11,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:11,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 16:29:11,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:11,881 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-13 16:29:11,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:29:11,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020335834] [2024-11-13 16:29:11,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020335834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:29:11,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:29:11,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 16:29:11,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095100791] [2024-11-13 16:29:11,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:29:11,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 16:29:11,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:29:11,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 16:29:11,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:29:11,883 INFO L87 Difference]: Start difference. First operand 115 states and 154 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-13 16:29:11,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:29:11,940 INFO L93 Difference]: Finished difference Result 227 states and 305 transitions. [2024-11-13 16:29:11,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 16:29:11,941 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2024-11-13 16:29:11,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:29:11,942 INFO L225 Difference]: With dead ends: 227 [2024-11-13 16:29:11,942 INFO L226 Difference]: Without dead ends: 115 [2024-11-13 16:29:11,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:29:11,943 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:29:11,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 362 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:29:11,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-13 16:29:11,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-13 16:29:11,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 97 states have (on average 1.2577319587628866) internal successors, (122), 97 states have internal predecessors, (122), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 16:29:11,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 152 transitions. [2024-11-13 16:29:11,954 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 152 transitions. Word has length 126 [2024-11-13 16:29:11,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:29:11,954 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 152 transitions. [2024-11-13 16:29:11,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-13 16:29:11,954 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 152 transitions. [2024-11-13 16:29:11,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-13 16:29:11,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:29:11,956 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 16:29:11,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 16:29:11,956 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:29:11,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:29:11,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1273145660, now seen corresponding path program 1 times [2024-11-13 16:29:11,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:29:11,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188047652] [2024-11-13 16:29:11,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:29:11,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:29:12,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:13,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:29:13,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:13,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:29:13,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:13,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:29:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:13,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:29:13,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:13,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:29:13,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:13,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 16:29:13,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:13,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 16:29:13,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:13,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:29:13,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:13,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 16:29:13,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:13,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 16:29:13,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:13,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 16:29:13,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:13,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 16:29:13,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:13,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 16:29:13,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:13,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 16:29:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:13,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 16:29:13,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:13,282 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-13 16:29:13,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:29:13,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188047652] [2024-11-13 16:29:13,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188047652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:29:13,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:29:13,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 16:29:13,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109754662] [2024-11-13 16:29:13,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:29:13,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 16:29:13,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:29:13,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 16:29:13,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-13 16:29:13,285 INFO L87 Difference]: Start difference. First operand 115 states and 152 transitions. Second operand has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-13 16:29:13,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:29:13,881 INFO L93 Difference]: Finished difference Result 272 states and 355 transitions. [2024-11-13 16:29:13,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 16:29:13,882 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 126 [2024-11-13 16:29:13,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:29:13,884 INFO L225 Difference]: With dead ends: 272 [2024-11-13 16:29:13,884 INFO L226 Difference]: Without dead ends: 160 [2024-11-13 16:29:13,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-13 16:29:13,886 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 163 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 16:29:13,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 733 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 16:29:13,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-13 16:29:13,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 115. [2024-11-13 16:29:13,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 97 states have (on average 1.2474226804123711) internal successors, (121), 97 states have internal predecessors, (121), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 16:29:13,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 151 transitions. [2024-11-13 16:29:13,906 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 151 transitions. Word has length 126 [2024-11-13 16:29:13,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:29:13,907 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 151 transitions. [2024-11-13 16:29:13,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-13 16:29:13,908 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 151 transitions. [2024-11-13 16:29:13,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 16:29:13,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:29:13,910 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 16:29:13,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 16:29:13,911 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:29:13,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:29:13,911 INFO L85 PathProgramCache]: Analyzing trace with hash 262074580, now seen corresponding path program 1 times [2024-11-13 16:29:13,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:29:13,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106307221] [2024-11-13 16:29:13,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:29:13,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:29:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:15,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:29:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:15,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:29:15,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:15,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:29:15,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:15,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:29:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:15,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:29:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:15,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 16:29:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:15,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 16:29:15,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:15,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:29:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:15,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 16:29:15,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:15,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 16:29:15,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:15,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 16:29:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:15,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 16:29:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:15,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 16:29:15,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:15,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 16:29:15,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:15,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 16:29:15,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:15,279 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-13 16:29:15,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:29:15,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106307221] [2024-11-13 16:29:15,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106307221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:29:15,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:29:15,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 16:29:15,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444038069] [2024-11-13 16:29:15,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:29:15,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 16:29:15,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:29:15,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 16:29:15,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-13 16:29:15,283 INFO L87 Difference]: Start difference. First operand 115 states and 151 transitions. Second operand has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-13 16:29:16,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:29:16,042 INFO L93 Difference]: Finished difference Result 325 states and 426 transitions. [2024-11-13 16:29:16,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 16:29:16,043 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 128 [2024-11-13 16:29:16,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:29:16,044 INFO L225 Difference]: With dead ends: 325 [2024-11-13 16:29:16,045 INFO L226 Difference]: Without dead ends: 213 [2024-11-13 16:29:16,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-13 16:29:16,046 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 226 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 16:29:16,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 905 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 16:29:16,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-13 16:29:16,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 210. [2024-11-13 16:29:16,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 181 states have (on average 1.2541436464088398) internal successors, (227), 182 states have internal predecessors, (227), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 16:29:16,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 275 transitions. [2024-11-13 16:29:16,080 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 275 transitions. Word has length 128 [2024-11-13 16:29:16,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:29:16,080 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 275 transitions. [2024-11-13 16:29:16,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-13 16:29:16,081 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 275 transitions. [2024-11-13 16:29:16,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-13 16:29:16,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:29:16,083 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 16:29:16,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 16:29:16,083 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:29:16,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:29:16,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1187682453, now seen corresponding path program 1 times [2024-11-13 16:29:16,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:29:16,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22767162] [2024-11-13 16:29:16,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:29:16,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:29:16,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:16,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:29:16,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:16,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:29:16,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:16,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:29:16,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:16,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:29:16,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:16,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:29:16,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:16,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 16:29:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:16,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 16:29:16,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:16,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:29:16,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:16,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 16:29:16,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:16,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 16:29:16,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:16,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 16:29:16,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:16,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 16:29:16,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:16,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 16:29:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:16,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 16:29:16,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:16,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 16:29:16,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:16,331 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-13 16:29:16,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:29:16,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22767162] [2024-11-13 16:29:16,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22767162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:29:16,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:29:16,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 16:29:16,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244553051] [2024-11-13 16:29:16,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:29:16,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 16:29:16,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:29:16,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 16:29:16,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 16:29:16,334 INFO L87 Difference]: Start difference. First operand 210 states and 275 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-13 16:29:16,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:29:16,530 INFO L93 Difference]: Finished difference Result 423 states and 551 transitions. [2024-11-13 16:29:16,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:29:16,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2024-11-13 16:29:16,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:29:16,534 INFO L225 Difference]: With dead ends: 423 [2024-11-13 16:29:16,535 INFO L226 Difference]: Without dead ends: 216 [2024-11-13 16:29:16,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:29:16,537 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 79 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:29:16,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 597 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:29:16,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-13 16:29:16,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 214. [2024-11-13 16:29:16,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 184 states have (on average 1.2445652173913044) internal successors, (229), 185 states have internal predecessors, (229), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 16:29:16,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 277 transitions. [2024-11-13 16:29:16,579 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 277 transitions. Word has length 129 [2024-11-13 16:29:16,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:29:16,580 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 277 transitions. [2024-11-13 16:29:16,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-13 16:29:16,580 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 277 transitions. [2024-11-13 16:29:16,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-13 16:29:16,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:29:16,582 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 16:29:16,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 16:29:16,582 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:29:16,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:29:16,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1694663527, now seen corresponding path program 1 times [2024-11-13 16:29:16,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:29:16,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151310362] [2024-11-13 16:29:16,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:29:16,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:29:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:17,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:29:17,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:17,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:29:17,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:17,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:29:17,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:17,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:29:17,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:17,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:29:17,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:17,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 16:29:17,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:17,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 16:29:17,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:17,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:29:17,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:17,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 16:29:17,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:17,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 16:29:17,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:17,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 16:29:17,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:17,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 16:29:17,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:17,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 16:29:17,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:17,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 16:29:17,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:17,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 16:29:17,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:17,473 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-13 16:29:17,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:29:17,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151310362] [2024-11-13 16:29:17,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151310362] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:29:17,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:29:17,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 16:29:17,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882451286] [2024-11-13 16:29:17,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:29:17,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 16:29:17,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:29:17,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 16:29:17,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-13 16:29:17,476 INFO L87 Difference]: Start difference. First operand 214 states and 277 transitions. Second operand has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-13 16:29:17,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:29:17,696 INFO L93 Difference]: Finished difference Result 292 states and 370 transitions. [2024-11-13 16:29:17,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 16:29:17,696 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2024-11-13 16:29:17,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:29:17,698 INFO L225 Difference]: With dead ends: 292 [2024-11-13 16:29:17,699 INFO L226 Difference]: Without dead ends: 290 [2024-11-13 16:29:17,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-13 16:29:17,700 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 29 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:29:17,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 761 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:29:17,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-13 16:29:17,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 264. [2024-11-13 16:29:17,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 234 states have (on average 1.2222222222222223) internal successors, (286), 235 states have internal predecessors, (286), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 16:29:17,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 334 transitions. [2024-11-13 16:29:17,737 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 334 transitions. Word has length 130 [2024-11-13 16:29:17,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:29:17,737 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 334 transitions. [2024-11-13 16:29:17,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-13 16:29:17,738 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 334 transitions. [2024-11-13 16:29:17,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-13 16:29:17,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:29:17,740 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 16:29:17,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 16:29:17,740 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:29:17,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:29:17,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1463922438, now seen corresponding path program 1 times [2024-11-13 16:29:17,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:29:17,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172213307] [2024-11-13 16:29:17,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:29:17,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:29:17,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:17,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:29:17,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:17,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:29:17,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:17,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:29:17,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:17,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:29:17,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:17,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:29:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:17,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 16:29:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:17,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 16:29:17,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:17,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:29:17,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:17,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 16:29:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:17,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 16:29:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:18,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 16:29:18,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:18,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 16:29:18,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:18,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 16:29:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:18,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 16:29:18,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:18,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 16:29:18,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:18,018 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-13 16:29:18,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:29:18,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172213307] [2024-11-13 16:29:18,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172213307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:29:18,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:29:18,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 16:29:18,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241494317] [2024-11-13 16:29:18,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:29:18,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 16:29:18,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:29:18,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 16:29:18,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 16:29:18,023 INFO L87 Difference]: Start difference. First operand 264 states and 334 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-13 16:29:18,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:29:18,215 INFO L93 Difference]: Finished difference Result 521 states and 656 transitions. [2024-11-13 16:29:18,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:29:18,216 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2024-11-13 16:29:18,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:29:18,218 INFO L225 Difference]: With dead ends: 521 [2024-11-13 16:29:18,218 INFO L226 Difference]: Without dead ends: 260 [2024-11-13 16:29:18,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:29:18,222 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 73 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:29:18,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 545 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:29:18,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-13 16:29:18,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 258. [2024-11-13 16:29:18,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 227 states have (on average 1.2070484581497798) internal successors, (274), 228 states have internal predecessors, (274), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 16:29:18,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 322 transitions. [2024-11-13 16:29:18,289 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 322 transitions. Word has length 130 [2024-11-13 16:29:18,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:29:18,290 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 322 transitions. [2024-11-13 16:29:18,290 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-13 16:29:18,290 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 322 transitions. [2024-11-13 16:29:18,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-13 16:29:18,293 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:29:18,293 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 16:29:18,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 16:29:18,293 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:29:18,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:29:18,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1183940049, now seen corresponding path program 1 times [2024-11-13 16:29:18,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:29:18,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755641808] [2024-11-13 16:29:18,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:29:18,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:29:18,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:18,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:29:18,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:18,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:29:18,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:18,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:29:18,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:18,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:29:18,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:18,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:29:18,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:18,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 16:29:18,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:18,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 16:29:18,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:18,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:29:18,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:18,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 16:29:18,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:18,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 16:29:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:18,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 16:29:18,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:18,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 16:29:18,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:18,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 16:29:18,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:18,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 16:29:18,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:18,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 16:29:18,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:18,670 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-13 16:29:18,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:29:18,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755641808] [2024-11-13 16:29:18,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755641808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:29:18,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:29:18,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 16:29:18,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353841838] [2024-11-13 16:29:18,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:29:18,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 16:29:18,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:29:18,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 16:29:18,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-13 16:29:18,671 INFO L87 Difference]: Start difference. First operand 258 states and 322 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-13 16:29:18,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:29:18,920 INFO L93 Difference]: Finished difference Result 634 states and 791 transitions. [2024-11-13 16:29:18,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 16:29:18,921 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2024-11-13 16:29:18,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:29:18,923 INFO L225 Difference]: With dead ends: 634 [2024-11-13 16:29:18,924 INFO L226 Difference]: Without dead ends: 379 [2024-11-13 16:29:18,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-13 16:29:18,925 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 71 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:29:18,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1270 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:29:18,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-11-13 16:29:18,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 376. [2024-11-13 16:29:18,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 338 states have (on average 1.2071005917159763) internal successors, (408), 340 states have internal predecessors, (408), 29 states have call successors, (29), 8 states have call predecessors, (29), 8 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-13 16:29:18,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 466 transitions. [2024-11-13 16:29:18,976 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 466 transitions. Word has length 131 [2024-11-13 16:29:18,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:29:18,977 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 466 transitions. [2024-11-13 16:29:18,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-13 16:29:18,977 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 466 transitions. [2024-11-13 16:29:18,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-13 16:29:18,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:29:18,979 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 16:29:18,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 16:29:18,980 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:29:18,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:29:18,980 INFO L85 PathProgramCache]: Analyzing trace with hash 674466959, now seen corresponding path program 1 times [2024-11-13 16:29:18,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:29:18,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447986910] [2024-11-13 16:29:18,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:29:18,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:29:19,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:19,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:29:19,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:19,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:29:19,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:19,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:29:19,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:19,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:29:19,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:19,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:29:19,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:19,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 16:29:19,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:19,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 16:29:19,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:19,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:29:19,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:19,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 16:29:19,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:19,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 16:29:19,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:19,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 16:29:19,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:19,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 16:29:19,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:19,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 16:29:19,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:19,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 16:29:19,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:19,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 16:29:19,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:19,267 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-13 16:29:19,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:29:19,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447986910] [2024-11-13 16:29:19,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447986910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:29:19,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:29:19,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 16:29:19,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611272242] [2024-11-13 16:29:19,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:29:19,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 16:29:19,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:29:19,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 16:29:19,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 16:29:19,271 INFO L87 Difference]: Start difference. First operand 376 states and 466 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-13 16:29:19,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:29:19,575 INFO L93 Difference]: Finished difference Result 912 states and 1137 transitions. [2024-11-13 16:29:19,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:29:19,576 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2024-11-13 16:29:19,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:29:19,580 INFO L225 Difference]: With dead ends: 912 [2024-11-13 16:29:19,580 INFO L226 Difference]: Without dead ends: 539 [2024-11-13 16:29:19,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 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-13 16:29:19,581 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 134 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 16:29:19,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 444 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 16:29:19,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2024-11-13 16:29:19,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 377. [2024-11-13 16:29:19,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 339 states have (on average 1.1976401179941003) internal successors, (406), 341 states have internal predecessors, (406), 29 states have call successors, (29), 8 states have call predecessors, (29), 8 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-13 16:29:19,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 464 transitions. [2024-11-13 16:29:19,663 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 464 transitions. Word has length 131 [2024-11-13 16:29:19,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:29:19,664 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 464 transitions. [2024-11-13 16:29:19,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-13 16:29:19,664 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 464 transitions. [2024-11-13 16:29:19,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-13 16:29:19,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:29:19,667 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 16:29:19,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-13 16:29:19,667 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:29:19,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:29:19,668 INFO L85 PathProgramCache]: Analyzing trace with hash -628535183, now seen corresponding path program 1 times [2024-11-13 16:29:19,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:29:19,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080148058] [2024-11-13 16:29:19,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:29:19,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:29:19,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:19,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:29:19,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:19,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:29:19,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:19,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:29:19,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:19,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:29:19,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:19,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:29:19,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:19,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 16:29:19,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:19,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 16:29:19,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:19,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:29:19,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:19,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 16:29:19,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:19,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 16:29:19,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:19,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 16:29:19,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:19,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 16:29:19,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:19,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 16:29:19,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:19,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 16:29:19,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:19,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 16:29:19,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:19,910 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-13 16:29:19,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:29:19,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080148058] [2024-11-13 16:29:19,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080148058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:29:19,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:29:19,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 16:29:19,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664204029] [2024-11-13 16:29:19,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:29:19,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 16:29:19,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:29:19,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 16:29:19,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 16:29:19,913 INFO L87 Difference]: Start difference. First operand 377 states and 464 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-13 16:29:20,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:29:20,269 INFO L93 Difference]: Finished difference Result 861 states and 1067 transitions. [2024-11-13 16:29:20,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:29:20,270 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2024-11-13 16:29:20,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:29:20,274 INFO L225 Difference]: With dead ends: 861 [2024-11-13 16:29:20,274 INFO L226 Difference]: Without dead ends: 487 [2024-11-13 16:29:20,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:29:20,276 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 94 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 16:29:20,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 570 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 16:29:20,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2024-11-13 16:29:20,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 344. [2024-11-13 16:29:20,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 306 states have (on average 1.1797385620915033) internal successors, (361), 308 states have internal predecessors, (361), 29 states have call successors, (29), 8 states have call predecessors, (29), 8 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-13 16:29:20,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 419 transitions. [2024-11-13 16:29:20,335 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 419 transitions. Word has length 132 [2024-11-13 16:29:20,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:29:20,335 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 419 transitions. [2024-11-13 16:29:20,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-13 16:29:20,336 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 419 transitions. [2024-11-13 16:29:20,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-13 16:29:20,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:29:20,338 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 16:29:20,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-13 16:29:20,338 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:29:20,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:29:20,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1932690888, now seen corresponding path program 1 times [2024-11-13 16:29:20,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:29:20,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903116862] [2024-11-13 16:29:20,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:29:20,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:29:20,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:20,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:29:20,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:20,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:29:20,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:20,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:29:20,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:20,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:29:20,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:20,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:29:20,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:20,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 16:29:20,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:20,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 16:29:20,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:20,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:29:20,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:20,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 16:29:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:20,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 16:29:20,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:20,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 16:29:20,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:20,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 16:29:20,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:20,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 16:29:20,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:21,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 16:29:21,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:21,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 16:29:21,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:21,016 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-13 16:29:21,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:29:21,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903116862] [2024-11-13 16:29:21,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903116862] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:29:21,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451164301] [2024-11-13 16:29:21,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:29:21,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:29:21,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26add9e-1c94-457f-b35d-c66188b941d0/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:29:21,025 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26add9e-1c94-457f-b35d-c66188b941d0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:29:21,026 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26add9e-1c94-457f-b35d-c66188b941d0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 16:29:21,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:21,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-13 16:29:21,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:29:21,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2024-11-13 16:29:21,883 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:29:21,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 12 [2024-11-13 16:29:21,909 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 152 proven. 33 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-11-13 16:29:21,909 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:29:22,321 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-13 16:29:22,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451164301] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:29:22,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 16:29:22,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 14 [2024-11-13 16:29:22,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703874060] [2024-11-13 16:29:22,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 16:29:22,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 16:29:22,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:29:22,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 16:29:22,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-13 16:29:22,327 INFO L87 Difference]: Start difference. First operand 344 states and 419 transitions. Second operand has 14 states, 11 states have (on average 7.636363636363637) internal successors, (84), 14 states have internal predecessors, (84), 6 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (31), 3 states have call predecessors, (31), 6 states have call successors, (31) [2024-11-13 16:29:23,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:29:23,639 INFO L93 Difference]: Finished difference Result 652 states and 787 transitions. [2024-11-13 16:29:23,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-13 16:29:23,640 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 7.636363636363637) internal successors, (84), 14 states have internal predecessors, (84), 6 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (31), 3 states have call predecessors, (31), 6 states have call successors, (31) Word has length 132 [2024-11-13 16:29:23,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:29:23,643 INFO L225 Difference]: With dead ends: 652 [2024-11-13 16:29:23,643 INFO L226 Difference]: Without dead ends: 311 [2024-11-13 16:29:23,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 286 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=297, Invalid=963, Unknown=0, NotChecked=0, Total=1260 [2024-11-13 16:29:23,649 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 269 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 16:29:23,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 543 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 16:29:23,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-13 16:29:23,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 244. [2024-11-13 16:29:23,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 203 states have (on average 1.1280788177339902) internal successors, (229), 205 states have internal predecessors, (229), 29 states have call successors, (29), 11 states have call predecessors, (29), 11 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-13 16:29:23,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 287 transitions. [2024-11-13 16:29:23,713 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 287 transitions. Word has length 132 [2024-11-13 16:29:23,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:29:23,714 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 287 transitions. [2024-11-13 16:29:23,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 7.636363636363637) internal successors, (84), 14 states have internal predecessors, (84), 6 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (31), 3 states have call predecessors, (31), 6 states have call successors, (31) [2024-11-13 16:29:23,714 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 287 transitions. [2024-11-13 16:29:23,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-13 16:29:23,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:29:23,716 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 16:29:23,741 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26add9e-1c94-457f-b35d-c66188b941d0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-13 16:29:23,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26add9e-1c94-457f-b35d-c66188b941d0/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:29:23,917 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:29:23,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:29:23,918 INFO L85 PathProgramCache]: Analyzing trace with hash -90213177, now seen corresponding path program 1 times [2024-11-13 16:29:23,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:29:23,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297335356] [2024-11-13 16:29:23,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:29:23,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:29:23,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:23,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:29:23,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:23,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:29:23,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:23,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:29:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:24,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:29:24,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:24,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:29:24,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:24,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 16:29:24,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:24,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 16:29:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:24,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:29:24,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:24,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 16:29:24,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:24,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 16:29:24,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:24,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 16:29:24,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:24,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 16:29:24,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:24,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 16:29:24,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:24,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 16:29:24,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:24,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 16:29:24,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:24,029 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-13 16:29:24,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:29:24,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297335356] [2024-11-13 16:29:24,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297335356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:29:24,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:29:24,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:29:24,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903173683] [2024-11-13 16:29:24,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:29:24,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:29:24,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:29:24,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:29:24,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:29:24,032 INFO L87 Difference]: Start difference. First operand 244 states and 287 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-13 16:29:24,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:29:24,089 INFO L93 Difference]: Finished difference Result 488 states and 577 transitions. [2024-11-13 16:29:24,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:29:24,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 133 [2024-11-13 16:29:24,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:29:24,092 INFO L225 Difference]: With dead ends: 488 [2024-11-13 16:29:24,093 INFO L226 Difference]: Without dead ends: 247 [2024-11-13 16:29:24,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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-13 16:29:24,094 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:29:24,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 211 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:29:24,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-13 16:29:24,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2024-11-13 16:29:24,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 206 states have (on average 1.1262135922330097) internal successors, (232), 208 states have internal predecessors, (232), 29 states have call successors, (29), 11 states have call predecessors, (29), 11 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-13 16:29:24,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 290 transitions. [2024-11-13 16:29:24,142 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 290 transitions. Word has length 133 [2024-11-13 16:29:24,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:29:24,143 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 290 transitions. [2024-11-13 16:29:24,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-13 16:29:24,143 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 290 transitions. [2024-11-13 16:29:24,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-13 16:29:24,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:29:24,145 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 16:29:24,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-13 16:29:24,145 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:29:24,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:29:24,146 INFO L85 PathProgramCache]: Analyzing trace with hash -899559803, now seen corresponding path program 1 times [2024-11-13 16:29:24,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:29:24,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132717937] [2024-11-13 16:29:24,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:29:24,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:29:24,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:24,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:29:24,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:24,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:29:24,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:24,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:29:24,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:24,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:29:24,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:24,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:29:24,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:24,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 16:29:24,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:24,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 16:29:24,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:24,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 16:29:24,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:24,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 16:29:24,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:24,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 16:29:24,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:24,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 16:29:24,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:24,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 16:29:24,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:24,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 16:29:24,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:24,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 16:29:24,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:24,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 16:29:24,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:24,437 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-13 16:29:24,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:29:24,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132717937] [2024-11-13 16:29:24,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132717937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:29:24,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:29:24,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 16:29:24,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634176598] [2024-11-13 16:29:24,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:29:24,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 16:29:24,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:29:24,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 16:29:24,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 16:29:24,439 INFO L87 Difference]: Start difference. First operand 247 states and 290 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-13 16:29:24,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:29:24,677 INFO L93 Difference]: Finished difference Result 514 states and 603 transitions. [2024-11-13 16:29:24,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:29:24,678 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 133 [2024-11-13 16:29:24,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:29:24,679 INFO L225 Difference]: With dead ends: 514 [2024-11-13 16:29:24,679 INFO L226 Difference]: Without dead ends: 0 [2024-11-13 16:29:24,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:29:24,683 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 67 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 16:29:24,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 469 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 16:29:24,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-13 16:29:24,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-13 16:29:24,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:29:24,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-13 16:29:24,685 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 133 [2024-11-13 16:29:24,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:29:24,685 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-13 16:29:24,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-13 16:29:24,685 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-13 16:29:24,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 16:29:24,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 16:29:24,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-13 16:29:24,693 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] [2024-11-13 16:29:24,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-13 16:29:35,408 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 16:29:35,420 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-13 16:29:35,420 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-13 16:29:35,421 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-13 16:29:35,421 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-13 16:29:35,421 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-13 16:29:35,422 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-13 16:29:35,422 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-13 16:29:35,422 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-13 16:29:35,422 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#BOOL_unsigned_char_Array_0~0!base,GLOBAL]]] [2024-11-13 16:29:35,422 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#double_Array_0~0!offset [2024-11-13 16:29:35,422 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2024-11-13 16:29:35,422 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2024-11-13 16:29:35,422 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2024-11-13 16:29:35,422 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-13 16:29:35,422 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-13 16:29:35,422 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-13 16:29:35,422 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-13 16:29:35,422 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-13 16:29:35,422 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-13 16:29:35,422 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-13 16:29:35,423 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-13 16:29:35,423 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-13 16:29:35,423 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#double_Array_0~0!offset [2024-11-13 16:29:35,423 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-13 16:29:35,423 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-13 16:29:35,423 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#BOOL_unsigned_char_Array_0~0!base,GLOBAL]]] [2024-11-13 16:29:35,423 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-13 16:29:35,424 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-13 16:29:35,424 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#BOOL_unsigned_char_Array_0~0!base,GLOBAL]]] [2024-11-13 16:29:35,424 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-13 16:29:35,424 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-13 16:29:35,424 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#BOOL_unsigned_char_Array_0~0!base,GLOBAL]]] [2024-11-13 16:29:35,424 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-13 16:29:35,424 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-13 16:29:35,424 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-13 16:29:35,425 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-13 16:29:35,425 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-13 16:29:35,425 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-13 16:29:35,425 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-13 16:29:35,425 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-13 16:29:35,425 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-13 16:29:35,425 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-13 16:29:35,426 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-13 16:29:35,426 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-13 16:29:35,426 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-13 16:29:35,426 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-13 16:29:35,426 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-13 16:29:35,426 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-13 16:29:35,426 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-13 16:29:35,426 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-13 16:29:35,444 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-13 16:29:35,444 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-13 16:29:35,444 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-13 16:29:35,444 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-13 16:29:35,444 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-13 16:29:35,445 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-13 16:29:35,445 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-13 16:29:35,445 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-13 16:29:35,445 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#BOOL_unsigned_char_Array_0~0!base,GLOBAL]]] [2024-11-13 16:29:35,445 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#double_Array_0~0!offset [2024-11-13 16:29:35,445 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-13 16:29:35,445 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-13 16:29:35,445 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-13 16:29:35,446 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-13 16:29:35,446 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-13 16:29:35,446 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-13 16:29:35,446 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#double_Array_0~0!offset [2024-11-13 16:29:35,446 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-13 16:29:35,446 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-13 16:29:35,446 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#BOOL_unsigned_char_Array_0~0!base,GLOBAL]]] [2024-11-13 16:29:35,446 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-13 16:29:35,446 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-13 16:29:35,446 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-13 16:29:35,447 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-13 16:29:35,447 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-13 16:29:35,447 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-13 16:29:35,447 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-13 16:29:35,447 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-13 16:29:35,447 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-13 16:29:35,447 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-13 16:29:35,447 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-13 16:29:35,447 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-13 16:29:35,447 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-13 16:29:35,447 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-13 16:29:35,447 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-13 16:29:35,447 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-13 16:29:35,447 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-13 16:29:35,447 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-13 16:29:35,448 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-13 16:29:35,448 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-13 16:29:35,448 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-13 16:29:35,448 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-13 16:29:35,448 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-13 16:29:35,448 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-13 16:29:35,448 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#double_Array_0~0!offset [2024-11-13 16:29:35,448 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2024-11-13 16:29:35,448 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2024-11-13 16:29:35,448 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2024-11-13 16:29:35,448 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-13 16:29:35,448 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-13 16:29:35,448 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-13 16:29:35,449 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-13 16:29:35,449 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-13 16:29:35,449 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-13 16:29:35,450 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-13 16:29:35,450 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-13 16:29:35,450 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-13 16:29:35,450 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-13 16:29:35,450 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-13 16:29:35,450 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#BOOL_unsigned_char_Array_0~0!base,GLOBAL]]] [2024-11-13 16:29:35,450 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#double_Array_0~0!offset [2024-11-13 16:29:35,451 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-13 16:29:35,451 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-13 16:29:35,451 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-13 16:29:35,451 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-13 16:29:35,451 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-13 16:29:35,451 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-13 16:29:35,451 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#double_Array_0~0!offset [2024-11-13 16:29:35,451 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-13 16:29:35,452 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-13 16:29:35,452 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#BOOL_unsigned_char_Array_0~0!base,GLOBAL]]] [2024-11-13 16:29:35,452 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-13 16:29:35,452 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-13 16:29:35,452 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-13 16:29:35,452 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-13 16:29:35,452 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-13 16:29:35,452 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-13 16:29:35,453 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-13 16:29:35,453 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-13 16:29:35,453 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-13 16:29:35,453 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-13 16:29:35,453 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-13 16:29:35,453 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-13 16:29:35,453 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-13 16:29:35,453 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-13 16:29:35,453 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-13 16:29:35,453 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-13 16:29:35,454 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-13 16:29:35,454 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-13 16:29:35,454 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-13 16:29:35,454 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-13 16:29:35,454 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-13 16:29:35,454 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-13 16:29:35,454 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-13 16:29:35,454 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-13 16:29:35,455 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#double_Array_0~0!offset [2024-11-13 16:29:35,455 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2024-11-13 16:29:35,455 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2024-11-13 16:29:35,455 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2024-11-13 16:29:35,455 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-13 16:29:35,455 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-13 16:29:35,455 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2024-11-13 16:29:35,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 04:29:35 BoogieIcfgContainer [2024-11-13 16:29:35,460 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 16:29:35,461 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 16:29:35,461 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 16:29:35,461 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 16:29:35,462 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:29:02" (3/4) ... [2024-11-13 16:29:35,464 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 16:29:35,471 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-13 16:29:35,485 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-13 16:29:35,485 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-13 16:29:35,486 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-13 16:29:35,488 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-13 16:29:35,603 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26add9e-1c94-457f-b35d-c66188b941d0/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 16:29:35,604 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26add9e-1c94-457f-b35d-c66188b941d0/bin/uautomizer-verify-qhAvR1uOyd/witness.yml [2024-11-13 16:29:35,604 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 16:29:35,605 INFO L158 Benchmark]: Toolchain (without parser) took 34356.80ms. Allocated memory was 117.4MB in the beginning and 604.0MB in the end (delta: 486.5MB). Free memory was 91.4MB in the beginning and 362.5MB in the end (delta: -271.1MB). Peak memory consumption was 211.2MB. Max. memory is 16.1GB. [2024-11-13 16:29:35,605 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 83.9MB. Free memory is still 40.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:29:35,605 INFO L158 Benchmark]: CACSL2BoogieTranslator took 479.67ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 76.5MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 16:29:35,606 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.02ms. Allocated memory is still 117.4MB. Free memory was 76.5MB in the beginning and 73.4MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:29:35,606 INFO L158 Benchmark]: Boogie Preprocessor took 118.09ms. Allocated memory is still 117.4MB. Free memory was 73.4MB in the beginning and 69.1MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 16:29:35,606 INFO L158 Benchmark]: RCFGBuilder took 972.13ms. Allocated memory is still 117.4MB. Free memory was 69.1MB in the beginning and 41.8MB in the end (delta: 27.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 16:29:35,607 INFO L158 Benchmark]: TraceAbstraction took 32564.03ms. Allocated memory was 117.4MB in the beginning and 604.0MB in the end (delta: 486.5MB). Free memory was 40.9MB in the beginning and 370.9MB in the end (delta: -330.0MB). Peak memory consumption was 315.7MB. Max. memory is 16.1GB. [2024-11-13 16:29:35,607 INFO L158 Benchmark]: Witness Printer took 143.38ms. Allocated memory is still 604.0MB. Free memory was 370.9MB in the beginning and 362.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 16:29:35,609 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.30ms. Allocated memory is still 83.9MB. Free memory is still 40.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 479.67ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 76.5MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.02ms. Allocated memory is still 117.4MB. Free memory was 76.5MB in the beginning and 73.4MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 118.09ms. Allocated memory is still 117.4MB. Free memory was 73.4MB in the beginning and 69.1MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 972.13ms. Allocated memory is still 117.4MB. Free memory was 69.1MB in the beginning and 41.8MB in the end (delta: 27.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 32564.03ms. Allocated memory was 117.4MB in the beginning and 604.0MB in the end (delta: 486.5MB). Free memory was 40.9MB in the beginning and 370.9MB in the end (delta: -330.0MB). Peak memory consumption was 315.7MB. Max. memory is 16.1GB. * Witness Printer took 143.38ms. Allocated memory is still 604.0MB. Free memory was 370.9MB in the beginning and 362.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#BOOL_unsigned_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#double_Array_0~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#double_Array_0~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#BOOL_unsigned_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#BOOL_unsigned_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#BOOL_unsigned_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#BOOL_unsigned_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#double_Array_0~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#double_Array_0~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#BOOL_unsigned_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#double_Array_0~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#BOOL_unsigned_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#double_Array_0~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#double_Array_0~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#BOOL_unsigned_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#double_Array_0~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 102 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.7s, OverallIterations: 22, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1678 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1671 mSDsluCounter, 11950 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8774 mSDsCounter, 193 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2692 IncrementalHoareTripleChecker+Invalid, 2885 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 193 mSolverCounterUnsat, 3176 mSDtfsCounter, 2692 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1136 GetRequests, 996 SyntacticMatches, 4 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=377occurred in iteration=18, InterpolantAutomatonStates: 146, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 22 MinimizatonAttempts, 700 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 12.1s InterpolantComputationTime, 2912 NumberOfCodeBlocks, 2912 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 3020 ConstructedInterpolants, 0 QuantifiedInterpolants, 9370 SizeOfPredicates, 4 NumberOfNonLiveVariables, 450 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 24 InterpolantComputations, 21 PerfectInterpolantSequences, 9981/10080 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((cond != 0) && (((((((isInitial == \old(isInitial)) && (BOOL_unsigned_char_Array_0 == \old(BOOL_unsigned_char_Array_0))) && (double_Array_0 == \old(double_Array_0))) && (signed_char_Array_0 == \old(signed_char_Array_0))) && (signed_long_int_Array_0 == \old(signed_long_int_Array_0))) && (unsigned_char_Array_0 == \old(unsigned_char_Array_0))) && (last_1_signed_char_Array_0_1__0_ == \old(last_1_signed_char_Array_0_1__0_)))) RESULT: Ultimate proved your program to be correct! [2024-11-13 16:29:35,651 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26add9e-1c94-457f-b35d-c66188b941d0/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE