./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-56.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_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/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_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-56.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/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_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/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 b7631e67103b054fabd01a8c7dc28db4ad53089a3ed7fae04e9555b7ae75d07e --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 12:44:04,725 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 12:44:04,823 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 12:44:04,828 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 12:44:04,829 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 12:44:04,852 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 12:44:04,853 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 12:44:04,853 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 12:44:04,853 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 12:44:04,853 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 12:44:04,854 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 12:44:04,854 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 12:44:04,854 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 12:44:04,854 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 12:44:04,854 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 12:44:04,855 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 12:44:04,855 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 12:44:04,855 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 12:44:04,855 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 12:44:04,855 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 12:44:04,855 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 12:44:04,856 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 12:44:04,856 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 12:44:04,856 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 12:44:04,856 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 12:44:04,856 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 12:44:04,856 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 12:44:04,856 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 12:44:04,857 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 12:44:04,857 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 12:44:04,857 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 12:44:04,857 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 12:44:04,857 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:44:04,857 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 12:44:04,858 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 12:44:04,858 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 12:44:04,858 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 12:44:04,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 12:44:04,858 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 12:44:04,858 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 12:44:04,858 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 12:44:04,859 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 12:44:04,859 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_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/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 -> b7631e67103b054fabd01a8c7dc28db4ad53089a3ed7fae04e9555b7ae75d07e [2024-11-13 12:44:05,204 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 12:44:05,216 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 12:44:05,221 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 12:44:05,222 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 12:44:05,223 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 12:44:05,224 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-56.i Unable to find full path for "g++" [2024-11-13 12:44:07,159 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 12:44:07,476 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 12:44:07,478 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-56.i [2024-11-13 12:44:07,490 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/data/6cbb6aa64/6f3a80df48a143e994f47d76527467bd/FLAG157f5a30a [2024-11-13 12:44:07,514 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/data/6cbb6aa64/6f3a80df48a143e994f47d76527467bd [2024-11-13 12:44:07,517 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 12:44:07,519 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 12:44:07,521 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 12:44:07,521 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 12:44:07,527 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 12:44:07,528 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:44:07" (1/1) ... [2024-11-13 12:44:07,529 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a6eb215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:07, skipping insertion in model container [2024-11-13 12:44:07,531 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:44:07" (1/1) ... [2024-11-13 12:44:07,558 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 12:44:07,733 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_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-56.i[916,929] [2024-11-13 12:44:07,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:44:07,851 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 12:44:07,866 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_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-56.i[916,929] [2024-11-13 12:44:07,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:44:07,953 INFO L204 MainTranslator]: Completed translation [2024-11-13 12:44:07,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:07 WrapperNode [2024-11-13 12:44:07,954 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 12:44:07,955 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 12:44:07,956 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 12:44:07,956 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 12:44:07,966 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:07" (1/1) ... [2024-11-13 12:44:07,988 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:07" (1/1) ... [2024-11-13 12:44:08,027 INFO L138 Inliner]: procedures = 29, calls = 191, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 608 [2024-11-13 12:44:08,028 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 12:44:08,028 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 12:44:08,028 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 12:44:08,029 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 12:44:08,038 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:07" (1/1) ... [2024-11-13 12:44:08,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:07" (1/1) ... [2024-11-13 12:44:08,043 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:07" (1/1) ... [2024-11-13 12:44:08,069 INFO L175 MemorySlicer]: Split 147 memory accesses to 15 slices as follows [2, 9, 16, 8, 22, 20, 12, 3, 6, 6, 8, 6, 15, 8, 6]. 15 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 18 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1]. [2024-11-13 12:44:08,069 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:07" (1/1) ... [2024-11-13 12:44:08,069 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:07" (1/1) ... [2024-11-13 12:44:08,089 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:07" (1/1) ... [2024-11-13 12:44:08,094 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:07" (1/1) ... [2024-11-13 12:44:08,103 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:07" (1/1) ... [2024-11-13 12:44:08,106 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:07" (1/1) ... [2024-11-13 12:44:08,121 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 12:44:08,122 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 12:44:08,122 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 12:44:08,122 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 12:44:08,129 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:07" (1/1) ... [2024-11-13 12:44:08,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:44:08,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:44:08,176 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 12:44:08,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 12:44:08,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 12:44:08,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-13 12:44:08,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-13 12:44:08,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-13 12:44:08,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-13 12:44:08,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-13 12:44:08,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-13 12:44:08,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-13 12:44:08,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-11-13 12:44:08,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-11-13 12:44:08,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-11-13 12:44:08,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-11-13 12:44:08,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-11-13 12:44:08,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-11-13 12:44:08,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2024-11-13 12:44:08,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2024-11-13 12:44:08,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 12:44:08,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 12:44:08,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-13 12:44:08,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-13 12:44:08,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-13 12:44:08,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-13 12:44:08,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-13 12:44:08,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-13 12:44:08,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-13 12:44:08,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-13 12:44:08,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-13 12:44:08,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-13 12:44:08,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-13 12:44:08,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-11-13 12:44:08,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-11-13 12:44:08,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-13 12:44:08,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-13 12:44:08,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-13 12:44:08,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-13 12:44:08,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-13 12:44:08,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-13 12:44:08,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-13 12:44:08,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-11-13 12:44:08,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-11-13 12:44:08,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-11-13 12:44:08,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-11-13 12:44:08,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-11-13 12:44:08,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-11-13 12:44:08,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2024-11-13 12:44:08,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2024-11-13 12:44:08,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 12:44:08,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 12:44:08,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-13 12:44:08,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-13 12:44:08,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-13 12:44:08,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-13 12:44:08,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-13 12:44:08,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-13 12:44:08,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-13 12:44:08,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-13 12:44:08,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-13 12:44:08,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-13 12:44:08,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-13 12:44:08,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-11-13 12:44:08,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-11-13 12:44:08,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-13 12:44:08,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-13 12:44:08,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-13 12:44:08,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-13 12:44:08,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-13 12:44:08,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-13 12:44:08,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-13 12:44:08,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-11-13 12:44:08,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-11-13 12:44:08,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-11-13 12:44:08,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-11-13 12:44:08,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-11-13 12:44:08,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-11-13 12:44:08,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2024-11-13 12:44:08,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2024-11-13 12:44:08,214 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 12:44:08,214 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 12:44:08,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 12:44:08,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 12:44:08,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 12:44:08,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-13 12:44:08,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-13 12:44:08,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-13 12:44:08,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-13 12:44:08,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-13 12:44:08,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-13 12:44:08,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-13 12:44:08,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-13 12:44:08,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-13 12:44:08,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-13 12:44:08,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-13 12:44:08,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-11-13 12:44:08,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 12:44:08,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 12:44:08,479 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 12:44:08,481 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 12:44:09,305 INFO L? ?]: Removed 158 outVars from TransFormulas that were not future-live. [2024-11-13 12:44:09,306 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 12:44:09,321 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 12:44:09,321 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 12:44:09,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:44:09 BoogieIcfgContainer [2024-11-13 12:44:09,324 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 12:44:09,326 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 12:44:09,327 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 12:44:09,332 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 12:44:09,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 12:44:07" (1/3) ... [2024-11-13 12:44:09,333 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b4475c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:44:09, skipping insertion in model container [2024-11-13 12:44:09,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:07" (2/3) ... [2024-11-13 12:44:09,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b4475c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:44:09, skipping insertion in model container [2024-11-13 12:44:09,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:44:09" (3/3) ... [2024-11-13 12:44:09,335 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-56.i [2024-11-13 12:44:09,353 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 12:44:09,354 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-56.i that has 2 procedures, 126 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 12:44:09,436 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 12:44:09,452 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;@312d02e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 12:44:09,452 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 12:44:09,457 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 104 states have (on average 1.4326923076923077) internal successors, (149), 105 states have internal predecessors, (149), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-13 12:44:09,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 12:44:09,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:09,475 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:44:09,476 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:09,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:09,481 INFO L85 PathProgramCache]: Analyzing trace with hash 830359483, now seen corresponding path program 1 times [2024-11-13 12:44:09,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:09,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699486601] [2024-11-13 12:44:09,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:09,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:09,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:09,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:09,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:09,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:09,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:09,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:09,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:09,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:09,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:09,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:09,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:09,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:09,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:09,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:09,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:09,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:09,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:44:09,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:09,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 12:44:09,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:09,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:09,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:09,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:44:09,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:09,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:44:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:09,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:09,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:09,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 12:44:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:09,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 12:44:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:09,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:44:09,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:10,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:44:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:10,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:44:10,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:10,028 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:44:10,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:10,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699486601] [2024-11-13 12:44:10,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699486601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:10,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:10,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 12:44:10,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943246670] [2024-11-13 12:44:10,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:10,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 12:44:10,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:10,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 12:44:10,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 12:44:10,067 INFO L87 Difference]: Start difference. First operand has 126 states, 104 states have (on average 1.4326923076923077) internal successors, (149), 105 states have internal predecessors, (149), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-13 12:44:10,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:10,114 INFO L93 Difference]: Finished difference Result 245 states and 387 transitions. [2024-11-13 12:44:10,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:44:10,116 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 151 [2024-11-13 12:44:10,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:10,123 INFO L225 Difference]: With dead ends: 245 [2024-11-13 12:44:10,125 INFO L226 Difference]: Without dead ends: 122 [2024-11-13 12:44:10,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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 12:44:10,135 INFO L432 NwaCegarLoop]: 180 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, 180 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 12:44:10,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:44:10,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-13 12:44:10,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-13 12:44:10,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 101 states have (on average 1.4059405940594059) internal successors, (142), 101 states have internal predecessors, (142), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-13 12:44:10,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 180 transitions. [2024-11-13 12:44:10,203 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 180 transitions. Word has length 151 [2024-11-13 12:44:10,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:10,203 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 180 transitions. [2024-11-13 12:44:10,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-13 12:44:10,204 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 180 transitions. [2024-11-13 12:44:10,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 12:44:10,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:10,212 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:44:10,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 12:44:10,213 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:10,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:10,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1884468393, now seen corresponding path program 1 times [2024-11-13 12:44:10,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:10,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771242977] [2024-11-13 12:44:10,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:10,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:10,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:10,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:10,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:10,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:10,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:10,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:10,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:10,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:10,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:10,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:10,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:10,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:10,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:10,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:10,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:44:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:10,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 12:44:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:10,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:10,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:10,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:44:10,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:10,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:44:10,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:10,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:10,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:10,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 12:44:10,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:10,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 12:44:10,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:10,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:44:10,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:10,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:44:10,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:10,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:44:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:10,817 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:44:10,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:10,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771242977] [2024-11-13 12:44:10,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771242977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:10,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:10,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:44:10,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021031867] [2024-11-13 12:44:10,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:10,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:44:10,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:10,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:44:10,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:44:10,821 INFO L87 Difference]: Start difference. First operand 122 states and 180 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:44:10,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:10,875 INFO L93 Difference]: Finished difference Result 242 states and 359 transitions. [2024-11-13 12:44:10,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:44:10,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-11-13 12:44:10,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:10,877 INFO L225 Difference]: With dead ends: 242 [2024-11-13 12:44:10,877 INFO L226 Difference]: Without dead ends: 123 [2024-11-13 12:44:10,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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 12:44:10,883 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 352 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 12:44:10,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 352 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:44:10,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-13 12:44:10,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-13 12:44:10,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 102 states have (on average 1.4019607843137254) internal successors, (143), 102 states have internal predecessors, (143), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-13 12:44:10,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 181 transitions. [2024-11-13 12:44:10,911 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 181 transitions. Word has length 151 [2024-11-13 12:44:10,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:10,914 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 181 transitions. [2024-11-13 12:44:10,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:44:10,915 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 181 transitions. [2024-11-13 12:44:10,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 12:44:10,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:10,919 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:44:10,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 12:44:10,920 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:10,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:10,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1066819943, now seen corresponding path program 1 times [2024-11-13 12:44:10,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:10,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178643065] [2024-11-13 12:44:10,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:10,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:11,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:12,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:12,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:12,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:12,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:12,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:12,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:12,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:12,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:12,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:12,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:12,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:12,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:12,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:12,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:12,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:12,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:44:12,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:12,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 12:44:12,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:12,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:12,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:12,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:44:12,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:12,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:44:12,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:12,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:12,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:12,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 12:44:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:12,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 12:44:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:12,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:44:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:12,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:44:12,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:12,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:44:12,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:12,761 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:44:12,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:12,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178643065] [2024-11-13 12:44:12,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178643065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:12,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:12,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 12:44:12,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695804924] [2024-11-13 12:44:12,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:12,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 12:44:12,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:12,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 12:44:12,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-13 12:44:12,766 INFO L87 Difference]: Start difference. First operand 123 states and 181 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:44:13,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:13,120 INFO L93 Difference]: Finished difference Result 307 states and 454 transitions. [2024-11-13 12:44:13,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 12:44:13,122 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-11-13 12:44:13,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:13,124 INFO L225 Difference]: With dead ends: 307 [2024-11-13 12:44:13,124 INFO L226 Difference]: Without dead ends: 187 [2024-11-13 12:44:13,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-13 12:44:13,125 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 89 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 1652 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:13,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 1652 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 12:44:13,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-13 12:44:13,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 148. [2024-11-13 12:44:13,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 127 states have (on average 1.4330708661417322) internal successors, (182), 127 states have internal predecessors, (182), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-13 12:44:13,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 220 transitions. [2024-11-13 12:44:13,149 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 220 transitions. Word has length 151 [2024-11-13 12:44:13,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:13,150 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 220 transitions. [2024-11-13 12:44:13,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:44:13,150 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 220 transitions. [2024-11-13 12:44:13,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-13 12:44:13,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:13,155 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:44:13,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 12:44:13,155 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:13,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:13,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1006209775, now seen corresponding path program 1 times [2024-11-13 12:44:13,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:13,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417369785] [2024-11-13 12:44:13,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:13,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:13,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:13,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:13,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:13,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:13,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:13,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:44:13,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 12:44:13,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:13,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:44:13,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:44:13,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:13,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 12:44:13,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 12:44:13,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:44:13,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:44:13,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:44:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,410 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:44:13,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:13,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417369785] [2024-11-13 12:44:13,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417369785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:13,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:13,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:44:13,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938654142] [2024-11-13 12:44:13,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:13,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:44:13,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:13,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:44:13,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:44:13,412 INFO L87 Difference]: Start difference. First operand 148 states and 220 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:44:13,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:13,452 INFO L93 Difference]: Finished difference Result 294 states and 439 transitions. [2024-11-13 12:44:13,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:44:13,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2024-11-13 12:44:13,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:13,455 INFO L225 Difference]: With dead ends: 294 [2024-11-13 12:44:13,456 INFO L226 Difference]: Without dead ends: 149 [2024-11-13 12:44:13,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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 12:44:13,457 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:13,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 345 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:44:13,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-13 12:44:13,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2024-11-13 12:44:13,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 128 states have (on average 1.4296875) internal successors, (183), 128 states have internal predecessors, (183), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-13 12:44:13,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 221 transitions. [2024-11-13 12:44:13,477 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 221 transitions. Word has length 152 [2024-11-13 12:44:13,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:13,477 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 221 transitions. [2024-11-13 12:44:13,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:44:13,477 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 221 transitions. [2024-11-13 12:44:13,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-13 12:44:13,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:13,479 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:44:13,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 12:44:13,481 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:13,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:13,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1452288639, now seen corresponding path program 1 times [2024-11-13 12:44:13,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:13,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222853541] [2024-11-13 12:44:13,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:13,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:13,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:13,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:13,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:13,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:13,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:13,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:13,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:44:13,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 12:44:13,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:13,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:44:13,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:44:13,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:13,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 12:44:13,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 12:44:13,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:44:13,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:44:13,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:44:13,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:13,720 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:44:13,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:13,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222853541] [2024-11-13 12:44:13,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222853541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:13,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:13,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:44:13,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43087807] [2024-11-13 12:44:13,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:13,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:44:13,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:13,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:44:13,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:44:13,722 INFO L87 Difference]: Start difference. First operand 149 states and 221 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:44:13,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:13,766 INFO L93 Difference]: Finished difference Result 297 states and 443 transitions. [2024-11-13 12:44:13,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:44:13,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2024-11-13 12:44:13,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:13,771 INFO L225 Difference]: With dead ends: 297 [2024-11-13 12:44:13,771 INFO L226 Difference]: Without dead ends: 151 [2024-11-13 12:44:13,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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 12:44:13,774 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:13,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 344 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:44:13,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-13 12:44:13,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2024-11-13 12:44:13,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 130 states have (on average 1.4230769230769231) internal successors, (185), 130 states have internal predecessors, (185), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-13 12:44:13,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 223 transitions. [2024-11-13 12:44:13,792 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 223 transitions. Word has length 152 [2024-11-13 12:44:13,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:13,793 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 223 transitions. [2024-11-13 12:44:13,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:44:13,793 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 223 transitions. [2024-11-13 12:44:13,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-13 12:44:13,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:13,796 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:44:13,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 12:44:13,796 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:13,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:13,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1782226252, now seen corresponding path program 1 times [2024-11-13 12:44:13,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:13,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728106249] [2024-11-13 12:44:13,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:13,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:13,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:14,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:14,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:14,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:14,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:14,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:14,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:14,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:14,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:14,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:14,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:14,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:14,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:14,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:14,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:14,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:14,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:14,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:44:14,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:14,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 12:44:14,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:14,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:14,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:14,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:44:14,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:14,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:44:14,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:14,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:14,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 12:44:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:14,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 12:44:14,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:14,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:44:14,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:14,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:44:14,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:14,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:44:14,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:14,161 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:44:14,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:14,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728106249] [2024-11-13 12:44:14,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728106249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:14,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:14,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:44:14,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054873112] [2024-11-13 12:44:14,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:14,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:44:14,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:14,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:44:14,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:44:14,163 INFO L87 Difference]: Start difference. First operand 151 states and 223 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:44:14,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:14,211 INFO L93 Difference]: Finished difference Result 302 states and 447 transitions. [2024-11-13 12:44:14,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:44:14,218 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-13 12:44:14,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:14,220 INFO L225 Difference]: With dead ends: 302 [2024-11-13 12:44:14,220 INFO L226 Difference]: Without dead ends: 154 [2024-11-13 12:44:14,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 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 12:44:14,221 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 691 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 12:44:14,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 691 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:44:14,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-13 12:44:14,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-11-13 12:44:14,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 133 states have (on average 1.413533834586466) internal successors, (188), 133 states have internal predecessors, (188), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-13 12:44:14,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 226 transitions. [2024-11-13 12:44:14,236 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 226 transitions. Word has length 153 [2024-11-13 12:44:14,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:14,237 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 226 transitions. [2024-11-13 12:44:14,237 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:44:14,237 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 226 transitions. [2024-11-13 12:44:14,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-13 12:44:14,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:14,239 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:44:14,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 12:44:14,239 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:14,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:14,239 INFO L85 PathProgramCache]: Analyzing trace with hash 918614753, now seen corresponding path program 1 times [2024-11-13 12:44:14,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:14,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889655134] [2024-11-13 12:44:14,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:14,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:14,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:15,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:15,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:15,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:15,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:15,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:15,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:15,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:44:15,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 12:44:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:15,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:44:15,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:44:15,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:15,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 12:44:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 12:44:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:44:15,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:44:15,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:44:15,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:15,529 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:44:15,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:15,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889655134] [2024-11-13 12:44:15,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889655134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:15,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:15,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 12:44:15,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579274229] [2024-11-13 12:44:15,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:15,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 12:44:15,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:15,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 12:44:15,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-13 12:44:15,533 INFO L87 Difference]: Start difference. First operand 154 states and 226 transitions. Second operand has 10 states, 9 states have (on average 6.777777777777778) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-13 12:44:16,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:16,347 INFO L93 Difference]: Finished difference Result 375 states and 551 transitions. [2024-11-13 12:44:16,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:44:16,353 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.777777777777778) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 153 [2024-11-13 12:44:16,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:16,355 INFO L225 Difference]: With dead ends: 375 [2024-11-13 12:44:16,355 INFO L226 Difference]: Without dead ends: 224 [2024-11-13 12:44:16,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-11-13 12:44:16,356 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 560 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:16,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 845 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 12:44:16,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-13 12:44:16,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 178. [2024-11-13 12:44:16,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 157 states have (on average 1.4394904458598725) internal successors, (226), 157 states have internal predecessors, (226), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-13 12:44:16,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 264 transitions. [2024-11-13 12:44:16,383 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 264 transitions. Word has length 153 [2024-11-13 12:44:16,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:16,384 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 264 transitions. [2024-11-13 12:44:16,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.777777777777778) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-13 12:44:16,384 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 264 transitions. [2024-11-13 12:44:16,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-13 12:44:16,386 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:16,386 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:44:16,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 12:44:16,386 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:16,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:16,387 INFO L85 PathProgramCache]: Analyzing trace with hash -2096488865, now seen corresponding path program 1 times [2024-11-13 12:44:16,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:16,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636197505] [2024-11-13 12:44:16,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:16,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:16,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:17,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:17,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:17,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:17,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:17,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:17,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:17,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:17,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:44:17,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 12:44:17,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:44:17,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:44:17,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:17,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 12:44:17,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 12:44:17,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:44:17,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:44:17,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:44:17,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,214 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:44:17,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:17,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636197505] [2024-11-13 12:44:17,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636197505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:17,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:17,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 12:44:17,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766131586] [2024-11-13 12:44:17,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:17,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 12:44:17,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:17,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 12:44:17,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-13 12:44:17,217 INFO L87 Difference]: Start difference. First operand 178 states and 264 transitions. Second operand has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 8 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-13 12:44:17,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:17,699 INFO L93 Difference]: Finished difference Result 435 states and 641 transitions. [2024-11-13 12:44:17,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:44:17,700 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 8 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 153 [2024-11-13 12:44:17,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:17,702 INFO L225 Difference]: With dead ends: 435 [2024-11-13 12:44:17,702 INFO L226 Difference]: Without dead ends: 260 [2024-11-13 12:44:17,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-13 12:44:17,705 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 344 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:17,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 678 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 12:44:17,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-13 12:44:17,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 257. [2024-11-13 12:44:17,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 231 states have (on average 1.4285714285714286) internal successors, (330), 232 states have internal predecessors, (330), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-13 12:44:17,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 376 transitions. [2024-11-13 12:44:17,731 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 376 transitions. Word has length 153 [2024-11-13 12:44:17,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:17,733 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 376 transitions. [2024-11-13 12:44:17,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 8 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-13 12:44:17,734 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 376 transitions. [2024-11-13 12:44:17,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-13 12:44:17,735 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:17,736 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:44:17,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 12:44:17,736 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:17,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:17,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1462756667, now seen corresponding path program 1 times [2024-11-13 12:44:17,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:17,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534842156] [2024-11-13 12:44:17,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:17,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:17,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:17,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:17,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:17,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:17,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:17,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:17,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:44:17,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 12:44:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:17,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:44:17,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:44:17,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:17,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 12:44:17,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 12:44:17,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:44:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:44:17,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:44:18,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,009 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:44:18,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:18,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534842156] [2024-11-13 12:44:18,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534842156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:18,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:18,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:44:18,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722754562] [2024-11-13 12:44:18,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:18,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:44:18,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:18,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:44:18,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:44:18,013 INFO L87 Difference]: Start difference. First operand 257 states and 376 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:44:18,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:18,134 INFO L93 Difference]: Finished difference Result 680 states and 1001 transitions. [2024-11-13 12:44:18,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:44:18,135 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-13 12:44:18,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:18,140 INFO L225 Difference]: With dead ends: 680 [2024-11-13 12:44:18,140 INFO L226 Difference]: Without dead ends: 426 [2024-11-13 12:44:18,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 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 12:44:18,145 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 78 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:18,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 649 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:44:18,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2024-11-13 12:44:18,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 336. [2024-11-13 12:44:18,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 310 states have (on average 1.4645161290322581) internal successors, (454), 311 states have internal predecessors, (454), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-13 12:44:18,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 500 transitions. [2024-11-13 12:44:18,168 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 500 transitions. Word has length 153 [2024-11-13 12:44:18,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:18,168 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 500 transitions. [2024-11-13 12:44:18,169 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:44:18,169 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 500 transitions. [2024-11-13 12:44:18,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-13 12:44:18,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:18,171 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:44:18,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 12:44:18,171 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:18,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:18,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1228541331, now seen corresponding path program 1 times [2024-11-13 12:44:18,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:18,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059102590] [2024-11-13 12:44:18,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:18,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:18,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:18,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:18,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:18,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:18,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:18,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:18,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:18,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:44:18,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 12:44:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:44:18,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:44:18,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 12:44:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 12:44:18,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:44:18,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:44:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:19,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:44:19,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:19,004 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:44:19,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:19,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059102590] [2024-11-13 12:44:19,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059102590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:19,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:19,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 12:44:19,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753699575] [2024-11-13 12:44:19,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:19,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 12:44:19,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:19,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 12:44:19,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-13 12:44:19,007 INFO L87 Difference]: Start difference. First operand 336 states and 500 transitions. Second operand has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 8 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-13 12:44:19,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:19,484 INFO L93 Difference]: Finished difference Result 672 states and 999 transitions. [2024-11-13 12:44:19,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:44:19,487 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 8 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 153 [2024-11-13 12:44:19,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:19,491 INFO L225 Difference]: With dead ends: 672 [2024-11-13 12:44:19,491 INFO L226 Difference]: Without dead ends: 339 [2024-11-13 12:44:19,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-13 12:44:19,493 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 353 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:19,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 678 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 12:44:19,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2024-11-13 12:44:19,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 336. [2024-11-13 12:44:19,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 310 states have (on average 1.4580645161290322) internal successors, (452), 311 states have internal predecessors, (452), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-13 12:44:19,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 498 transitions. [2024-11-13 12:44:19,529 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 498 transitions. Word has length 153 [2024-11-13 12:44:19,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:19,530 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 498 transitions. [2024-11-13 12:44:19,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 8 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-13 12:44:19,530 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 498 transitions. [2024-11-13 12:44:19,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-13 12:44:19,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:19,534 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:44:19,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 12:44:19,534 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:19,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:19,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1166501717, now seen corresponding path program 1 times [2024-11-13 12:44:19,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:19,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088073498] [2024-11-13 12:44:19,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:19,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:20,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:20,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:20,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:20,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:20,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:20,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:44:20,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 12:44:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:20,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:44:20,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:44:20,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:20,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 12:44:20,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 12:44:20,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:44:20,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:44:20,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:44:20,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,407 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:44:20,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:20,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088073498] [2024-11-13 12:44:20,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088073498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:20,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:20,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 12:44:20,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928192128] [2024-11-13 12:44:20,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:20,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 12:44:20,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:20,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 12:44:20,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-13 12:44:20,410 INFO L87 Difference]: Start difference. First operand 336 states and 498 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:44:20,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:20,837 INFO L93 Difference]: Finished difference Result 708 states and 1047 transitions. [2024-11-13 12:44:20,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 12:44:20,838 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-13 12:44:20,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:20,840 INFO L225 Difference]: With dead ends: 708 [2024-11-13 12:44:20,840 INFO L226 Difference]: Without dead ends: 375 [2024-11-13 12:44:20,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-13 12:44:20,843 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 78 mSDsluCounter, 1255 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1502 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:20,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1502 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 12:44:20,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-11-13 12:44:20,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 336. [2024-11-13 12:44:20,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 310 states have (on average 1.4548387096774194) internal successors, (451), 311 states have internal predecessors, (451), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-13 12:44:20,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 497 transitions. [2024-11-13 12:44:20,869 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 497 transitions. Word has length 153 [2024-11-13 12:44:20,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:20,869 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 497 transitions. [2024-11-13 12:44:20,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:44:20,870 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 497 transitions. [2024-11-13 12:44:20,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-13 12:44:20,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:20,872 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:44:20,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 12:44:20,873 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:20,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:20,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1428087843, now seen corresponding path program 1 times [2024-11-13 12:44:20,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:20,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604776042] [2024-11-13 12:44:20,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:20,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:20,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:21,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:21,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:21,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:21,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:21,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:21,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:44:21,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 12:44:21,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:21,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:44:21,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:44:21,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:21,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 12:44:21,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 12:44:21,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:44:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:44:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:44:21,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,324 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:44:21,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:21,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604776042] [2024-11-13 12:44:21,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604776042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:21,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:21,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:44:21,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095337550] [2024-11-13 12:44:21,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:21,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:44:21,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:21,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:44:21,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:44:21,327 INFO L87 Difference]: Start difference. First operand 336 states and 497 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:44:21,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:21,548 INFO L93 Difference]: Finished difference Result 745 states and 1100 transitions. [2024-11-13 12:44:21,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:44:21,549 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-13 12:44:21,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:21,551 INFO L225 Difference]: With dead ends: 745 [2024-11-13 12:44:21,551 INFO L226 Difference]: Without dead ends: 412 [2024-11-13 12:44:21,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 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 12:44:21,552 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 99 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:21,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 756 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 12:44:21,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-11-13 12:44:21,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 355. [2024-11-13 12:44:21,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 329 states have (on average 1.465045592705167) internal successors, (482), 330 states have internal predecessors, (482), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-13 12:44:21,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 528 transitions. [2024-11-13 12:44:21,578 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 528 transitions. Word has length 153 [2024-11-13 12:44:21,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:21,580 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 528 transitions. [2024-11-13 12:44:21,580 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:44:21,580 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 528 transitions. [2024-11-13 12:44:21,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-13 12:44:21,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:21,582 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:44:21,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 12:44:21,583 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:21,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:21,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1587015775, now seen corresponding path program 1 times [2024-11-13 12:44:21,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:21,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293369073] [2024-11-13 12:44:21,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:21,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:21,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:22,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:22,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:22,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:22,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:22,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:22,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:22,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:22,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:22,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:22,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:22,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:22,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:22,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:22,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:22,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:44:22,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:22,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 12:44:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:22,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:22,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:22,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:44:22,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:22,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:44:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:22,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:22,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:22,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 12:44:22,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:22,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 12:44:22,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:22,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:44:22,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:22,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:44:22,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:22,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:44:22,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:22,505 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:44:22,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:22,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293369073] [2024-11-13 12:44:22,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293369073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:22,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:22,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 12:44:22,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862567195] [2024-11-13 12:44:22,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:22,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 12:44:22,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:22,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 12:44:22,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-13 12:44:22,508 INFO L87 Difference]: Start difference. First operand 355 states and 528 transitions. Second operand has 10 states, 9 states have (on average 6.777777777777778) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-13 12:44:23,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:23,131 INFO L93 Difference]: Finished difference Result 749 states and 1110 transitions. [2024-11-13 12:44:23,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:44:23,132 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.777777777777778) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 153 [2024-11-13 12:44:23,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:23,137 INFO L225 Difference]: With dead ends: 749 [2024-11-13 12:44:23,137 INFO L226 Difference]: Without dead ends: 397 [2024-11-13 12:44:23,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-11-13 12:44:23,140 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 373 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 1347 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:23,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 1347 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 12:44:23,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-11-13 12:44:23,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 354. [2024-11-13 12:44:23,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 328 states have (on average 1.4634146341463414) internal successors, (480), 329 states have internal predecessors, (480), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-13 12:44:23,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 526 transitions. [2024-11-13 12:44:23,170 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 526 transitions. Word has length 153 [2024-11-13 12:44:23,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:23,171 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 526 transitions. [2024-11-13 12:44:23,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.777777777777778) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-13 12:44:23,171 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 526 transitions. [2024-11-13 12:44:23,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-13 12:44:23,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:23,175 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:44:23,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 12:44:23,176 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:23,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:23,176 INFO L85 PathProgramCache]: Analyzing trace with hash -132262227, now seen corresponding path program 1 times [2024-11-13 12:44:23,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:23,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648563221] [2024-11-13 12:44:23,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:23,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:23,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:24,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:24,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:24,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:24,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:24,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:24,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:24,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:24,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:24,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:24,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:24,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:24,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:24,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:24,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:24,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:24,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:44:24,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:24,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 12:44:24,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:24,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:24,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:24,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:44:24,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:24,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:44:24,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:24,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:24,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:24,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 12:44:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:24,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 12:44:24,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:24,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:44:24,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:24,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:44:24,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:24,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:44:24,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:24,099 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:44:24,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:24,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648563221] [2024-11-13 12:44:24,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648563221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:24,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:24,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 12:44:24,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508060938] [2024-11-13 12:44:24,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:24,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 12:44:24,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:24,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 12:44:24,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-13 12:44:24,101 INFO L87 Difference]: Start difference. First operand 354 states and 526 transitions. Second operand has 11 states, 9 states have (on average 6.777777777777778) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-13 12:44:24,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:24,901 INFO L93 Difference]: Finished difference Result 747 states and 1107 transitions. [2024-11-13 12:44:24,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 12:44:24,901 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.777777777777778) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 153 [2024-11-13 12:44:24,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:24,904 INFO L225 Difference]: With dead ends: 747 [2024-11-13 12:44:24,904 INFO L226 Difference]: Without dead ends: 396 [2024-11-13 12:44:24,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2024-11-13 12:44:24,906 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 384 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 1568 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:24,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 1568 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 12:44:24,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-13 12:44:24,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 353. [2024-11-13 12:44:24,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 327 states have (on average 1.4617737003058104) internal successors, (478), 328 states have internal predecessors, (478), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-13 12:44:24,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 524 transitions. [2024-11-13 12:44:24,935 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 524 transitions. Word has length 153 [2024-11-13 12:44:24,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:24,936 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 524 transitions. [2024-11-13 12:44:24,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.777777777777778) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-13 12:44:24,936 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 524 transitions. [2024-11-13 12:44:24,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-13 12:44:24,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:24,939 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:44:24,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 12:44:24,939 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:24,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:24,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1235821139, now seen corresponding path program 1 times [2024-11-13 12:44:24,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:24,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113061064] [2024-11-13 12:44:24,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:24,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:24,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:25,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:25,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:25,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:25,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:25,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:25,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:25,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:44:25,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 12:44:25,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:25,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:44:25,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:44:25,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:25,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 12:44:25,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 12:44:25,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:44:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:44:25,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:44:25,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,139 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:44:25,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:25,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113061064] [2024-11-13 12:44:25,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113061064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:25,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:25,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:44:25,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265350228] [2024-11-13 12:44:25,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:25,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:44:25,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:25,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:44:25,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:44:25,141 INFO L87 Difference]: Start difference. First operand 353 states and 524 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:44:25,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:25,269 INFO L93 Difference]: Finished difference Result 748 states and 1104 transitions. [2024-11-13 12:44:25,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:44:25,269 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-13 12:44:25,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:25,272 INFO L225 Difference]: With dead ends: 748 [2024-11-13 12:44:25,272 INFO L226 Difference]: Without dead ends: 398 [2024-11-13 12:44:25,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 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 12:44:25,273 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 90 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:25,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 807 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:44:25,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-11-13 12:44:25,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 352. [2024-11-13 12:44:25,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 326 states have (on average 1.4478527607361964) internal successors, (472), 327 states have internal predecessors, (472), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-13 12:44:25,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 518 transitions. [2024-11-13 12:44:25,301 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 518 transitions. Word has length 153 [2024-11-13 12:44:25,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:25,301 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 518 transitions. [2024-11-13 12:44:25,302 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:44:25,302 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 518 transitions. [2024-11-13 12:44:25,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-13 12:44:25,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:25,304 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:44:25,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 12:44:25,304 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:25,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:25,305 INFO L85 PathProgramCache]: Analyzing trace with hash 442355457, now seen corresponding path program 1 times [2024-11-13 12:44:25,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:25,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562157117] [2024-11-13 12:44:25,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:25,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:25,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:25,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:25,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:25,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:25,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:25,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:25,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:44:25,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 12:44:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:25,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:44:25,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:44:25,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 12:44:25,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 12:44:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:44:25,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:44:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:44:25,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,430 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:44:25,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:25,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562157117] [2024-11-13 12:44:25,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562157117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:25,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:25,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:44:25,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417465388] [2024-11-13 12:44:25,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:25,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:44:25,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:25,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:44:25,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:44:25,434 INFO L87 Difference]: Start difference. First operand 352 states and 518 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:44:25,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:25,481 INFO L93 Difference]: Finished difference Result 696 states and 1025 transitions. [2024-11-13 12:44:25,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:44:25,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 154 [2024-11-13 12:44:25,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:25,484 INFO L225 Difference]: With dead ends: 696 [2024-11-13 12:44:25,484 INFO L226 Difference]: Without dead ends: 347 [2024-11-13 12:44:25,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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 12:44:25,485 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:25,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 344 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:44:25,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-11-13 12:44:25,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 286. [2024-11-13 12:44:25,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 260 states have (on average 1.4153846153846155) internal successors, (368), 261 states have internal predecessors, (368), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-13 12:44:25,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 414 transitions. [2024-11-13 12:44:25,510 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 414 transitions. Word has length 154 [2024-11-13 12:44:25,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:25,510 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 414 transitions. [2024-11-13 12:44:25,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:44:25,511 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 414 transitions. [2024-11-13 12:44:25,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-13 12:44:25,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:25,513 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:44:25,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 12:44:25,513 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:25,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:25,514 INFO L85 PathProgramCache]: Analyzing trace with hash -9225641, now seen corresponding path program 1 times [2024-11-13 12:44:25,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:25,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120804327] [2024-11-13 12:44:25,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:25,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:25,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:25,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:25,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:25,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:25,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:25,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:25,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:25,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:44:25,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 12:44:25,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:25,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:44:25,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:44:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:25,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 12:44:25,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 12:44:25,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:44:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:44:25,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:44:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:25,632 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:44:25,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:25,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120804327] [2024-11-13 12:44:25,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120804327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:25,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:25,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:44:25,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583305241] [2024-11-13 12:44:25,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:25,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:44:25,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:25,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:44:25,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:44:25,634 INFO L87 Difference]: Start difference. First operand 286 states and 414 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:44:25,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:25,677 INFO L93 Difference]: Finished difference Result 539 states and 779 transitions. [2024-11-13 12:44:25,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:44:25,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 154 [2024-11-13 12:44:25,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:25,680 INFO L225 Difference]: With dead ends: 539 [2024-11-13 12:44:25,680 INFO L226 Difference]: Without dead ends: 256 [2024-11-13 12:44:25,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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 12:44:25,681 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:25,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 345 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:44:25,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-13 12:44:25,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2024-11-13 12:44:25,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 230 states have (on average 1.3956521739130434) internal successors, (321), 231 states have internal predecessors, (321), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-13 12:44:25,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 367 transitions. [2024-11-13 12:44:25,703 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 367 transitions. Word has length 154 [2024-11-13 12:44:25,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:25,703 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 367 transitions. [2024-11-13 12:44:25,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:44:25,704 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 367 transitions. [2024-11-13 12:44:25,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-13 12:44:25,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:25,706 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:44:25,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 12:44:25,706 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:25,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:25,706 INFO L85 PathProgramCache]: Analyzing trace with hash 666499655, now seen corresponding path program 1 times [2024-11-13 12:44:25,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:25,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31555494] [2024-11-13 12:44:25,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:25,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:25,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:26,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:26,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:26,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:26,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:26,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:44:26,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 12:44:26,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:44:26,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:44:26,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 12:44:26,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 12:44:26,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:44:26,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:44:26,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:44:26,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:26,403 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:44:26,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:26,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31555494] [2024-11-13 12:44:26,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31555494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:26,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:26,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 12:44:26,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123257910] [2024-11-13 12:44:26,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:26,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 12:44:26,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:26,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 12:44:26,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:44:26,405 INFO L87 Difference]: Start difference. First operand 256 states and 367 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:44:26,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:26,617 INFO L93 Difference]: Finished difference Result 707 states and 1014 transitions. [2024-11-13 12:44:26,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 12:44:26,618 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-11-13 12:44:26,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:26,620 INFO L225 Difference]: With dead ends: 707 [2024-11-13 12:44:26,621 INFO L226 Difference]: Without dead ends: 454 [2024-11-13 12:44:26,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-13 12:44:26,622 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 85 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:26,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 1039 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:44:26,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2024-11-13 12:44:26,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 374. [2024-11-13 12:44:26,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 348 states have (on average 1.4195402298850575) internal successors, (494), 349 states have internal predecessors, (494), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-13 12:44:26,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 540 transitions. [2024-11-13 12:44:26,649 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 540 transitions. Word has length 155 [2024-11-13 12:44:26,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:26,650 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 540 transitions. [2024-11-13 12:44:26,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:44:26,650 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 540 transitions. [2024-11-13 12:44:26,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-13 12:44:26,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:26,652 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:44:26,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-13 12:44:26,652 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:26,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:26,653 INFO L85 PathProgramCache]: Analyzing trace with hash 728539269, now seen corresponding path program 1 times [2024-11-13 12:44:26,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:26,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072432789] [2024-11-13 12:44:26,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:26,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:26,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:28,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:28,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:28,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:28,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:28,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:28,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:28,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:28,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:28,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:28,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:28,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:28,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:28,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:28,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:44:28,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:28,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 12:44:28,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:28,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:28,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:28,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:44:28,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:28,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:44:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:28,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:28,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:28,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 12:44:28,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:28,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 12:44:28,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:28,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:44:28,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:28,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:44:28,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:28,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:44:28,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:28,542 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:44:28,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:28,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072432789] [2024-11-13 12:44:28,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072432789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:28,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:28,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-13 12:44:28,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236284041] [2024-11-13 12:44:28,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:28,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-13 12:44:28,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:28,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-13 12:44:28,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2024-11-13 12:44:28,544 INFO L87 Difference]: Start difference. First operand 374 states and 540 transitions. Second operand has 20 states, 18 states have (on average 3.5) internal successors, (63), 19 states have internal predecessors, (63), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) [2024-11-13 12:44:31,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:31,050 INFO L93 Difference]: Finished difference Result 1272 states and 1816 transitions. [2024-11-13 12:44:31,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 12:44:31,051 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.5) internal successors, (63), 19 states have internal predecessors, (63), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) Word has length 155 [2024-11-13 12:44:31,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:31,056 INFO L225 Difference]: With dead ends: 1272 [2024-11-13 12:44:31,056 INFO L226 Difference]: Without dead ends: 901 [2024-11-13 12:44:31,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=264, Invalid=996, Unknown=0, NotChecked=0, Total=1260 [2024-11-13 12:44:31,058 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 1451 mSDsluCounter, 2469 mSDsCounter, 0 mSdLazyCounter, 1350 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1451 SdHoareTripleChecker+Valid, 2708 SdHoareTripleChecker+Invalid, 1534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 1350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:31,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1451 Valid, 2708 Invalid, 1534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 1350 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-13 12:44:31,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2024-11-13 12:44:31,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 687. [2024-11-13 12:44:31,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 628 states have (on average 1.3964968152866242) internal successors, (877), 631 states have internal predecessors, (877), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-13 12:44:31,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 981 transitions. [2024-11-13 12:44:31,131 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 981 transitions. Word has length 155 [2024-11-13 12:44:31,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:31,132 INFO L471 AbstractCegarLoop]: Abstraction has 687 states and 981 transitions. [2024-11-13 12:44:31,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.5) internal successors, (63), 19 states have internal predecessors, (63), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) [2024-11-13 12:44:31,132 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 981 transitions. [2024-11-13 12:44:31,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-13 12:44:31,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:31,135 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:44:31,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-13 12:44:31,136 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:31,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:31,136 INFO L85 PathProgramCache]: Analyzing trace with hash -2114819803, now seen corresponding path program 1 times [2024-11-13 12:44:31,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:31,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286209854] [2024-11-13 12:44:31,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:31,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:31,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:31,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:31,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:31,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:31,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:31,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:31,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:31,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:44:31,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 12:44:31,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:31,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:44:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:44:31,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 12:44:31,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 12:44:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:44:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:44:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:44:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,996 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:44:31,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:31,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286209854] [2024-11-13 12:44:31,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286209854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:31,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:31,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 12:44:31,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930824096] [2024-11-13 12:44:31,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:31,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 12:44:31,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:31,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 12:44:31,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-13 12:44:31,999 INFO L87 Difference]: Start difference. First operand 687 states and 981 transitions. Second operand has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-13 12:44:32,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:32,784 INFO L93 Difference]: Finished difference Result 1504 states and 2135 transitions. [2024-11-13 12:44:32,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 12:44:32,784 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 155 [2024-11-13 12:44:32,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:32,789 INFO L225 Difference]: With dead ends: 1504 [2024-11-13 12:44:32,789 INFO L226 Difference]: Without dead ends: 820 [2024-11-13 12:44:32,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-11-13 12:44:32,791 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 534 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:32,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 791 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 12:44:32,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2024-11-13 12:44:32,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 693. [2024-11-13 12:44:32,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 634 states have (on average 1.3927444794952681) internal successors, (883), 637 states have internal predecessors, (883), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-13 12:44:32,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 987 transitions. [2024-11-13 12:44:32,851 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 987 transitions. Word has length 155 [2024-11-13 12:44:32,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:32,852 INFO L471 AbstractCegarLoop]: Abstraction has 693 states and 987 transitions. [2024-11-13 12:44:32,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-13 12:44:32,852 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 987 transitions. [2024-11-13 12:44:32,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-13 12:44:32,855 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:32,855 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:44:32,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-13 12:44:32,855 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:32,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:32,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1593341479, now seen corresponding path program 1 times [2024-11-13 12:44:32,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:32,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270406822] [2024-11-13 12:44:32,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:32,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:40,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:40,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:40,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:40,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:40,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:40,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:40,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:40,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:40,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:40,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:40,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:40,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:40,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:40,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:40,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:44:40,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:40,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 12:44:40,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:40,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:40,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:40,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:44:40,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:40,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:44:40,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:40,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:40,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:40,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 12:44:40,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:40,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 12:44:40,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:40,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:44:40,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:40,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:44:40,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:40,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:44:40,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:40,685 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:44:40,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:40,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270406822] [2024-11-13 12:44:40,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270406822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:40,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:40,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2024-11-13 12:44:40,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104200903] [2024-11-13 12:44:40,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:40,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-13 12:44:40,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:40,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-13 12:44:40,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=759, Unknown=0, NotChecked=0, Total=870 [2024-11-13 12:44:40,691 INFO L87 Difference]: Start difference. First operand 693 states and 987 transitions. Second operand has 30 states, 26 states have (on average 2.423076923076923) internal successors, (63), 27 states have internal predecessors, (63), 8 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 7 states have call predecessors, (19), 8 states have call successors, (19) [2024-11-13 12:44:49,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:49,693 INFO L93 Difference]: Finished difference Result 1644 states and 2331 transitions. [2024-11-13 12:44:49,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-13 12:44:49,694 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 26 states have (on average 2.423076923076923) internal successors, (63), 27 states have internal predecessors, (63), 8 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 7 states have call predecessors, (19), 8 states have call successors, (19) Word has length 155 [2024-11-13 12:44:49,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:49,698 INFO L225 Difference]: With dead ends: 1644 [2024-11-13 12:44:49,699 INFO L226 Difference]: Without dead ends: 954 [2024-11-13 12:44:49,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=630, Invalid=2792, Unknown=0, NotChecked=0, Total=3422 [2024-11-13 12:44:49,702 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 839 mSDsluCounter, 4881 mSDsCounter, 0 mSdLazyCounter, 2955 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 839 SdHoareTripleChecker+Valid, 5160 SdHoareTripleChecker+Invalid, 3077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 2955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:49,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [839 Valid, 5160 Invalid, 3077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 2955 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-13 12:44:49,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2024-11-13 12:44:49,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 758. [2024-11-13 12:44:49,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 696 states have (on average 1.389367816091954) internal successors, (967), 700 states have internal predecessors, (967), 54 states have call successors, (54), 7 states have call predecessors, (54), 7 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-13 12:44:49,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1075 transitions. [2024-11-13 12:44:49,760 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1075 transitions. Word has length 155 [2024-11-13 12:44:49,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:49,760 INFO L471 AbstractCegarLoop]: Abstraction has 758 states and 1075 transitions. [2024-11-13 12:44:49,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 26 states have (on average 2.423076923076923) internal successors, (63), 27 states have internal predecessors, (63), 8 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 7 states have call predecessors, (19), 8 states have call successors, (19) [2024-11-13 12:44:49,761 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1075 transitions. [2024-11-13 12:44:49,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-13 12:44:49,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:49,763 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:44:49,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-13 12:44:49,763 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:49,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:49,764 INFO L85 PathProgramCache]: Analyzing trace with hash -2000712379, now seen corresponding path program 1 times [2024-11-13 12:44:49,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:49,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651998189] [2024-11-13 12:44:49,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:49,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:49,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:51,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:51,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:51,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:51,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:51,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:51,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:44:51,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 12:44:51,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:44:51,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:44:51,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:51,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 12:44:51,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 12:44:51,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:44:51,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:44:51,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:44:51,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,873 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:44:51,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:51,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651998189] [2024-11-13 12:44:51,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651998189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:51,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:51,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-11-13 12:44:51,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695367298] [2024-11-13 12:44:51,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:51,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-13 12:44:51,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:51,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-13 12:44:51,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2024-11-13 12:44:51,875 INFO L87 Difference]: Start difference. First operand 758 states and 1075 transitions. Second operand has 22 states, 20 states have (on average 3.15) internal successors, (63), 22 states have internal predecessors, (63), 7 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 7 states have call successors, (19) [2024-11-13 12:44:54,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:54,623 INFO L93 Difference]: Finished difference Result 1762 states and 2487 transitions. [2024-11-13 12:44:54,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 12:44:54,624 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 3.15) internal successors, (63), 22 states have internal predecessors, (63), 7 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 7 states have call successors, (19) Word has length 155 [2024-11-13 12:44:54,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:54,628 INFO L225 Difference]: With dead ends: 1762 [2024-11-13 12:44:54,628 INFO L226 Difference]: Without dead ends: 1007 [2024-11-13 12:44:54,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=288, Invalid=1194, Unknown=0, NotChecked=0, Total=1482 [2024-11-13 12:44:54,632 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 1180 mSDsluCounter, 3620 mSDsCounter, 0 mSdLazyCounter, 2050 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1180 SdHoareTripleChecker+Valid, 3946 SdHoareTripleChecker+Invalid, 2219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 2050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:54,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1180 Valid, 3946 Invalid, 2219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 2050 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-13 12:44:54,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2024-11-13 12:44:54,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 754. [2024-11-13 12:44:54,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 692 states have (on average 1.3916184971098267) internal successors, (963), 696 states have internal predecessors, (963), 54 states have call successors, (54), 7 states have call predecessors, (54), 7 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-13 12:44:54,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1071 transitions. [2024-11-13 12:44:54,699 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1071 transitions. Word has length 155 [2024-11-13 12:44:54,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:54,701 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1071 transitions. [2024-11-13 12:44:54,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 3.15) internal successors, (63), 22 states have internal predecessors, (63), 7 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 7 states have call successors, (19) [2024-11-13 12:44:54,701 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1071 transitions. [2024-11-13 12:44:54,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-13 12:44:54,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:54,704 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:44:54,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-13 12:44:54,704 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:54,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:54,705 INFO L85 PathProgramCache]: Analyzing trace with hash -348115289, now seen corresponding path program 1 times [2024-11-13 12:44:54,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:54,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596724068] [2024-11-13 12:44:54,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:54,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:54,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:55,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:55,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:55,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:55,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:55,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:55,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:55,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:55,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:55,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:55,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:55,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:55,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:55,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:55,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:55,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:55,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:44:55,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:55,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 12:44:55,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:55,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:55,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:55,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:44:55,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:55,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:44:55,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:55,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:55,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:55,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 12:44:55,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:55,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 12:44:55,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:55,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:44:55,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:55,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:44:55,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:55,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:44:55,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:55,630 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:44:55,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:55,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596724068] [2024-11-13 12:44:55,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596724068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:55,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:55,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-13 12:44:55,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025207232] [2024-11-13 12:44:55,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:55,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-13 12:44:55,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:55,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-13 12:44:55,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-11-13 12:44:55,633 INFO L87 Difference]: Start difference. First operand 754 states and 1071 transitions. Second operand has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:44:56,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:56,417 INFO L93 Difference]: Finished difference Result 1693 states and 2398 transitions. [2024-11-13 12:44:56,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:44:56,418 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-11-13 12:44:56,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:56,422 INFO L225 Difference]: With dead ends: 1693 [2024-11-13 12:44:56,423 INFO L226 Difference]: Without dead ends: 942 [2024-11-13 12:44:56,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2024-11-13 12:44:56,425 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 91 mSDsluCounter, 2552 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 2784 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:56,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 2784 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 12:44:56,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2024-11-13 12:44:56,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 893. [2024-11-13 12:44:56,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 828 states have (on average 1.392512077294686) internal successors, (1153), 833 states have internal predecessors, (1153), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 51 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-13 12:44:56,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1265 transitions. [2024-11-13 12:44:56,491 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1265 transitions. Word has length 155 [2024-11-13 12:44:56,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:56,492 INFO L471 AbstractCegarLoop]: Abstraction has 893 states and 1265 transitions. [2024-11-13 12:44:56,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:44:56,492 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1265 transitions. [2024-11-13 12:44:56,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-13 12:44:56,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:56,495 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:44:56,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-13 12:44:56,495 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:56,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:56,496 INFO L85 PathProgramCache]: Analyzing trace with hash -934921303, now seen corresponding path program 1 times [2024-11-13 12:44:56,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:56,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061947234] [2024-11-13 12:44:56,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:56,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:56,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:56,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:56,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:56,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:56,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:56,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:56,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:56,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:56,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:56,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:56,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:56,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:56,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:44:56,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:56,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 12:44:56,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:56,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:56,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:56,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:44:57,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:57,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:44:57,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:57,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:57,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:57,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 12:44:57,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:57,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 12:44:57,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:57,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:44:57,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:57,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:44:57,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:57,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:44:57,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:57,018 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:44:57,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:57,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061947234] [2024-11-13 12:44:57,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061947234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:57,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:57,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 12:44:57,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843643105] [2024-11-13 12:44:57,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:57,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 12:44:57,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:57,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 12:44:57,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-13 12:44:57,020 INFO L87 Difference]: Start difference. First operand 893 states and 1265 transitions. Second operand has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-13 12:44:57,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:57,466 INFO L93 Difference]: Finished difference Result 1951 states and 2745 transitions. [2024-11-13 12:44:57,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:44:57,467 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 155 [2024-11-13 12:44:57,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:57,472 INFO L225 Difference]: With dead ends: 1951 [2024-11-13 12:44:57,472 INFO L226 Difference]: Without dead ends: 1061 [2024-11-13 12:44:57,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-13 12:44:57,476 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 395 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:57,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 866 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 12:44:57,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2024-11-13 12:44:57,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 934. [2024-11-13 12:44:57,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 863 states have (on average 1.3812282734646582) internal successors, (1192), 869 states have internal predecessors, (1192), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 54 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-13 12:44:57,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1312 transitions. [2024-11-13 12:44:57,555 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1312 transitions. Word has length 155 [2024-11-13 12:44:57,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:57,555 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1312 transitions. [2024-11-13 12:44:57,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-13 12:44:57,556 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1312 transitions. [2024-11-13 12:44:57,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-13 12:44:57,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:57,559 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:44:57,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-13 12:44:57,559 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:57,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:57,559 INFO L85 PathProgramCache]: Analyzing trace with hash -857588379, now seen corresponding path program 1 times [2024-11-13 12:44:57,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:57,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452099603] [2024-11-13 12:44:57,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:57,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:57,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:58,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:58,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:58,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:58,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:58,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:58,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:58,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:58,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:58,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:58,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:58,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:58,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:58,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:58,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:58,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:58,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:44:58,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:58,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 12:44:58,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:58,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:58,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:58,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:44:58,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:58,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:44:58,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:58,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:58,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:58,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 12:44:58,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:58,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 12:44:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:58,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:44:58,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:58,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:44:58,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:58,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:44:58,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:58,057 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:44:58,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:58,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452099603] [2024-11-13 12:44:58,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452099603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:58,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:58,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 12:44:58,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726231422] [2024-11-13 12:44:58,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:58,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 12:44:58,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:58,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 12:44:58,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-13 12:44:58,059 INFO L87 Difference]: Start difference. First operand 934 states and 1312 transitions. Second operand has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-13 12:44:58,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:58,558 INFO L93 Difference]: Finished difference Result 1883 states and 2632 transitions. [2024-11-13 12:44:58,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:44:58,558 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 155 [2024-11-13 12:44:58,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:58,562 INFO L225 Difference]: With dead ends: 1883 [2024-11-13 12:44:58,563 INFO L226 Difference]: Without dead ends: 952 [2024-11-13 12:44:58,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-13 12:44:58,565 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 390 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:58,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 897 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 12:44:58,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2024-11-13 12:44:58,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 833. [2024-11-13 12:44:58,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 762 states have (on average 1.372703412073491) internal successors, (1046), 768 states have internal predecessors, (1046), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 54 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-13 12:44:58,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1166 transitions. [2024-11-13 12:44:58,635 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1166 transitions. Word has length 155 [2024-11-13 12:44:58,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:58,636 INFO L471 AbstractCegarLoop]: Abstraction has 833 states and 1166 transitions. [2024-11-13 12:44:58,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-13 12:44:58,636 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1166 transitions. [2024-11-13 12:44:58,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-13 12:44:58,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:58,638 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:44:58,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-13 12:44:58,638 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:58,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:58,638 INFO L85 PathProgramCache]: Analyzing trace with hash 664148775, now seen corresponding path program 1 times [2024-11-13 12:44:58,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:58,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402477138] [2024-11-13 12:44:58,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:58,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:58,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:59,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:44:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:59,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:59,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:59,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:59,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:59,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:59,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:59,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:59,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:59,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:59,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:59,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:59,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:44:59,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:59,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:44:59,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:59,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 12:44:59,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:59,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:44:59,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:59,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:44:59,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:59,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:44:59,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:59,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:44:59,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:59,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 12:44:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:59,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 12:44:59,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:59,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:44:59,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:59,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:44:59,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:59,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:44:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:59,437 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:44:59,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:59,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402477138] [2024-11-13 12:44:59,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402477138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:59,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:59,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 12:44:59,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658387977] [2024-11-13 12:44:59,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:59,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 12:44:59,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:59,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 12:44:59,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-13 12:44:59,441 INFO L87 Difference]: Start difference. First operand 833 states and 1166 transitions. Second operand has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:45:00,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:00,073 INFO L93 Difference]: Finished difference Result 1895 states and 2652 transitions. [2024-11-13 12:45:00,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 12:45:00,074 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-11-13 12:45:00,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:00,081 INFO L225 Difference]: With dead ends: 1895 [2024-11-13 12:45:00,081 INFO L226 Difference]: Without dead ends: 1070 [2024-11-13 12:45:00,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2024-11-13 12:45:00,084 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 102 mSDsluCounter, 2218 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 2450 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:00,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 2450 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 12:45:00,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2024-11-13 12:45:00,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 948. [2024-11-13 12:45:00,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 877 states have (on average 1.3842645381984036) internal successors, (1214), 883 states have internal predecessors, (1214), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 54 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-13 12:45:00,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1334 transitions. [2024-11-13 12:45:00,167 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1334 transitions. Word has length 155 [2024-11-13 12:45:00,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:00,167 INFO L471 AbstractCegarLoop]: Abstraction has 948 states and 1334 transitions. [2024-11-13 12:45:00,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:45:00,167 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1334 transitions. [2024-11-13 12:45:00,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-13 12:45:00,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:00,170 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:00,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-13 12:45:00,172 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:00,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:00,173 INFO L85 PathProgramCache]: Analyzing trace with hash 922314213, now seen corresponding path program 1 times [2024-11-13 12:45:00,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:00,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273433880] [2024-11-13 12:45:00,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:00,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:00,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:00,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:45:00,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:00,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:45:00,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:00,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:45:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:00,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:45:00,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:00,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:45:00,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:00,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:45:00,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:00,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:45:00,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:00,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:45:00,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:00,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:45:00,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:00,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 12:45:00,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:00,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:45:00,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:00,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:45:00,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:00,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:45:00,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:00,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:45:00,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:00,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 12:45:00,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:00,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 12:45:00,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:00,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:45:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:00,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:45:00,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:00,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:45:00,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:00,633 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:45:00,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:00,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273433880] [2024-11-13 12:45:00,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273433880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:00,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:00,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 12:45:00,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529341984] [2024-11-13 12:45:00,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:00,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 12:45:00,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:00,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 12:45:00,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-13 12:45:00,635 INFO L87 Difference]: Start difference. First operand 948 states and 1334 transitions. Second operand has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-13 12:45:01,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:01,189 INFO L93 Difference]: Finished difference Result 2147 states and 3018 transitions. [2024-11-13 12:45:01,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:45:01,189 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 155 [2024-11-13 12:45:01,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:01,194 INFO L225 Difference]: With dead ends: 2147 [2024-11-13 12:45:01,195 INFO L226 Difference]: Without dead ends: 1202 [2024-11-13 12:45:01,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-13 12:45:01,197 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 398 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:01,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 963 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 12:45:01,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2024-11-13 12:45:01,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 1198. [2024-11-13 12:45:01,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 1103 states have (on average 1.3744333635539439) internal successors, (1516), 1113 states have internal predecessors, (1516), 80 states have call successors, (80), 14 states have call predecessors, (80), 14 states have return successors, (80), 70 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-13 12:45:01,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1676 transitions. [2024-11-13 12:45:01,353 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1676 transitions. Word has length 155 [2024-11-13 12:45:01,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:01,353 INFO L471 AbstractCegarLoop]: Abstraction has 1198 states and 1676 transitions. [2024-11-13 12:45:01,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-13 12:45:01,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1676 transitions. [2024-11-13 12:45:01,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-13 12:45:01,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:01,356 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:01,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-13 12:45:01,357 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:01,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:01,357 INFO L85 PathProgramCache]: Analyzing trace with hash -346968475, now seen corresponding path program 1 times [2024-11-13 12:45:01,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:01,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574066850] [2024-11-13 12:45:01,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:01,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:01,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:01,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:45:01,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:01,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:45:01,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:01,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:45:01,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:01,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:45:01,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:01,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:45:01,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:01,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:45:01,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:01,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:45:01,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:01,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:45:01,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:01,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:45:01,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:01,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 12:45:01,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:01,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:45:01,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:01,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:45:01,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:01,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:45:01,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:01,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:45:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:01,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 12:45:01,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:01,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 12:45:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:01,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:45:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:01,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:45:01,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:01,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:45:01,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:01,664 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:45:01,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:01,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574066850] [2024-11-13 12:45:01,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574066850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:01,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:01,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:45:01,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452830063] [2024-11-13 12:45:01,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:01,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:45:01,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:01,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:45:01,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:45:01,666 INFO L87 Difference]: Start difference. First operand 1198 states and 1676 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:45:01,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:01,839 INFO L93 Difference]: Finished difference Result 2589 states and 3630 transitions. [2024-11-13 12:45:01,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:45:01,840 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-11-13 12:45:01,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:01,845 INFO L225 Difference]: With dead ends: 2589 [2024-11-13 12:45:01,845 INFO L226 Difference]: Without dead ends: 1399 [2024-11-13 12:45:01,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 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 12:45:01,848 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 68 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:01,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 798 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:45:01,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2024-11-13 12:45:01,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1248. [2024-11-13 12:45:01,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1248 states, 1153 states have (on average 1.3790112749349523) internal successors, (1590), 1163 states have internal predecessors, (1590), 80 states have call successors, (80), 14 states have call predecessors, (80), 14 states have return successors, (80), 70 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-13 12:45:01,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 1750 transitions. [2024-11-13 12:45:01,952 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 1750 transitions. Word has length 155 [2024-11-13 12:45:01,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:01,952 INFO L471 AbstractCegarLoop]: Abstraction has 1248 states and 1750 transitions. [2024-11-13 12:45:01,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:45:01,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1750 transitions. [2024-11-13 12:45:01,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-13 12:45:01,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:01,954 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:01,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-13 12:45:01,955 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:01,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:01,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1707590487, now seen corresponding path program 1 times [2024-11-13 12:45:01,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:01,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127806753] [2024-11-13 12:45:01,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:01,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:02,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:02,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:45:02,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:02,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:45:02,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:02,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:45:02,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:02,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:45:02,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:02,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:45:02,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:02,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:45:02,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:02,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:45:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:02,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:45:02,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:02,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:45:02,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:02,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 12:45:02,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:02,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:45:02,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:02,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:45:02,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:02,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:45:02,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:02,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:45:02,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:02,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 12:45:02,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:02,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 12:45:02,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:02,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:45:02,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:02,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:45:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:02,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:45:02,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:02,482 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:45:02,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:02,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127806753] [2024-11-13 12:45:02,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127806753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:02,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:02,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 12:45:02,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985524116] [2024-11-13 12:45:02,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:02,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 12:45:02,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:02,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 12:45:02,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-13 12:45:02,484 INFO L87 Difference]: Start difference. First operand 1248 states and 1750 transitions. Second operand has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-13 12:45:02,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:02,925 INFO L93 Difference]: Finished difference Result 2562 states and 3583 transitions. [2024-11-13 12:45:02,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:45:02,926 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 155 [2024-11-13 12:45:02,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:02,932 INFO L225 Difference]: With dead ends: 2562 [2024-11-13 12:45:02,932 INFO L226 Difference]: Without dead ends: 1322 [2024-11-13 12:45:02,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-13 12:45:02,940 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 395 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:02,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 901 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 12:45:02,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2024-11-13 12:45:03,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1101. [2024-11-13 12:45:03,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1101 states, 1022 states have (on average 1.3845401174168297) internal successors, (1415), 1028 states have internal predecessors, (1415), 66 states have call successors, (66), 12 states have call predecessors, (66), 12 states have return successors, (66), 60 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-13 12:45:03,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 1547 transitions. [2024-11-13 12:45:03,089 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 1547 transitions. Word has length 155 [2024-11-13 12:45:03,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:03,089 INFO L471 AbstractCegarLoop]: Abstraction has 1101 states and 1547 transitions. [2024-11-13 12:45:03,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-13 12:45:03,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1547 transitions. [2024-11-13 12:45:03,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-13 12:45:03,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:03,092 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:03,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-13 12:45:03,092 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:03,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:03,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1449425049, now seen corresponding path program 1 times [2024-11-13 12:45:03,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:03,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222159344] [2024-11-13 12:45:03,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:03,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:03,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:03,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:45:03,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:03,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:45:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:03,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:45:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:03,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:45:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:03,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:45:03,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:03,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:45:03,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:03,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:45:03,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:03,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:45:03,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:03,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:45:03,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:03,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 12:45:03,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:03,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:45:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:03,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:45:03,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:03,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:45:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:45:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 12:45:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 12:45:04,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:45:04,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:45:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:45:04,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,016 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:45:04,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:04,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222159344] [2024-11-13 12:45:04,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222159344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:04,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:04,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 12:45:04,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450927298] [2024-11-13 12:45:04,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:04,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 12:45:04,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:04,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 12:45:04,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-13 12:45:04,020 INFO L87 Difference]: Start difference. First operand 1101 states and 1547 transitions. Second operand has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:45:04,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:04,674 INFO L93 Difference]: Finished difference Result 2352 states and 3294 transitions. [2024-11-13 12:45:04,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 12:45:04,675 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-11-13 12:45:04,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:04,679 INFO L225 Difference]: With dead ends: 2352 [2024-11-13 12:45:04,679 INFO L226 Difference]: Without dead ends: 1254 [2024-11-13 12:45:04,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2024-11-13 12:45:04,681 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 86 mSDsluCounter, 2301 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 2547 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:04,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 2547 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 12:45:04,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2024-11-13 12:45:04,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1107. [2024-11-13 12:45:04,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1107 states, 1028 states have (on average 1.382295719844358) internal successors, (1421), 1034 states have internal predecessors, (1421), 66 states have call successors, (66), 12 states have call predecessors, (66), 12 states have return successors, (66), 60 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-13 12:45:04,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 1107 states and 1553 transitions. [2024-11-13 12:45:04,781 INFO L78 Accepts]: Start accepts. Automaton has 1107 states and 1553 transitions. Word has length 155 [2024-11-13 12:45:04,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:04,782 INFO L471 AbstractCegarLoop]: Abstraction has 1107 states and 1553 transitions. [2024-11-13 12:45:04,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:45:04,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 1553 transitions. [2024-11-13 12:45:04,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-13 12:45:04,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:04,784 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:04,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-13 12:45:04,784 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:04,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:04,785 INFO L85 PathProgramCache]: Analyzing trace with hash 2050352169, now seen corresponding path program 1 times [2024-11-13 12:45:04,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:04,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727255662] [2024-11-13 12:45:04,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:04,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:04,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:05,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:45:05,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:05,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:45:05,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:05,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:45:05,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:05,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:45:05,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:05,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:45:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:05,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:45:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:05,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:45:05,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:05,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:45:05,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:05,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:45:05,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:05,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 12:45:05,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:05,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:45:05,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:05,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:45:05,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:05,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:45:05,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:05,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:45:05,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:05,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 12:45:05,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:05,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 12:45:05,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:05,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:45:05,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:05,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:45:05,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:05,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:45:05,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:05,066 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:45:05,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:05,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727255662] [2024-11-13 12:45:05,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727255662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:05,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:05,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:45:05,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333952236] [2024-11-13 12:45:05,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:05,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:45:05,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:05,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:45:05,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:45:05,068 INFO L87 Difference]: Start difference. First operand 1107 states and 1553 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:45:05,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:05,314 INFO L93 Difference]: Finished difference Result 2248 states and 3152 transitions. [2024-11-13 12:45:05,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:45:05,315 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-11-13 12:45:05,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:05,320 INFO L225 Difference]: With dead ends: 2248 [2024-11-13 12:45:05,320 INFO L226 Difference]: Without dead ends: 1144 [2024-11-13 12:45:05,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 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 12:45:05,322 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 70 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:05,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 821 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:45:05,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2024-11-13 12:45:05,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1107. [2024-11-13 12:45:05,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1107 states, 1028 states have (on average 1.3764591439688716) internal successors, (1415), 1034 states have internal predecessors, (1415), 66 states have call successors, (66), 12 states have call predecessors, (66), 12 states have return successors, (66), 60 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-13 12:45:05,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 1107 states and 1547 transitions. [2024-11-13 12:45:05,452 INFO L78 Accepts]: Start accepts. Automaton has 1107 states and 1547 transitions. Word has length 155 [2024-11-13 12:45:05,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:05,453 INFO L471 AbstractCegarLoop]: Abstraction has 1107 states and 1547 transitions. [2024-11-13 12:45:05,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:45:05,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 1547 transitions. [2024-11-13 12:45:05,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-13 12:45:05,455 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:05,455 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:05,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-13 12:45:05,456 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:05,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:05,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1039234919, now seen corresponding path program 1 times [2024-11-13 12:45:05,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:05,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423818918] [2024-11-13 12:45:05,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:05,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:06,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:45:06,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:06,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:45:06,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:06,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:45:06,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:06,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:45:06,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:06,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:45:06,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:06,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:45:06,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:06,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:45:06,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:06,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:45:06,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:06,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:45:06,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:06,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 12:45:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:06,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:45:06,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:06,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:45:06,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:06,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:45:06,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:06,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:45:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:06,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 12:45:06,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:06,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 12:45:06,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:06,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:45:06,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:06,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:45:06,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:06,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:45:06,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:06,277 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:45:06,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:06,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423818918] [2024-11-13 12:45:06,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423818918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:06,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:06,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 12:45:06,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856997850] [2024-11-13 12:45:06,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:06,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 12:45:06,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:06,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 12:45:06,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-13 12:45:06,279 INFO L87 Difference]: Start difference. First operand 1107 states and 1547 transitions. Second operand has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:45:06,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:06,792 INFO L93 Difference]: Finished difference Result 2323 states and 3244 transitions. [2024-11-13 12:45:06,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 12:45:06,793 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-11-13 12:45:06,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:06,798 INFO L225 Difference]: With dead ends: 2323 [2024-11-13 12:45:06,798 INFO L226 Difference]: Without dead ends: 1219 [2024-11-13 12:45:06,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2024-11-13 12:45:06,804 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 71 mSDsluCounter, 2364 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2603 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:06,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2603 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 12:45:06,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2024-11-13 12:45:06,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1111. [2024-11-13 12:45:06,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1111 states, 1032 states have (on average 1.375) internal successors, (1419), 1038 states have internal predecessors, (1419), 66 states have call successors, (66), 12 states have call predecessors, (66), 12 states have return successors, (66), 60 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-13 12:45:06,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1551 transitions. [2024-11-13 12:45:06,901 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1551 transitions. Word has length 155 [2024-11-13 12:45:06,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:06,901 INFO L471 AbstractCegarLoop]: Abstraction has 1111 states and 1551 transitions. [2024-11-13 12:45:06,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:45:06,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1551 transitions. [2024-11-13 12:45:06,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-13 12:45:06,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:06,904 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:06,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-13 12:45:06,904 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:06,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:06,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1074338905, now seen corresponding path program 1 times [2024-11-13 12:45:06,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:06,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723387745] [2024-11-13 12:45:06,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:06,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:06,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:07,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:45:07,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:07,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:45:07,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:07,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:45:07,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:07,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:45:07,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:07,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:45:07,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:07,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:45:07,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:07,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:45:07,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:07,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:45:07,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:07,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:45:07,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:07,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 12:45:07,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:07,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:45:07,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:07,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:45:07,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:07,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:45:07,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:07,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:45:07,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:07,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 12:45:07,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:07,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 12:45:07,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:07,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:45:07,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:07,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:45:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:07,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:45:07,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:07,733 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:45:07,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:07,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723387745] [2024-11-13 12:45:07,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723387745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:07,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:07,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 12:45:07,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866659273] [2024-11-13 12:45:07,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:07,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 12:45:07,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:07,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 12:45:07,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-13 12:45:07,736 INFO L87 Difference]: Start difference. First operand 1111 states and 1551 transitions. Second operand has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:45:08,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:08,269 INFO L93 Difference]: Finished difference Result 2322 states and 3240 transitions. [2024-11-13 12:45:08,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 12:45:08,269 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-11-13 12:45:08,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:08,275 INFO L225 Difference]: With dead ends: 2322 [2024-11-13 12:45:08,275 INFO L226 Difference]: Without dead ends: 1214 [2024-11-13 12:45:08,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2024-11-13 12:45:08,277 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 71 mSDsluCounter, 2154 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2392 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:08,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2392 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 12:45:08,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2024-11-13 12:45:08,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1100. [2024-11-13 12:45:08,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1100 states, 1021 states have (on average 1.376101860920666) internal successors, (1405), 1027 states have internal predecessors, (1405), 66 states have call successors, (66), 12 states have call predecessors, (66), 12 states have return successors, (66), 60 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-13 12:45:08,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1537 transitions. [2024-11-13 12:45:08,372 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 1537 transitions. Word has length 155 [2024-11-13 12:45:08,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:08,372 INFO L471 AbstractCegarLoop]: Abstraction has 1100 states and 1537 transitions. [2024-11-13 12:45:08,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:45:08,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1537 transitions. [2024-11-13 12:45:08,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-13 12:45:08,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:08,375 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:08,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-13 12:45:08,375 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:08,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:08,375 INFO L85 PathProgramCache]: Analyzing trace with hash -659904657, now seen corresponding path program 1 times [2024-11-13 12:45:08,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:08,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446471266] [2024-11-13 12:45:08,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:08,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:08,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:08,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:45:08,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:08,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:45:08,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:08,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:45:08,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:08,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:45:08,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:08,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:45:08,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:08,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:45:08,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:08,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:45:08,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:08,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:45:08,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:08,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:45:08,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:08,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 12:45:08,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:08,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:45:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:08,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:45:08,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:08,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:45:08,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:08,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:45:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:08,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 12:45:08,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:08,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 12:45:08,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:08,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:45:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:08,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:45:08,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:08,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:45:08,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:08,489 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:45:08,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:08,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446471266] [2024-11-13 12:45:08,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446471266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:08,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:08,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:45:08,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640814366] [2024-11-13 12:45:08,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:08,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:45:08,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:08,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:45:08,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:45:08,490 INFO L87 Difference]: Start difference. First operand 1100 states and 1537 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:45:08,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:08,577 INFO L93 Difference]: Finished difference Result 2208 states and 3093 transitions. [2024-11-13 12:45:08,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:45:08,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 156 [2024-11-13 12:45:08,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:08,581 INFO L225 Difference]: With dead ends: 2208 [2024-11-13 12:45:08,581 INFO L226 Difference]: Without dead ends: 1111 [2024-11-13 12:45:08,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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 12:45:08,583 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 351 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 12:45:08,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 351 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:45:08,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2024-11-13 12:45:08,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 1111. [2024-11-13 12:45:08,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1111 states, 1032 states have (on average 1.372093023255814) internal successors, (1416), 1038 states have internal predecessors, (1416), 66 states have call successors, (66), 12 states have call predecessors, (66), 12 states have return successors, (66), 60 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-13 12:45:08,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1548 transitions. [2024-11-13 12:45:08,662 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1548 transitions. Word has length 156 [2024-11-13 12:45:08,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:08,662 INFO L471 AbstractCegarLoop]: Abstraction has 1111 states and 1548 transitions. [2024-11-13 12:45:08,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:45:08,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1548 transitions. [2024-11-13 12:45:08,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-13 12:45:08,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:08,665 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:08,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-13 12:45:08,665 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:08,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:08,666 INFO L85 PathProgramCache]: Analyzing trace with hash -401739219, now seen corresponding path program 1 times [2024-11-13 12:45:08,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:08,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217929544] [2024-11-13 12:45:08,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:08,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:08,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:45:08,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:08,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:45:08,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:08,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:45:08,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:08,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:45:08,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:08,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:45:08,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:08,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:45:08,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:08,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:45:08,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:08,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:45:08,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:08,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:45:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:08,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 12:45:08,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:08,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:45:08,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:08,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:45:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:08,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:45:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:08,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:45:08,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:08,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 12:45:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:08,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 12:45:08,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:08,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:45:08,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:08,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:45:08,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:08,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:45:08,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:08,892 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:45:08,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:08,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217929544] [2024-11-13 12:45:08,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217929544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:08,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:08,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 12:45:08,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315708779] [2024-11-13 12:45:08,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:08,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 12:45:08,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:08,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 12:45:08,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 12:45:08,895 INFO L87 Difference]: Start difference. First operand 1111 states and 1548 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:45:08,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:08,983 INFO L93 Difference]: Finished difference Result 2263 states and 3148 transitions. [2024-11-13 12:45:08,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:45:08,983 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 156 [2024-11-13 12:45:08,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:08,988 INFO L225 Difference]: With dead ends: 2263 [2024-11-13 12:45:08,988 INFO L226 Difference]: Without dead ends: 1155 [2024-11-13 12:45:08,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 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 12:45:08,990 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 859 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 12:45:08,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 859 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:45:08,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2024-11-13 12:45:09,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1122. [2024-11-13 12:45:09,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 1043 states have (on average 1.3681687440076702) internal successors, (1427), 1049 states have internal predecessors, (1427), 66 states have call successors, (66), 12 states have call predecessors, (66), 12 states have return successors, (66), 60 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-13 12:45:09,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1559 transitions. [2024-11-13 12:45:09,059 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1559 transitions. Word has length 156 [2024-11-13 12:45:09,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:09,061 INFO L471 AbstractCegarLoop]: Abstraction has 1122 states and 1559 transitions. [2024-11-13 12:45:09,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:45:09,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1559 transitions. [2024-11-13 12:45:09,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-13 12:45:09,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:09,063 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:09,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-13 12:45:09,064 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:09,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:09,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1117985942, now seen corresponding path program 1 times [2024-11-13 12:45:09,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:09,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140593308] [2024-11-13 12:45:09,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:09,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:09,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:45:09,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:09,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:45:09,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:09,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:45:09,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:09,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:45:09,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:09,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:45:09,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:09,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:45:09,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:09,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:45:09,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:09,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:45:09,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:09,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:45:09,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:09,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 12:45:09,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:09,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:45:09,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:09,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:45:09,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:09,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:45:09,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:09,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:45:09,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:09,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 12:45:09,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:09,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 12:45:09,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:09,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:45:09,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:09,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:45:09,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:09,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:45:09,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:09,339 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:45:09,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:09,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140593308] [2024-11-13 12:45:09,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140593308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:09,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:09,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:45:09,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227773288] [2024-11-13 12:45:09,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:09,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:45:09,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:09,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:45:09,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:45:09,341 INFO L87 Difference]: Start difference. First operand 1122 states and 1559 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:45:09,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:09,662 INFO L93 Difference]: Finished difference Result 3160 states and 4350 transitions. [2024-11-13 12:45:09,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:45:09,663 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 158 [2024-11-13 12:45:09,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:09,674 INFO L225 Difference]: With dead ends: 3160 [2024-11-13 12:45:09,678 INFO L226 Difference]: Without dead ends: 2041 [2024-11-13 12:45:09,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 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 12:45:09,680 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 153 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:09,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 615 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 12:45:09,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2041 states. [2024-11-13 12:45:09,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2041 to 1349. [2024-11-13 12:45:09,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1349 states, 1270 states have (on average 1.3125984251968503) internal successors, (1667), 1276 states have internal predecessors, (1667), 66 states have call successors, (66), 12 states have call predecessors, (66), 12 states have return successors, (66), 60 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-13 12:45:09,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 1799 transitions. [2024-11-13 12:45:09,781 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 1799 transitions. Word has length 158 [2024-11-13 12:45:09,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:09,782 INFO L471 AbstractCegarLoop]: Abstraction has 1349 states and 1799 transitions. [2024-11-13 12:45:09,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:45:09,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 1799 transitions. [2024-11-13 12:45:09,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-13 12:45:09,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:09,784 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:09,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-13 12:45:09,784 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:09,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:09,784 INFO L85 PathProgramCache]: Analyzing trace with hash 505669647, now seen corresponding path program 1 times [2024-11-13 12:45:09,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:09,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327817439] [2024-11-13 12:45:09,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:09,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:09,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:09,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:45:09,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:09,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:45:09,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:09,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:45:09,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:09,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:45:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:09,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:45:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:09,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:45:09,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:09,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:45:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:09,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:45:09,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:09,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:45:09,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:09,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 12:45:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:09,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:45:09,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:09,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:45:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:09,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:45:09,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:09,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:45:09,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:09,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 12:45:09,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:09,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 12:45:09,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:09,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:45:09,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:09,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:45:09,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:09,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:45:09,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:09,917 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:45:09,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:09,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327817439] [2024-11-13 12:45:09,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327817439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:09,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:09,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:45:09,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130395232] [2024-11-13 12:45:09,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:09,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:45:09,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:09,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:45:09,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:45:09,919 INFO L87 Difference]: Start difference. First operand 1349 states and 1799 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:45:09,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:09,977 INFO L93 Difference]: Finished difference Result 2703 states and 3611 transitions. [2024-11-13 12:45:09,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:45:09,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 158 [2024-11-13 12:45:09,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:09,986 INFO L225 Difference]: With dead ends: 2703 [2024-11-13 12:45:09,986 INFO L226 Difference]: Without dead ends: 1357 [2024-11-13 12:45:09,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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 12:45:09,988 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 351 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 12:45:09,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 351 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:45:09,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2024-11-13 12:45:10,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1357. [2024-11-13 12:45:10,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1357 states, 1278 states have (on average 1.310641627543036) internal successors, (1675), 1284 states have internal predecessors, (1675), 66 states have call successors, (66), 12 states have call predecessors, (66), 12 states have return successors, (66), 60 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-13 12:45:10,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 1807 transitions. [2024-11-13 12:45:10,079 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 1807 transitions. Word has length 158 [2024-11-13 12:45:10,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:10,079 INFO L471 AbstractCegarLoop]: Abstraction has 1357 states and 1807 transitions. [2024-11-13 12:45:10,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:45:10,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1807 transitions. [2024-11-13 12:45:10,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-13 12:45:10,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:10,081 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:10,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-13 12:45:10,081 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:10,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:10,082 INFO L85 PathProgramCache]: Analyzing trace with hash -2014290287, now seen corresponding path program 1 times [2024-11-13 12:45:10,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:10,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185633345] [2024-11-13 12:45:10,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:10,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:10,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:10,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:45:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:10,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:45:10,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:10,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:45:10,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:10,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:45:10,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:10,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:45:10,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:10,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:45:10,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:10,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:45:10,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:10,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:45:10,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:10,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:45:10,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:10,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 12:45:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:10,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:45:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:10,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:45:10,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:10,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:45:10,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:10,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:45:10,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:10,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 12:45:10,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:10,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 12:45:10,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:10,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:45:10,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:10,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:45:10,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:10,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:45:10,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:10,757 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:45:10,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:10,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185633345] [2024-11-13 12:45:10,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185633345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:10,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:10,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 12:45:10,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685864694] [2024-11-13 12:45:10,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:10,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 12:45:10,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:10,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 12:45:10,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-13 12:45:10,759 INFO L87 Difference]: Start difference. First operand 1357 states and 1807 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:45:11,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:11,143 INFO L93 Difference]: Finished difference Result 2447 states and 3191 transitions. [2024-11-13 12:45:11,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 12:45:11,147 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 158 [2024-11-13 12:45:11,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:11,158 INFO L225 Difference]: With dead ends: 2447 [2024-11-13 12:45:11,159 INFO L226 Difference]: Without dead ends: 2445 [2024-11-13 12:45:11,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-13 12:45:11,160 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 116 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:11,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 1058 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 12:45:11,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2445 states. [2024-11-13 12:45:11,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2445 to 2441. [2024-11-13 12:45:11,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2441 states, 2292 states have (on average 1.2787958115183247) internal successors, (2931), 2306 states have internal predecessors, (2931), 124 states have call successors, (124), 24 states have call predecessors, (124), 24 states have return successors, (124), 110 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-13 12:45:11,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2441 states to 2441 states and 3179 transitions. [2024-11-13 12:45:11,306 INFO L78 Accepts]: Start accepts. Automaton has 2441 states and 3179 transitions. Word has length 158 [2024-11-13 12:45:11,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:11,306 INFO L471 AbstractCegarLoop]: Abstraction has 2441 states and 3179 transitions. [2024-11-13 12:45:11,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:45:11,306 INFO L276 IsEmpty]: Start isEmpty. Operand 2441 states and 3179 transitions. [2024-11-13 12:45:11,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-13 12:45:11,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:11,309 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:11,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-13 12:45:11,309 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:11,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:11,310 INFO L85 PathProgramCache]: Analyzing trace with hash -869941819, now seen corresponding path program 1 times [2024-11-13 12:45:11,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:11,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699569799] [2024-11-13 12:45:11,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:11,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:11,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:12,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:45:12,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:12,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:45:12,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:12,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:45:12,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:12,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:45:12,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:12,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:45:12,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:12,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:45:12,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:12,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:45:12,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:12,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:45:12,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:12,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:45:12,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:12,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 12:45:12,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:12,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:45:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:12,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:45:12,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:12,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:45:12,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:12,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:45:12,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:12,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 12:45:12,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:12,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 12:45:12,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:12,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:45:12,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:12,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:45:12,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:12,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:45:12,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:12,267 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:45:12,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:12,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699569799] [2024-11-13 12:45:12,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699569799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:12,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:12,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-13 12:45:12,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895130558] [2024-11-13 12:45:12,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:12,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 12:45:12,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:12,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 12:45:12,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-13 12:45:12,269 INFO L87 Difference]: Start difference. First operand 2441 states and 3179 transitions. Second operand has 12 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) [2024-11-13 12:45:13,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:13,072 INFO L93 Difference]: Finished difference Result 5127 states and 6664 transitions. [2024-11-13 12:45:13,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:45:13,073 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) Word has length 159 [2024-11-13 12:45:13,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:13,079 INFO L225 Difference]: With dead ends: 5127 [2024-11-13 12:45:13,079 INFO L226 Difference]: Without dead ends: 2689 [2024-11-13 12:45:13,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2024-11-13 12:45:13,082 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 237 mSDsluCounter, 1100 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1342 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:13,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 1342 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 12:45:13,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2689 states. [2024-11-13 12:45:13,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2689 to 2563. [2024-11-13 12:45:13,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2563 states, 2396 states have (on average 1.2725375626043405) internal successors, (3049), 2414 states have internal predecessors, (3049), 136 states have call successors, (136), 30 states have call predecessors, (136), 30 states have return successors, (136), 118 states have call predecessors, (136), 136 states have call successors, (136) [2024-11-13 12:45:13,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2563 states to 2563 states and 3321 transitions. [2024-11-13 12:45:13,252 INFO L78 Accepts]: Start accepts. Automaton has 2563 states and 3321 transitions. Word has length 159 [2024-11-13 12:45:13,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:13,252 INFO L471 AbstractCegarLoop]: Abstraction has 2563 states and 3321 transitions. [2024-11-13 12:45:13,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) [2024-11-13 12:45:13,252 INFO L276 IsEmpty]: Start isEmpty. Operand 2563 states and 3321 transitions. [2024-11-13 12:45:13,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-13 12:45:13,253 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:13,253 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:13,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-13 12:45:13,253 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:13,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:13,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1680585845, now seen corresponding path program 1 times [2024-11-13 12:45:13,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:13,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068277230] [2024-11-13 12:45:13,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:13,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:13,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:13,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:45:13,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:13,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:45:13,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:13,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:45:13,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:13,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:45:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:13,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:45:13,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:13,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:45:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:13,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:45:13,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:13,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:45:13,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:13,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:45:13,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:13,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 12:45:13,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:13,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:45:13,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:13,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:45:13,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:13,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:45:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:13,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:45:13,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:13,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 12:45:13,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:13,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 12:45:13,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:13,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:45:13,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:13,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:45:13,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:13,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:45:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:13,554 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:45:13,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:13,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068277230] [2024-11-13 12:45:13,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068277230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:13,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:13,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:45:13,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179409748] [2024-11-13 12:45:13,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:13,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:45:13,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:13,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:45:13,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:45:13,557 INFO L87 Difference]: Start difference. First operand 2563 states and 3321 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:45:14,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:14,031 INFO L93 Difference]: Finished difference Result 7383 states and 9525 transitions. [2024-11-13 12:45:14,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:45:14,032 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 160 [2024-11-13 12:45:14,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:14,043 INFO L225 Difference]: With dead ends: 7383 [2024-11-13 12:45:14,043 INFO L226 Difference]: Without dead ends: 4823 [2024-11-13 12:45:14,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 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 12:45:14,048 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 172 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:14,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 726 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:45:14,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4823 states. [2024-11-13 12:45:14,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4823 to 4817. [2024-11-13 12:45:14,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4817 states, 4504 states have (on average 1.2606571936056838) internal successors, (5678), 4542 states have internal predecessors, (5678), 252 states have call successors, (252), 60 states have call predecessors, (252), 60 states have return successors, (252), 214 states have call predecessors, (252), 252 states have call successors, (252) [2024-11-13 12:45:14,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4817 states to 4817 states and 6182 transitions. [2024-11-13 12:45:14,485 INFO L78 Accepts]: Start accepts. Automaton has 4817 states and 6182 transitions. Word has length 160 [2024-11-13 12:45:14,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:14,485 INFO L471 AbstractCegarLoop]: Abstraction has 4817 states and 6182 transitions. [2024-11-13 12:45:14,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:45:14,486 INFO L276 IsEmpty]: Start isEmpty. Operand 4817 states and 6182 transitions. [2024-11-13 12:45:14,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-13 12:45:14,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:14,488 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:14,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-13 12:45:14,488 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:14,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:14,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1228178057, now seen corresponding path program 1 times [2024-11-13 12:45:14,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:14,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755451820] [2024-11-13 12:45:14,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:14,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:14,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:14,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:45:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:14,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:45:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:14,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:45:14,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:14,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:45:14,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:14,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:45:14,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:14,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:45:14,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:14,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:45:14,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:14,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:45:14,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:14,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:45:14,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:14,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 12:45:14,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:14,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:45:14,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:14,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:45:14,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:14,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:45:14,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:14,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:45:14,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:14,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 12:45:14,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:14,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 12:45:14,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:14,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:45:14,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:14,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:45:14,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:14,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:45:14,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:14,820 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:45:14,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:14,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755451820] [2024-11-13 12:45:14,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755451820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:14,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:14,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:45:14,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508889756] [2024-11-13 12:45:14,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:14,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:45:14,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:14,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:45:14,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:45:14,823 INFO L87 Difference]: Start difference. First operand 4817 states and 6182 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:45:15,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:15,403 INFO L93 Difference]: Finished difference Result 10722 states and 13731 transitions. [2024-11-13 12:45:15,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:45:15,403 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 160 [2024-11-13 12:45:15,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:15,419 INFO L225 Difference]: With dead ends: 10722 [2024-11-13 12:45:15,419 INFO L226 Difference]: Without dead ends: 5908 [2024-11-13 12:45:15,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 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 12:45:15,425 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 92 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:15,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 905 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:45:15,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5908 states. [2024-11-13 12:45:15,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5908 to 5884. [2024-11-13 12:45:15,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5884 states, 5500 states have (on average 1.254) internal successors, (6897), 5548 states have internal predecessors, (6897), 306 states have call successors, (306), 77 states have call predecessors, (306), 77 states have return successors, (306), 258 states have call predecessors, (306), 306 states have call successors, (306) [2024-11-13 12:45:15,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5884 states to 5884 states and 7509 transitions. [2024-11-13 12:45:15,869 INFO L78 Accepts]: Start accepts. Automaton has 5884 states and 7509 transitions. Word has length 160 [2024-11-13 12:45:15,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:15,869 INFO L471 AbstractCegarLoop]: Abstraction has 5884 states and 7509 transitions. [2024-11-13 12:45:15,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:45:15,870 INFO L276 IsEmpty]: Start isEmpty. Operand 5884 states and 7509 transitions. [2024-11-13 12:45:15,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-13 12:45:15,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:15,874 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:15,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-13 12:45:15,874 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:15,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:15,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1677410450, now seen corresponding path program 1 times [2024-11-13 12:45:15,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:15,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46002426] [2024-11-13 12:45:15,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:15,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:15,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:16,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:45:16,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:16,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:45:16,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:16,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:45:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:16,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:45:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:16,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:45:16,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:16,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:45:16,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:16,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:45:16,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:16,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:45:16,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:16,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:45:16,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:16,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 12:45:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:16,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:45:16,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:16,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:45:16,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:16,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:45:16,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:16,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:45:16,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:16,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 12:45:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:16,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 12:45:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:16,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:45:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:16,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:45:16,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:16,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:45:16,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:16,122 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:45:16,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:16,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46002426] [2024-11-13 12:45:16,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46002426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:16,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:16,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:45:16,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125615847] [2024-11-13 12:45:16,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:16,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:45:16,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:16,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:45:16,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:45:16,123 INFO L87 Difference]: Start difference. First operand 5884 states and 7509 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:45:16,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:16,641 INFO L93 Difference]: Finished difference Result 11765 states and 15015 transitions. [2024-11-13 12:45:16,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:45:16,642 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 160 [2024-11-13 12:45:16,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:16,657 INFO L225 Difference]: With dead ends: 11765 [2024-11-13 12:45:16,657 INFO L226 Difference]: Without dead ends: 5884 [2024-11-13 12:45:16,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 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 12:45:16,663 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 1 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:16,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 517 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:45:16,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5884 states. [2024-11-13 12:45:17,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5884 to 5884. [2024-11-13 12:45:17,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5884 states, 5500 states have (on average 1.2085454545454546) internal successors, (6647), 5548 states have internal predecessors, (6647), 306 states have call successors, (306), 77 states have call predecessors, (306), 77 states have return successors, (306), 258 states have call predecessors, (306), 306 states have call successors, (306) [2024-11-13 12:45:17,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5884 states to 5884 states and 7259 transitions. [2024-11-13 12:45:17,210 INFO L78 Accepts]: Start accepts. Automaton has 5884 states and 7259 transitions. Word has length 160 [2024-11-13 12:45:17,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:17,211 INFO L471 AbstractCegarLoop]: Abstraction has 5884 states and 7259 transitions. [2024-11-13 12:45:17,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:45:17,211 INFO L276 IsEmpty]: Start isEmpty. Operand 5884 states and 7259 transitions. [2024-11-13 12:45:17,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-13 12:45:17,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:17,215 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:17,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-13 12:45:17,215 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:17,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:17,215 INFO L85 PathProgramCache]: Analyzing trace with hash 309221501, now seen corresponding path program 1 times [2024-11-13 12:45:17,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:17,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752769631] [2024-11-13 12:45:17,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:17,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:17,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:17,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:45:17,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:17,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:45:17,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:17,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:45:17,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:17,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:45:17,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:17,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:45:17,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:17,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:45:17,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:17,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:45:17,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:17,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:45:17,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:17,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:45:17,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:17,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 12:45:17,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:17,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:45:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:17,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:45:17,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:17,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:45:17,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:17,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:45:17,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:17,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 12:45:17,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:17,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 12:45:17,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:17,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:45:17,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:17,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:45:17,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:17,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:45:17,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:17,654 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:45:17,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:17,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752769631] [2024-11-13 12:45:17,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752769631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:17,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:17,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:45:17,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017316731] [2024-11-13 12:45:17,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:17,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:45:17,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:17,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:45:17,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:45:17,657 INFO L87 Difference]: Start difference. First operand 5884 states and 7259 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:45:18,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:18,400 INFO L93 Difference]: Finished difference Result 11777 states and 14522 transitions. [2024-11-13 12:45:18,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:45:18,400 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 161 [2024-11-13 12:45:18,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:18,417 INFO L225 Difference]: With dead ends: 11777 [2024-11-13 12:45:18,417 INFO L226 Difference]: Without dead ends: 5896 [2024-11-13 12:45:18,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 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 12:45:18,426 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 103 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:18,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 682 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:45:18,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5896 states. [2024-11-13 12:45:18,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5896 to 5594. [2024-11-13 12:45:18,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5594 states, 5279 states have (on average 1.2040159121045653) internal successors, (6356), 5317 states have internal predecessors, (6356), 248 states have call successors, (248), 66 states have call predecessors, (248), 66 states have return successors, (248), 210 states have call predecessors, (248), 248 states have call successors, (248) [2024-11-13 12:45:18,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5594 states to 5594 states and 6852 transitions. [2024-11-13 12:45:18,983 INFO L78 Accepts]: Start accepts. Automaton has 5594 states and 6852 transitions. Word has length 161 [2024-11-13 12:45:18,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:18,985 INFO L471 AbstractCegarLoop]: Abstraction has 5594 states and 6852 transitions. [2024-11-13 12:45:18,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:45:18,986 INFO L276 IsEmpty]: Start isEmpty. Operand 5594 states and 6852 transitions. [2024-11-13 12:45:18,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-13 12:45:18,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:18,990 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:18,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-13 12:45:18,990 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:18,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:18,991 INFO L85 PathProgramCache]: Analyzing trace with hash -83805509, now seen corresponding path program 1 times [2024-11-13 12:45:18,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:18,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31421928] [2024-11-13 12:45:18,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:18,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:19,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:19,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:45:19,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:19,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:45:19,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:19,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:45:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:19,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:45:19,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:19,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:45:19,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:19,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:45:19,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:19,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:45:19,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:19,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:45:19,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:19,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:45:19,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:19,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 12:45:19,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:19,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:45:19,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:19,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:45:19,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:19,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:45:19,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:19,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:45:19,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:19,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 12:45:19,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:19,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 12:45:19,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:19,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:45:19,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:19,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:45:19,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:19,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:45:19,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:19,287 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:45:19,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:19,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31421928] [2024-11-13 12:45:19,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31421928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:19,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:19,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:45:19,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089285890] [2024-11-13 12:45:19,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:19,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:45:19,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:19,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:45:19,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:45:19,289 INFO L87 Difference]: Start difference. First operand 5594 states and 6852 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:45:19,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:19,851 INFO L93 Difference]: Finished difference Result 11407 states and 13971 transitions. [2024-11-13 12:45:19,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:45:19,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 161 [2024-11-13 12:45:19,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:19,870 INFO L225 Difference]: With dead ends: 11407 [2024-11-13 12:45:19,870 INFO L226 Difference]: Without dead ends: 5816 [2024-11-13 12:45:19,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 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 12:45:19,875 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 134 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:19,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 505 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:45:19,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5816 states. [2024-11-13 12:45:20,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5816 to 5594. [2024-11-13 12:45:20,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5594 states, 5279 states have (on average 1.2021216139420345) internal successors, (6346), 5317 states have internal predecessors, (6346), 248 states have call successors, (248), 66 states have call predecessors, (248), 66 states have return successors, (248), 210 states have call predecessors, (248), 248 states have call successors, (248) [2024-11-13 12:45:20,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5594 states to 5594 states and 6842 transitions. [2024-11-13 12:45:20,364 INFO L78 Accepts]: Start accepts. Automaton has 5594 states and 6842 transitions. Word has length 161 [2024-11-13 12:45:20,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:20,365 INFO L471 AbstractCegarLoop]: Abstraction has 5594 states and 6842 transitions. [2024-11-13 12:45:20,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:45:20,365 INFO L276 IsEmpty]: Start isEmpty. Operand 5594 states and 6842 transitions. [2024-11-13 12:45:20,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-13 12:45:20,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:20,369 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:20,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-13 12:45:20,369 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:20,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:20,369 INFO L85 PathProgramCache]: Analyzing trace with hash 826029662, now seen corresponding path program 1 times [2024-11-13 12:45:20,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:20,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766191342] [2024-11-13 12:45:20,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:20,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:20,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:20,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:45:20,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:20,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:45:20,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:20,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:45:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:20,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:45:20,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:20,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:45:20,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:20,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:45:20,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:20,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:45:20,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:20,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:45:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:20,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:45:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:20,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 12:45:20,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:20,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:45:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:20,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:45:20,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:20,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:45:20,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:20,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:45:20,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:20,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 12:45:20,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:20,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 12:45:20,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:20,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:45:20,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:20,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:45:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:20,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:45:20,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:20,699 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:45:20,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:20,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766191342] [2024-11-13 12:45:20,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766191342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:20,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:20,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 12:45:20,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166245029] [2024-11-13 12:45:20,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:20,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 12:45:20,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:20,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 12:45:20,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 12:45:20,701 INFO L87 Difference]: Start difference. First operand 5594 states and 6842 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:45:21,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:21,397 INFO L93 Difference]: Finished difference Result 9230 states and 11290 transitions. [2024-11-13 12:45:21,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:45:21,398 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 161 [2024-11-13 12:45:21,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:21,411 INFO L225 Difference]: With dead ends: 9230 [2024-11-13 12:45:21,411 INFO L226 Difference]: Without dead ends: 5735 [2024-11-13 12:45:21,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-13 12:45:21,418 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 97 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:21,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 823 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 12:45:21,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5735 states. [2024-11-13 12:45:21,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5735 to 5594. [2024-11-13 12:45:21,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5594 states, 5279 states have (on average 1.193597272210646) internal successors, (6301), 5317 states have internal predecessors, (6301), 248 states have call successors, (248), 66 states have call predecessors, (248), 66 states have return successors, (248), 210 states have call predecessors, (248), 248 states have call successors, (248) [2024-11-13 12:45:21,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5594 states to 5594 states and 6797 transitions. [2024-11-13 12:45:21,905 INFO L78 Accepts]: Start accepts. Automaton has 5594 states and 6797 transitions. Word has length 161 [2024-11-13 12:45:21,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:21,906 INFO L471 AbstractCegarLoop]: Abstraction has 5594 states and 6797 transitions. [2024-11-13 12:45:21,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:45:21,906 INFO L276 IsEmpty]: Start isEmpty. Operand 5594 states and 6797 transitions. [2024-11-13 12:45:21,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-13 12:45:21,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:21,910 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:21,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-13 12:45:21,910 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:21,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:21,911 INFO L85 PathProgramCache]: Analyzing trace with hash 692016156, now seen corresponding path program 1 times [2024-11-13 12:45:21,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:21,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8386710] [2024-11-13 12:45:21,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:21,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:21,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:22,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:45:22,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:22,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:45:22,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:22,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:45:22,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:22,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:45:22,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:22,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:45:22,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:22,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:45:22,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:22,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:45:22,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:22,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:45:22,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:22,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:45:22,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:22,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 12:45:22,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:22,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:45:22,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:22,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:45:22,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:22,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:45:22,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:22,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:45:22,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:22,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 12:45:22,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:22,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 12:45:22,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:22,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:45:22,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:22,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:45:22,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:22,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:45:22,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:22,268 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:45:22,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:22,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8386710] [2024-11-13 12:45:22,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8386710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:22,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:22,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 12:45:22,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296333504] [2024-11-13 12:45:22,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:22,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 12:45:22,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:22,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 12:45:22,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:45:22,270 INFO L87 Difference]: Start difference. First operand 5594 states and 6797 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:45:23,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:23,385 INFO L93 Difference]: Finished difference Result 13523 states and 16385 transitions. [2024-11-13 12:45:23,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:45:23,386 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 161 [2024-11-13 12:45:23,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:23,401 INFO L225 Difference]: With dead ends: 13523 [2024-11-13 12:45:23,402 INFO L226 Difference]: Without dead ends: 7932 [2024-11-13 12:45:23,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-13 12:45:23,409 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 87 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:23,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 819 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 12:45:23,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7932 states. [2024-11-13 12:45:23,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7932 to 6314. [2024-11-13 12:45:23,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6314 states, 5999 states have (on average 1.1836972828804802) internal successors, (7101), 6037 states have internal predecessors, (7101), 248 states have call successors, (248), 66 states have call predecessors, (248), 66 states have return successors, (248), 210 states have call predecessors, (248), 248 states have call successors, (248) [2024-11-13 12:45:23,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6314 states to 6314 states and 7597 transitions. [2024-11-13 12:45:23,933 INFO L78 Accepts]: Start accepts. Automaton has 6314 states and 7597 transitions. Word has length 161 [2024-11-13 12:45:23,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:23,933 INFO L471 AbstractCegarLoop]: Abstraction has 6314 states and 7597 transitions. [2024-11-13 12:45:23,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:45:23,933 INFO L276 IsEmpty]: Start isEmpty. Operand 6314 states and 7597 transitions. [2024-11-13 12:45:23,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-13 12:45:23,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:23,937 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:23,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-13 12:45:23,938 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:23,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:23,938 INFO L85 PathProgramCache]: Analyzing trace with hash 950181594, now seen corresponding path program 1 times [2024-11-13 12:45:23,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:23,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480411531] [2024-11-13 12:45:23,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:23,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:23,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:24,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:45:24,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:24,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:45:24,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:24,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:45:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:24,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:45:24,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:24,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:45:24,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:24,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:45:24,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:24,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:45:24,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:24,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:45:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:24,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:45:24,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:24,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 12:45:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:24,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:45:24,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:24,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:45:24,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:24,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:45:24,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:24,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:45:24,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:24,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 12:45:24,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:24,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 12:45:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:24,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:45:24,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:24,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:45:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:24,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:45:24,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:24,172 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:45:24,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:24,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480411531] [2024-11-13 12:45:24,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480411531] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:24,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:24,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 12:45:24,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790591716] [2024-11-13 12:45:24,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:24,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 12:45:24,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:24,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 12:45:24,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:45:24,174 INFO L87 Difference]: Start difference. First operand 6314 states and 7597 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:45:24,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:24,561 INFO L93 Difference]: Finished difference Result 12825 states and 15431 transitions. [2024-11-13 12:45:24,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:45:24,562 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 161 [2024-11-13 12:45:24,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:24,575 INFO L225 Difference]: With dead ends: 12825 [2024-11-13 12:45:24,576 INFO L226 Difference]: Without dead ends: 6514 [2024-11-13 12:45:24,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:45:24,583 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 0 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:24,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1013 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:45:24,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6514 states. [2024-11-13 12:45:25,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6514 to 6294. [2024-11-13 12:45:25,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6294 states, 5979 states have (on average 1.1818029770864693) internal successors, (7066), 6017 states have internal predecessors, (7066), 248 states have call successors, (248), 66 states have call predecessors, (248), 66 states have return successors, (248), 210 states have call predecessors, (248), 248 states have call successors, (248) [2024-11-13 12:45:25,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6294 states to 6294 states and 7562 transitions. [2024-11-13 12:45:25,098 INFO L78 Accepts]: Start accepts. Automaton has 6294 states and 7562 transitions. Word has length 161 [2024-11-13 12:45:25,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:25,098 INFO L471 AbstractCegarLoop]: Abstraction has 6294 states and 7562 transitions. [2024-11-13 12:45:25,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:45:25,099 INFO L276 IsEmpty]: Start isEmpty. Operand 6294 states and 7562 transitions. [2024-11-13 12:45:25,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-13 12:45:25,103 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:25,103 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:25,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-11-13 12:45:25,103 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:25,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:25,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1100789276, now seen corresponding path program 1 times [2024-11-13 12:45:25,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:25,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981966011] [2024-11-13 12:45:25,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:25,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:25,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:25,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:45:25,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:25,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:45:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:25,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:45:25,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:25,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:45:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:25,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:45:25,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:25,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:45:25,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:25,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:45:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:25,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:45:25,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:25,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:45:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:25,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 12:45:25,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:25,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:45:25,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:25,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:45:25,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:25,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:45:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:25,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:45:25,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:25,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 12:45:25,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:25,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 12:45:25,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:25,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:45:25,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:25,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:45:25,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:25,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:45:25,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:25,575 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-13 12:45:25,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:25,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981966011] [2024-11-13 12:45:25,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981966011] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:45:25,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144507203] [2024-11-13 12:45:25,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:25,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:45:25,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:45:25,581 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:45:25,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 12:45:26,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:26,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-13 12:45:26,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:45:26,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 12:45:26,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-13 12:45:26,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-13 12:45:26,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-13 12:45:26,747 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 2 proven. 198 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2024-11-13 12:45:26,747 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:45:27,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2024-11-13 12:45:27,298 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-13 12:45:27,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144507203] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:45:27,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:45:27,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 15 [2024-11-13 12:45:27,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568252223] [2024-11-13 12:45:27,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:45:27,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-13 12:45:27,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:27,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-13 12:45:27,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-13 12:45:27,301 INFO L87 Difference]: Start difference. First operand 6294 states and 7562 transitions. Second operand has 15 states, 13 states have (on average 7.615384615384615) internal successors, (99), 15 states have internal predecessors, (99), 6 states have call successors, (39), 3 states have call predecessors, (39), 5 states have return successors, (39), 4 states have call predecessors, (39), 6 states have call successors, (39) [2024-11-13 12:45:28,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:28,528 INFO L93 Difference]: Finished difference Result 11387 states and 13878 transitions. [2024-11-13 12:45:28,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-13 12:45:28,528 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.615384615384615) internal successors, (99), 15 states have internal predecessors, (99), 6 states have call successors, (39), 3 states have call predecessors, (39), 5 states have return successors, (39), 4 states have call predecessors, (39), 6 states have call successors, (39) Word has length 161 [2024-11-13 12:45:28,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:28,539 INFO L225 Difference]: With dead ends: 11387 [2024-11-13 12:45:28,539 INFO L226 Difference]: Without dead ends: 5096 [2024-11-13 12:45:28,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 352 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=304, Invalid=956, Unknown=0, NotChecked=0, Total=1260 [2024-11-13 12:45:28,546 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 1150 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1150 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:28,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1150 Valid, 1019 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 12:45:28,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5096 states. [2024-11-13 12:45:29,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5096 to 4642. [2024-11-13 12:45:29,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4642 states, 4313 states have (on average 1.1629955947136563) internal successors, (5016), 4351 states have internal predecessors, (5016), 256 states have call successors, (256), 72 states have call predecessors, (256), 72 states have return successors, (256), 218 states have call predecessors, (256), 256 states have call successors, (256) [2024-11-13 12:45:29,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4642 states to 4642 states and 5528 transitions. [2024-11-13 12:45:29,049 INFO L78 Accepts]: Start accepts. Automaton has 4642 states and 5528 transitions. Word has length 161 [2024-11-13 12:45:29,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:29,050 INFO L471 AbstractCegarLoop]: Abstraction has 4642 states and 5528 transitions. [2024-11-13 12:45:29,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.615384615384615) internal successors, (99), 15 states have internal predecessors, (99), 6 states have call successors, (39), 3 states have call predecessors, (39), 5 states have return successors, (39), 4 states have call predecessors, (39), 6 states have call successors, (39) [2024-11-13 12:45:29,050 INFO L276 IsEmpty]: Start isEmpty. Operand 4642 states and 5528 transitions. [2024-11-13 12:45:29,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-13 12:45:29,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:29,052 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:29,066 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 12:45:29,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2024-11-13 12:45:29,253 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:29,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:29,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1352759271, now seen corresponding path program 1 times [2024-11-13 12:45:29,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:29,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034825679] [2024-11-13 12:45:29,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:29,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:29,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:30,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:45:30,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:30,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:45:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:30,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:45:30,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:30,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:45:30,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:30,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:45:30,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:30,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:45:30,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:30,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:45:30,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:30,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 12:45:30,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:30,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:45:30,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:30,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 12:45:30,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:30,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:45:30,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:30,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:45:30,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:30,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:45:30,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:30,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 12:45:30,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:30,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 12:45:30,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:30,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 12:45:30,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:30,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 12:45:30,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:30,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:45:30,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:30,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 12:45:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:30,252 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:45:30,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:30,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034825679] [2024-11-13 12:45:30,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034825679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:30,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:30,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-13 12:45:30,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127484983] [2024-11-13 12:45:30,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:30,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 12:45:30,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:30,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 12:45:30,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-11-13 12:45:30,254 INFO L87 Difference]: Start difference. First operand 4642 states and 5528 transitions. Second operand has 14 states, 12 states have (on average 5.916666666666667) internal successors, (71), 13 states have internal predecessors, (71), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-13 12:45:31,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:31,706 INFO L93 Difference]: Finished difference Result 8212 states and 9775 transitions. [2024-11-13 12:45:31,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 12:45:31,707 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.916666666666667) internal successors, (71), 13 states have internal predecessors, (71), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 163 [2024-11-13 12:45:31,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:31,719 INFO L225 Difference]: With dead ends: 8212 [2024-11-13 12:45:31,719 INFO L226 Difference]: Without dead ends: 8210 [2024-11-13 12:45:31,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=657, Unknown=0, NotChecked=0, Total=812 [2024-11-13 12:45:31,721 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 491 mSDsluCounter, 1906 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 2172 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:31,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 2172 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 12:45:31,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8210 states. [2024-11-13 12:45:32,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8210 to 7214. [2024-11-13 12:45:32,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7214 states, 6729 states have (on average 1.157972952890474) internal successors, (7792), 6787 states have internal predecessors, (7792), 378 states have call successors, (378), 106 states have call predecessors, (378), 106 states have return successors, (378), 320 states have call predecessors, (378), 378 states have call successors, (378) [2024-11-13 12:45:32,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7214 states to 7214 states and 8548 transitions. [2024-11-13 12:45:32,327 INFO L78 Accepts]: Start accepts. Automaton has 7214 states and 8548 transitions. Word has length 163 [2024-11-13 12:45:32,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:32,327 INFO L471 AbstractCegarLoop]: Abstraction has 7214 states and 8548 transitions. [2024-11-13 12:45:32,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.916666666666667) internal successors, (71), 13 states have internal predecessors, (71), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-13 12:45:32,328 INFO L276 IsEmpty]: Start isEmpty. Operand 7214 states and 8548 transitions. [2024-11-13 12:45:32,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-13 12:45:32,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:32,333 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:32,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-11-13 12:45:32,333 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:32,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:32,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1215032888, now seen corresponding path program 1 times [2024-11-13 12:45:32,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:32,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476857227] [2024-11-13 12:45:32,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:32,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:45:32,407 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:45:32,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:45:32,653 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:45:32,655 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 12:45:32,656 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 12:45:32,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-11-13 12:45:32,661 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:45:32,964 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 12:45:32,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 12:45:32 BoogieIcfgContainer [2024-11-13 12:45:32,970 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 12:45:32,971 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 12:45:32,972 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 12:45:32,972 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 12:45:32,973 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:44:09" (3/4) ... [2024-11-13 12:45:32,975 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 12:45:32,976 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 12:45:32,977 INFO L158 Benchmark]: Toolchain (without parser) took 85458.44ms. Allocated memory was 117.4MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 93.0MB in the beginning and 701.2MB in the end (delta: -608.2MB). Peak memory consumption was 791.3MB. Max. memory is 16.1GB. [2024-11-13 12:45:32,977 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 167.8MB. Free memory is still 106.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:45:32,977 INFO L158 Benchmark]: CACSL2BoogieTranslator took 433.22ms. Allocated memory is still 117.4MB. Free memory was 93.0MB in the beginning and 77.8MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 12:45:32,977 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.94ms. Allocated memory is still 117.4MB. Free memory was 77.8MB in the beginning and 73.3MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:45:32,978 INFO L158 Benchmark]: Boogie Preprocessor took 93.11ms. Allocated memory is still 117.4MB. Free memory was 73.3MB in the beginning and 68.1MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 12:45:32,978 INFO L158 Benchmark]: RCFGBuilder took 1201.80ms. Allocated memory is still 117.4MB. Free memory was 67.7MB in the beginning and 71.2MB in the end (delta: -3.5MB). Peak memory consumption was 40.4MB. Max. memory is 16.1GB. [2024-11-13 12:45:32,978 INFO L158 Benchmark]: TraceAbstraction took 83643.57ms. Allocated memory was 117.4MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 70.6MB in the beginning and 701.4MB in the end (delta: -630.8MB). Peak memory consumption was 767.7MB. Max. memory is 16.1GB. [2024-11-13 12:45:32,978 INFO L158 Benchmark]: Witness Printer took 5.61ms. Allocated memory is still 1.5GB. Free memory was 701.4MB in the beginning and 701.2MB in the end (delta: 204.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:45:32,979 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 167.8MB. Free memory is still 106.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 433.22ms. Allocated memory is still 117.4MB. Free memory was 93.0MB in the beginning and 77.8MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.94ms. Allocated memory is still 117.4MB. Free memory was 77.8MB in the beginning and 73.3MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 93.11ms. Allocated memory is still 117.4MB. Free memory was 73.3MB in the beginning and 68.1MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1201.80ms. Allocated memory is still 117.4MB. Free memory was 67.7MB in the beginning and 71.2MB in the end (delta: -3.5MB). Peak memory consumption was 40.4MB. Max. memory is 16.1GB. * TraceAbstraction took 83643.57ms. Allocated memory was 117.4MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 70.6MB in the beginning and 701.4MB in the end (delta: -630.8MB). Peak memory consumption was 767.7MB. Max. memory is 16.1GB. * Witness Printer took 5.61ms. Allocated memory is still 1.5GB. Free memory was 701.4MB in the beginning and 701.2MB in the end (delta: 204.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 120, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 108. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L22] unsigned char var_1_1 = 1; [L23] unsigned char* var_1_1_Pointer = &(var_1_1); [L24] signed char var_1_3 = 0; [L24] signed char var_1_3 = 0; [L25] signed char* var_1_3_Pointer = &(var_1_3); [L26] unsigned char var_1_5 = 128; [L26] unsigned char var_1_5 = 128; [L27] unsigned char* var_1_5_Pointer = &(var_1_5); [L28] unsigned char var_1_6 = 16; [L28] unsigned char var_1_6 = 16; [L29] unsigned char* var_1_6_Pointer = &(var_1_6); [L30] unsigned char var_1_7 = 2; [L30] unsigned char var_1_7 = 2; [L31] unsigned char* var_1_7_Pointer = &(var_1_7); [L32] unsigned char var_1_8 = 8; [L32] unsigned char var_1_8 = 8; [L33] unsigned char* var_1_8_Pointer = &(var_1_8); [L34] double var_1_9 = 10.5; [L34] double var_1_9 = 10.5; [L35] double* var_1_9_Pointer = &(var_1_9); [L36] unsigned char var_1_10 = 0; [L36] unsigned char var_1_10 = 0; [L37] unsigned char* var_1_10_Pointer = &(var_1_10); [L38] unsigned char var_1_12 = 0; [L38] unsigned char var_1_12 = 0; [L39] unsigned char* var_1_12_Pointer = &(var_1_12); [L40] double var_1_13 = 99.25; [L40] double var_1_13 = 99.25; [L41] double* var_1_13_Pointer = &(var_1_13); [L42] unsigned char var_1_14 = 64; [L42] unsigned char var_1_14 = 64; [L43] unsigned char* var_1_14_Pointer = &(var_1_14); [L44] unsigned char var_1_16 = 0; [L44] unsigned char var_1_16 = 0; [L45] unsigned char* var_1_16_Pointer = &(var_1_16); [L46] unsigned char var_1_17 = 0; [L46] unsigned char var_1_17 = 0; [L47] unsigned char* var_1_17_Pointer = &(var_1_17); [L48] unsigned char var_1_18 = 1; [L48] unsigned char var_1_18 = 1; [L49] unsigned char* var_1_18_Pointer = &(var_1_18); [L50] unsigned char last_1_var_1_14 = 64; VAL [isInitial=0, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L124] isInitial = 1 [L125] FCALL initially() [L126] COND TRUE 1 [L127] CALL updateLastVariables() [L117] EXPR \read(var_1_14) [L117] last_1_var_1_14 = var_1_14 [L127] RET updateLastVariables() [L128] CALL updateVariables() [L86] var_1_3 = __VERIFIER_nondet_char() [L87] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] CALL assume_abort_if_not(var_1_3 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] RET assume_abort_if_not(var_1_3 <= 16) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] var_1_5 = __VERIFIER_nondet_uchar() [L90] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] CALL assume_abort_if_not(var_1_5 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] RET assume_abort_if_not(var_1_5 >= 127) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] var_1_6 = __VERIFIER_nondet_uchar() [L93] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L95] var_1_7 = __VERIFIER_nondet_uchar() [L96] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] CALL assume_abort_if_not(var_1_7 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] RET assume_abort_if_not(var_1_7 <= 127) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] var_1_8 = __VERIFIER_nondet_uchar() [L99] EXPR \read(var_1_8) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L100] EXPR \read(var_1_8) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L100] CALL assume_abort_if_not(var_1_8 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L100] RET assume_abort_if_not(var_1_8 <= 64) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] var_1_10 = __VERIFIER_nondet_uchar() [L102] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L102] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L102] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L103] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L103] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L103] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] var_1_12 = __VERIFIER_nondet_uchar() [L105] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L105] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L105] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L107] var_1_13 = __VERIFIER_nondet_double() [L108] EXPR \read(var_1_13) [L108] EXPR var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L108] EXPR var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F [L108] EXPR \read(var_1_13) [L108] EXPR var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L108] EXPR (var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L108] EXPR (var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L108] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L108] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L109] var_1_17 = __VERIFIER_nondet_uchar() [L110] EXPR \read(var_1_17) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L110] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L110] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L111] EXPR \read(var_1_17) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L111] CALL assume_abort_if_not(var_1_17 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L111] RET assume_abort_if_not(var_1_17 <= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] var_1_18 = __VERIFIER_nondet_uchar() [L113] EXPR \read(var_1_18) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L113] CALL assume_abort_if_not(var_1_18 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L113] RET assume_abort_if_not(var_1_18 >= 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L114] EXPR \read(var_1_18) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L114] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L114] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L128] RET updateVariables() [L129] CALL step() [L54] EXPR \read(*var_1_3_Pointer) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L54] EXPR last_1_var_1_14 >> (*(var_1_3_Pointer)) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L54] COND TRUE (last_1_var_1_14 >> (*(var_1_3_Pointer))) >= last_1_var_1_14 [L55] EXPR \read(*var_1_3_Pointer) [L55] EXPR \read(*var_1_5_Pointer) [L55] EXPR \read(*var_1_6_Pointer) [L55] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L55] EXPR (((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))) [L55] EXPR \read(*var_1_7_Pointer) [L55] EXPR (((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L55] EXPR (((*(var_1_3_Pointer))) < (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer)))))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))))))) [L55] EXPR \read(*var_1_3_Pointer) [L55] EXPR (((*(var_1_3_Pointer))) < (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer)))))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))))))) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L55] (*(var_1_1_Pointer)) = (((((*(var_1_3_Pointer))) < (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer)))))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))))))))) [L59] EXPR \read(*var_1_8_Pointer) [L59] EXPR \read(*var_1_1_Pointer) [L59] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L59] COND FALSE !(((*(var_1_8_Pointer)) + (*(var_1_1_Pointer))) >= (*(var_1_7_Pointer))) [L62] EXPR \read(*var_1_12_Pointer) [L62] (*(var_1_12_Pointer)) || (*(var_1_10_Pointer)) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L62] (*(var_1_12_Pointer)) || (*(var_1_10_Pointer)) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L62] COND TRUE (*(var_1_12_Pointer)) || (*(var_1_10_Pointer)) [L63] EXPR \read(*var_1_1_Pointer) [L63] EXPR \read(*var_1_8_Pointer) [L63] EXPR \read(*var_1_3_Pointer) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L63] EXPR (*(var_1_8_Pointer)) << (*(var_1_3_Pointer)) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L63] COND FALSE !((*(var_1_1_Pointer)) >= ((*(var_1_8_Pointer)) << (*(var_1_3_Pointer)))) [L70] EXPR \read(*var_1_18_Pointer) [L70] (*(var_1_16_Pointer)) = (*(var_1_18_Pointer)) [L75] EXPR \read(*var_1_14_Pointer) [L75] unsigned char stepLocal_1 = (*(var_1_14_Pointer)); [L76] EXPR \read(*var_1_16_Pointer) [L76] unsigned char stepLocal_0 = (*(var_1_16_Pointer)); [L77] EXPR \read(*var_1_16_Pointer) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L77] COND TRUE (*(var_1_16_Pointer)) [L78] stepLocal_0 || (*(var_1_16_Pointer)) VAL [isInitial=1, last_1_var_1_14=64, stepLocal_1=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L78] stepLocal_0 || (*(var_1_16_Pointer)) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L78] COND TRUE stepLocal_0 || (*(var_1_16_Pointer)) [L79] EXPR \read(*var_1_6_Pointer) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L79] COND TRUE stepLocal_1 > (*(var_1_6_Pointer)) [L80] EXPR \read(*var_1_13_Pointer) [L80] (*(var_1_9_Pointer)) = (*(var_1_13_Pointer)) [L129] RET step() [L130] CALL, EXPR property() [L120] EXPR \read(*var_1_3_Pointer) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR last_1_var_1_14 >> (*(var_1_3_Pointer)) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR ((last_1_var_1_14 >> (*(var_1_3_Pointer))) >= last_1_var_1_14) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer)))))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))))))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) ((((((*(var_1_6_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_3_Pointer))))) + ((((((*(var_1_8_Pointer)) + 1)) < ((*(var_1_7_Pointer)))) ? (((*(var_1_8_Pointer)) + 1)) : ((*(var_1_7_Pointer)))))))) [L120] EXPR \read(*var_1_1_Pointer) [L120] EXPR \read(*var_1_3_Pointer) [L120] EXPR \read(*var_1_5_Pointer) [L120] EXPR \read(*var_1_6_Pointer) [L120] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR (((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))) [L120] EXPR \read(*var_1_7_Pointer) [L120] EXPR (((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR (((*(var_1_3_Pointer))) < (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer)))))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))))))) [L120] EXPR \read(*var_1_3_Pointer) [L120] EXPR (((*(var_1_3_Pointer))) < (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer)))))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))))))) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR ((last_1_var_1_14 >> (*(var_1_3_Pointer))) >= last_1_var_1_14) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer)))))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))))))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) ((((((*(var_1_6_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_3_Pointer))))) + ((((((*(var_1_8_Pointer)) + 1)) < ((*(var_1_7_Pointer)))) ? (((*(var_1_8_Pointer)) + 1)) : ((*(var_1_7_Pointer)))))))) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR (((last_1_var_1_14 >> (*(var_1_3_Pointer))) >= last_1_var_1_14) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer)))))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))))))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) ((((((*(var_1_6_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_3_Pointer))))) + ((((((*(var_1_8_Pointer)) + 1)) < ((*(var_1_7_Pointer)))) ? (((*(var_1_8_Pointer)) + 1)) : ((*(var_1_7_Pointer))))))))) && ((*(var_1_16_Pointer)) ? (((*(var_1_16_Pointer)) || (*(var_1_16_Pointer))) ? (((*(var_1_14_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) (*(var_1_13_Pointer)))) : 1) : 1) : 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR (((last_1_var_1_14 >> (*(var_1_3_Pointer))) >= last_1_var_1_14) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer)))))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))))))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) ((((((*(var_1_6_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_3_Pointer))))) + ((((((*(var_1_8_Pointer)) + 1)) < ((*(var_1_7_Pointer)))) ? (((*(var_1_8_Pointer)) + 1)) : ((*(var_1_7_Pointer))))))))) && ((*(var_1_16_Pointer)) ? (((*(var_1_16_Pointer)) || (*(var_1_16_Pointer))) ? (((*(var_1_14_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) (*(var_1_13_Pointer)))) : 1) : 1) : 1) [L120] EXPR \read(*var_1_16_Pointer) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR (*(var_1_16_Pointer)) ? (((*(var_1_16_Pointer)) || (*(var_1_16_Pointer))) ? (((*(var_1_14_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) (*(var_1_13_Pointer)))) : 1) : 1) : 1 [L120] EXPR \read(*var_1_16_Pointer) [L120] EXPR (*(var_1_16_Pointer)) || (*(var_1_16_Pointer)) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR (*(var_1_16_Pointer)) || (*(var_1_16_Pointer)) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR ((*(var_1_16_Pointer)) || (*(var_1_16_Pointer))) ? (((*(var_1_14_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) (*(var_1_13_Pointer)))) : 1) : 1 [L120] EXPR \read(*var_1_14_Pointer) [L120] EXPR \read(*var_1_6_Pointer) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR ((*(var_1_14_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) (*(var_1_13_Pointer)))) : 1 [L120] EXPR \read(*var_1_9_Pointer) [L120] EXPR \read(*var_1_13_Pointer) [L120] EXPR ((*(var_1_14_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) (*(var_1_13_Pointer)))) : 1 VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR ((*(var_1_16_Pointer)) || (*(var_1_16_Pointer))) ? (((*(var_1_14_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) (*(var_1_13_Pointer)))) : 1) : 1 VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR (*(var_1_16_Pointer)) ? (((*(var_1_16_Pointer)) || (*(var_1_16_Pointer))) ? (((*(var_1_14_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) (*(var_1_13_Pointer)))) : 1) : 1) : 1 VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR (((last_1_var_1_14 >> (*(var_1_3_Pointer))) >= last_1_var_1_14) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer)))))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))))))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) ((((((*(var_1_6_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_3_Pointer))))) + ((((((*(var_1_8_Pointer)) + 1)) < ((*(var_1_7_Pointer)))) ? (((*(var_1_8_Pointer)) + 1)) : ((*(var_1_7_Pointer))))))))) && ((*(var_1_16_Pointer)) ? (((*(var_1_16_Pointer)) || (*(var_1_16_Pointer))) ? (((*(var_1_14_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) (*(var_1_13_Pointer)))) : 1) : 1) : 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR ((((last_1_var_1_14 >> (*(var_1_3_Pointer))) >= last_1_var_1_14) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer)))))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))))))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) ((((((*(var_1_6_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_3_Pointer))))) + ((((((*(var_1_8_Pointer)) + 1)) < ((*(var_1_7_Pointer)))) ? (((*(var_1_8_Pointer)) + 1)) : ((*(var_1_7_Pointer))))))))) && ((*(var_1_16_Pointer)) ? (((*(var_1_16_Pointer)) || (*(var_1_16_Pointer))) ? (((*(var_1_14_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) (*(var_1_13_Pointer)))) : 1) : 1) : 1)) && ((((*(var_1_8_Pointer)) + (*(var_1_1_Pointer))) >= (*(var_1_7_Pointer))) ? ((*(var_1_14_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR ((((last_1_var_1_14 >> (*(var_1_3_Pointer))) >= last_1_var_1_14) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer)))))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))))))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) ((((((*(var_1_6_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_3_Pointer))))) + ((((((*(var_1_8_Pointer)) + 1)) < ((*(var_1_7_Pointer)))) ? (((*(var_1_8_Pointer)) + 1)) : ((*(var_1_7_Pointer))))))))) && ((*(var_1_16_Pointer)) ? (((*(var_1_16_Pointer)) || (*(var_1_16_Pointer))) ? (((*(var_1_14_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) (*(var_1_13_Pointer)))) : 1) : 1) : 1)) && ((((*(var_1_8_Pointer)) + (*(var_1_1_Pointer))) >= (*(var_1_7_Pointer))) ? ((*(var_1_14_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR (((((last_1_var_1_14 >> (*(var_1_3_Pointer))) >= last_1_var_1_14) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer)))))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))))))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) ((((((*(var_1_6_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_3_Pointer))))) + ((((((*(var_1_8_Pointer)) + 1)) < ((*(var_1_7_Pointer)))) ? (((*(var_1_8_Pointer)) + 1)) : ((*(var_1_7_Pointer))))))))) && ((*(var_1_16_Pointer)) ? (((*(var_1_16_Pointer)) || (*(var_1_16_Pointer))) ? (((*(var_1_14_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) (*(var_1_13_Pointer)))) : 1) : 1) : 1)) && ((((*(var_1_8_Pointer)) + (*(var_1_1_Pointer))) >= (*(var_1_7_Pointer))) ? ((*(var_1_14_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : 1)) && (((*(var_1_12_Pointer)) || (*(var_1_10_Pointer))) ? (((*(var_1_1_Pointer)) >= ((*(var_1_8_Pointer)) << (*(var_1_3_Pointer)))) ? (((*(var_1_6_Pointer)) > (*(var_1_7_Pointer))) ? ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_17_Pointer)))) : ((*(var_1_16_Pointer)) == ((unsigned char) 1))) : ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_18_Pointer))))) : ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_17_Pointer))))) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR (((((last_1_var_1_14 >> (*(var_1_3_Pointer))) >= last_1_var_1_14) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer)))))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))))))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) ((((((*(var_1_6_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_3_Pointer))))) + ((((((*(var_1_8_Pointer)) + 1)) < ((*(var_1_7_Pointer)))) ? (((*(var_1_8_Pointer)) + 1)) : ((*(var_1_7_Pointer))))))))) && ((*(var_1_16_Pointer)) ? (((*(var_1_16_Pointer)) || (*(var_1_16_Pointer))) ? (((*(var_1_14_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) (*(var_1_13_Pointer)))) : 1) : 1) : 1)) && ((((*(var_1_8_Pointer)) + (*(var_1_1_Pointer))) >= (*(var_1_7_Pointer))) ? ((*(var_1_14_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : 1)) && (((*(var_1_12_Pointer)) || (*(var_1_10_Pointer))) ? (((*(var_1_1_Pointer)) >= ((*(var_1_8_Pointer)) << (*(var_1_3_Pointer)))) ? (((*(var_1_6_Pointer)) > (*(var_1_7_Pointer))) ? ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_17_Pointer)))) : ((*(var_1_16_Pointer)) == ((unsigned char) 1))) : ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_18_Pointer))))) : ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_17_Pointer))))) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120-L121] return (((((last_1_var_1_14 >> (*(var_1_3_Pointer))) >= last_1_var_1_14) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer)))))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))))))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) ((((((*(var_1_6_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_3_Pointer))))) + ((((((*(var_1_8_Pointer)) + 1)) < ((*(var_1_7_Pointer)))) ? (((*(var_1_8_Pointer)) + 1)) : ((*(var_1_7_Pointer))))))))) && ((*(var_1_16_Pointer)) ? (((*(var_1_16_Pointer)) || (*(var_1_16_Pointer))) ? (((*(var_1_14_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) (*(var_1_13_Pointer)))) : 1) : 1) : 1)) && ((((*(var_1_8_Pointer)) + (*(var_1_1_Pointer))) >= (*(var_1_7_Pointer))) ? ((*(var_1_14_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : 1)) && (((*(var_1_12_Pointer)) || (*(var_1_10_Pointer))) ? (((*(var_1_1_Pointer)) >= ((*(var_1_8_Pointer)) << (*(var_1_3_Pointer)))) ? (((*(var_1_6_Pointer)) > (*(var_1_7_Pointer))) ? ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_17_Pointer)))) : ((*(var_1_16_Pointer)) == ((unsigned char) 1))) : ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_18_Pointer))))) : ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_17_Pointer))))) ; [L130] RET, EXPR property() [L130] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 126 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 83.2s, OverallIterations: 50, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 35.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11507 SdHoareTripleChecker+Valid, 17.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11507 mSDsluCounter, 58506 SdHoareTripleChecker+Invalid, 15.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 48341 mSDsCounter, 1332 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15714 IncrementalHoareTripleChecker+Invalid, 17046 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1332 mSolverCounterUnsat, 10165 mSDtfsCounter, 15714 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2857 GetRequests, 2329 SyntacticMatches, 6 SemanticMatches, 522 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1688 ImplicationChecksByTransitivity, 14.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7214occurred in iteration=49, InterpolantAutomatonStates: 415, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.5s AutomataMinimizationTime, 49 MinimizatonAttempts, 7377 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 35.0s InterpolantComputationTime, 7953 NumberOfCodeBlocks, 7953 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 7900 ConstructedInterpolants, 0 QuantifiedInterpolants, 26907 SizeOfPredicates, 10 NumberOfNonLiveVariables, 670 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 51 InterpolantComputations, 48 PerfectInterpolantSequences, 34674/34884 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-13 12:45:33,027 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/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_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-56.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/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 b7631e67103b054fabd01a8c7dc28db4ad53089a3ed7fae04e9555b7ae75d07e --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 12:45:35,964 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 12:45:36,100 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 12:45:36,116 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 12:45:36,118 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 12:45:36,141 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 12:45:36,142 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 12:45:36,142 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 12:45:36,143 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 12:45:36,143 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 12:45:36,143 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 12:45:36,143 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 12:45:36,144 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 12:45:36,144 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 12:45:36,144 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 12:45:36,144 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 12:45:36,144 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 12:45:36,144 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 12:45:36,145 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 12:45:36,145 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 12:45:36,145 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 12:45:36,145 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 12:45:36,145 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 12:45:36,145 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 12:45:36,145 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 12:45:36,146 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 12:45:36,146 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 12:45:36,146 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 12:45:36,146 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 12:45:36,146 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 12:45:36,146 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 12:45:36,147 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 12:45:36,147 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 12:45:36,147 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 12:45:36,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:45:36,147 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 12:45:36,147 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 12:45:36,148 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 12:45:36,148 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 12:45:36,148 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 12:45:36,148 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 12:45:36,148 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 12:45:36,148 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 12:45:36,148 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 12:45:36,148 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_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/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 -> b7631e67103b054fabd01a8c7dc28db4ad53089a3ed7fae04e9555b7ae75d07e [2024-11-13 12:45:36,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 12:45:36,509 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 12:45:36,512 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 12:45:36,513 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 12:45:36,514 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 12:45:36,515 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-56.i Unable to find full path for "g++" [2024-11-13 12:45:38,563 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 12:45:38,859 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 12:45:38,863 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-56.i [2024-11-13 12:45:38,876 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/data/adbf753f5/4341f1ae8dd14d01ad3e6ae75ac9d464/FLAGb4e4763b3 [2024-11-13 12:45:39,146 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/data/adbf753f5/4341f1ae8dd14d01ad3e6ae75ac9d464 [2024-11-13 12:45:39,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 12:45:39,152 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 12:45:39,156 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 12:45:39,156 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 12:45:39,161 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 12:45:39,162 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:45:39" (1/1) ... [2024-11-13 12:45:39,163 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ebe7064 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:39, skipping insertion in model container [2024-11-13 12:45:39,165 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:45:39" (1/1) ... [2024-11-13 12:45:39,188 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 12:45:39,362 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_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-56.i[916,929] [2024-11-13 12:45:39,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:45:39,486 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 12:45:39,501 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_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-56.i[916,929] [2024-11-13 12:45:39,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:45:39,594 INFO L204 MainTranslator]: Completed translation [2024-11-13 12:45:39,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:39 WrapperNode [2024-11-13 12:45:39,595 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 12:45:39,596 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 12:45:39,596 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 12:45:39,597 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 12:45:39,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:39" (1/1) ... [2024-11-13 12:45:39,627 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:39" (1/1) ... [2024-11-13 12:45:39,710 INFO L138 Inliner]: procedures = 30, calls = 191, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 579 [2024-11-13 12:45:39,714 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 12:45:39,714 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 12:45:39,715 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 12:45:39,715 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 12:45:39,730 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:39" (1/1) ... [2024-11-13 12:45:39,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:39" (1/1) ... [2024-11-13 12:45:39,745 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:39" (1/1) ... [2024-11-13 12:45:39,796 INFO L175 MemorySlicer]: Split 147 memory accesses to 15 slices as follows [2, 9, 16, 8, 22, 20, 12, 3, 6, 6, 8, 6, 15, 8, 6]. 15 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 18 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1]. [2024-11-13 12:45:39,797 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:39" (1/1) ... [2024-11-13 12:45:39,797 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:39" (1/1) ... [2024-11-13 12:45:39,821 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:39" (1/1) ... [2024-11-13 12:45:39,826 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:39" (1/1) ... [2024-11-13 12:45:39,832 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:39" (1/1) ... [2024-11-13 12:45:39,835 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:39" (1/1) ... [2024-11-13 12:45:39,842 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 12:45:39,843 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 12:45:39,844 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 12:45:39,844 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 12:45:39,845 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:39" (1/1) ... [2024-11-13 12:45:39,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:45:39,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:45:39,881 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 12:45:39,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 12:45:39,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 12:45:39,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-13 12:45:39,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-13 12:45:39,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-13 12:45:39,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-13 12:45:39,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-13 12:45:39,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-13 12:45:39,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-11-13 12:45:39,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2024-11-13 12:45:39,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2024-11-13 12:45:39,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2024-11-13 12:45:39,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#10 [2024-11-13 12:45:39,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#11 [2024-11-13 12:45:39,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#12 [2024-11-13 12:45:39,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#13 [2024-11-13 12:45:39,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#14 [2024-11-13 12:45:39,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-13 12:45:39,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-13 12:45:39,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-13 12:45:39,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-13 12:45:39,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-13 12:45:39,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-13 12:45:39,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-11-13 12:45:39,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2024-11-13 12:45:39,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2024-11-13 12:45:39,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2024-11-13 12:45:39,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#10 [2024-11-13 12:45:39,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#11 [2024-11-13 12:45:39,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#12 [2024-11-13 12:45:39,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#13 [2024-11-13 12:45:39,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#14 [2024-11-13 12:45:39,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-13 12:45:39,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-13 12:45:39,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-13 12:45:39,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-13 12:45:39,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-13 12:45:39,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-13 12:45:39,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-13 12:45:39,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-13 12:45:39,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-11-13 12:45:39,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-11-13 12:45:39,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-11-13 12:45:39,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-11-13 12:45:39,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-11-13 12:45:39,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2024-11-13 12:45:39,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2024-11-13 12:45:39,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 12:45:39,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-13 12:45:39,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-13 12:45:39,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-13 12:45:39,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-13 12:45:39,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-13 12:45:39,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-13 12:45:39,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-13 12:45:39,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-11-13 12:45:39,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-11-13 12:45:39,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-11-13 12:45:39,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-11-13 12:45:39,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-11-13 12:45:39,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2024-11-13 12:45:39,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2024-11-13 12:45:39,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-13 12:45:39,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-13 12:45:39,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-13 12:45:39,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-13 12:45:39,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-13 12:45:39,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-13 12:45:39,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-11-13 12:45:39,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2024-11-13 12:45:39,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2024-11-13 12:45:39,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2024-11-13 12:45:39,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#10 [2024-11-13 12:45:39,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#11 [2024-11-13 12:45:39,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#12 [2024-11-13 12:45:39,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#13 [2024-11-13 12:45:39,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#14 [2024-11-13 12:45:39,926 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 12:45:39,926 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 12:45:39,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 12:45:39,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 12:45:39,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-13 12:45:39,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-13 12:45:39,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-13 12:45:39,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-13 12:45:39,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-13 12:45:39,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-13 12:45:39,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-13 12:45:39,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-13 12:45:39,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-11-13 12:45:39,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-11-13 12:45:39,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-11-13 12:45:39,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-11-13 12:45:39,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-11-13 12:45:39,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2024-11-13 12:45:39,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2024-11-13 12:45:40,229 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 12:45:40,231 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 12:45:41,182 INFO L? ?]: Removed 148 outVars from TransFormulas that were not future-live. [2024-11-13 12:45:41,184 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 12:45:41,198 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 12:45:41,199 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 12:45:41,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:45:41 BoogieIcfgContainer [2024-11-13 12:45:41,200 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 12:45:41,221 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 12:45:41,221 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 12:45:41,228 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 12:45:41,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 12:45:39" (1/3) ... [2024-11-13 12:45:41,229 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a4f27f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:45:41, skipping insertion in model container [2024-11-13 12:45:41,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:39" (2/3) ... [2024-11-13 12:45:41,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a4f27f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:45:41, skipping insertion in model container [2024-11-13 12:45:41,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:45:41" (3/3) ... [2024-11-13 12:45:41,233 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-56.i [2024-11-13 12:45:41,248 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 12:45:41,250 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-56.i that has 2 procedures, 118 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 12:45:41,323 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 12:45:41,333 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;@2220f5b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 12:45:41,333 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 12:45:41,339 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 96 states have (on average 1.4270833333333333) internal successors, (137), 97 states have internal predecessors, (137), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-13 12:45:41,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-13 12:45:41,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:41,356 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:41,356 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:41,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:41,364 INFO L85 PathProgramCache]: Analyzing trace with hash -38840146, now seen corresponding path program 1 times [2024-11-13 12:45:41,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:45:41,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1408638214] [2024-11-13 12:45:41,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:41,377 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:45:41,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:45:41,380 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:45:41,381 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-13 12:45:41,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:41,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 12:45:41,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:45:41,936 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2024-11-13 12:45:41,937 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:45:41,938 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:45:41,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1408638214] [2024-11-13 12:45:41,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1408638214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:41,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:41,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 12:45:41,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729320365] [2024-11-13 12:45:41,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:41,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 12:45:41,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:45:41,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 12:45:41,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 12:45:41,974 INFO L87 Difference]: Start difference. First operand has 118 states, 96 states have (on average 1.4270833333333333) internal successors, (137), 97 states have internal predecessors, (137), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-13 12:45:42,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:42,013 INFO L93 Difference]: Finished difference Result 229 states and 363 transitions. [2024-11-13 12:45:42,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:45:42,016 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 149 [2024-11-13 12:45:42,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:42,026 INFO L225 Difference]: With dead ends: 229 [2024-11-13 12:45:42,027 INFO L226 Difference]: Without dead ends: 114 [2024-11-13 12:45:42,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 148 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 12:45:42,036 INFO L432 NwaCegarLoop]: 168 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, 168 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 12:45:42,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:45:42,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-13 12:45:42,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-13 12:45:42,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 93 states have (on average 1.3978494623655915) internal successors, (130), 93 states have internal predecessors, (130), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-13 12:45:42,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 168 transitions. [2024-11-13 12:45:42,091 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 168 transitions. Word has length 149 [2024-11-13 12:45:42,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:42,092 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 168 transitions. [2024-11-13 12:45:42,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-13 12:45:42,092 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 168 transitions. [2024-11-13 12:45:42,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-13 12:45:42,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:42,103 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:42,108 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-13 12:45:42,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:45:42,304 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:42,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:42,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1928735004, now seen corresponding path program 1 times [2024-11-13 12:45:42,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:45:42,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1370472239] [2024-11-13 12:45:42,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:42,306 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:45:42,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:45:42,308 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:45:42,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-13 12:45:42,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:42,759 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 12:45:42,768 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:45:42,808 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:45:42,809 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:45:42,809 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:45:42,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1370472239] [2024-11-13 12:45:42,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1370472239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:42,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:42,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:45:42,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540545446] [2024-11-13 12:45:42,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:42,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:45:42,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:45:42,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:45:42,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:45:42,814 INFO L87 Difference]: Start difference. First operand 114 states and 168 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:45:42,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:42,857 INFO L93 Difference]: Finished difference Result 226 states and 335 transitions. [2024-11-13 12:45:42,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:45:42,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 149 [2024-11-13 12:45:42,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:42,865 INFO L225 Difference]: With dead ends: 226 [2024-11-13 12:45:42,865 INFO L226 Difference]: Without dead ends: 115 [2024-11-13 12:45:42,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 147 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 12:45:42,869 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 328 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 12:45:42,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 328 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:45:42,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-13 12:45:42,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-13 12:45:42,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 94 states have (on average 1.3936170212765957) internal successors, (131), 94 states have internal predecessors, (131), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-13 12:45:42,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 169 transitions. [2024-11-13 12:45:42,895 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 169 transitions. Word has length 149 [2024-11-13 12:45:42,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:42,896 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 169 transitions. [2024-11-13 12:45:42,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:45:42,897 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 169 transitions. [2024-11-13 12:45:42,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-13 12:45:42,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:42,899 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:42,908 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-13 12:45:43,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:45:43,100 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:43,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:43,102 INFO L85 PathProgramCache]: Analyzing trace with hash 239791262, now seen corresponding path program 1 times [2024-11-13 12:45:43,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:45:43,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [186641204] [2024-11-13 12:45:43,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:43,103 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:45:43,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:45:43,107 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:45:43,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-13 12:45:43,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:43,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-13 12:45:43,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:45:43,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-13 12:45:45,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2024-11-13 12:45:45,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2024-11-13 12:45:45,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2024-11-13 12:45:46,101 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 17 proven. 123 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-13 12:45:46,101 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:45:46,527 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:45:46,527 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:45:46,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [186641204] [2024-11-13 12:45:46,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [186641204] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:45:46,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:45:46,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [20] total 26 [2024-11-13 12:45:46,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328821701] [2024-11-13 12:45:46,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:46,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 12:45:46,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:45:46,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 12:45:46,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2024-11-13 12:45:46,530 INFO L87 Difference]: Start difference. First operand 115 states and 169 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:45:46,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:46,954 INFO L93 Difference]: Finished difference Result 285 states and 421 transitions. [2024-11-13 12:45:46,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 12:45:46,955 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 149 [2024-11-13 12:45:46,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:46,957 INFO L225 Difference]: With dead ends: 285 [2024-11-13 12:45:46,957 INFO L226 Difference]: Without dead ends: 173 [2024-11-13 12:45:46,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=86, Invalid=784, Unknown=0, NotChecked=0, Total=870 [2024-11-13 12:45:46,959 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 80 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:46,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1055 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 12:45:46,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-13 12:45:46,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 136. [2024-11-13 12:45:46,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 115 states have (on average 1.4260869565217391) internal successors, (164), 115 states have internal predecessors, (164), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-13 12:45:46,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 202 transitions. [2024-11-13 12:45:46,972 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 202 transitions. Word has length 149 [2024-11-13 12:45:46,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:46,973 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 202 transitions. [2024-11-13 12:45:46,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:45:46,973 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 202 transitions. [2024-11-13 12:45:46,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-13 12:45:46,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:46,976 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:46,983 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-13 12:45:47,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:45:47,177 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:47,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:47,177 INFO L85 PathProgramCache]: Analyzing trace with hash -2131087195, now seen corresponding path program 1 times [2024-11-13 12:45:47,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:45:47,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1860942117] [2024-11-13 12:45:47,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:47,178 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:45:47,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:45:47,182 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:45:47,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-13 12:45:47,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:47,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-13 12:45:47,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:45:47,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-13 12:45:49,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2024-11-13 12:45:49,394 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 17 proven. 123 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-13 12:45:49,394 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:45:49,786 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:45:49,786 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:45:49,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1860942117] [2024-11-13 12:45:49,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1860942117] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:45:49,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:45:49,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2024-11-13 12:45:49,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876932454] [2024-11-13 12:45:49,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:49,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:45:49,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:45:49,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:45:49,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2024-11-13 12:45:49,789 INFO L87 Difference]: Start difference. First operand 136 states and 202 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:45:49,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:49,983 INFO L93 Difference]: Finished difference Result 318 states and 475 transitions. [2024-11-13 12:45:49,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:45:49,984 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2024-11-13 12:45:49,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:49,987 INFO L225 Difference]: With dead ends: 318 [2024-11-13 12:45:49,987 INFO L226 Difference]: Without dead ends: 185 [2024-11-13 12:45:49,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2024-11-13 12:45:49,989 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 71 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:49,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 653 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:45:49,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-13 12:45:49,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 151. [2024-11-13 12:45:49,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 130 states have (on average 1.4384615384615385) internal successors, (187), 130 states have internal predecessors, (187), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-13 12:45:50,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 225 transitions. [2024-11-13 12:45:50,002 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 225 transitions. Word has length 150 [2024-11-13 12:45:50,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:50,002 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 225 transitions. [2024-11-13 12:45:50,002 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:45:50,003 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 225 transitions. [2024-11-13 12:45:50,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-13 12:45:50,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:50,005 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:50,012 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-13 12:45:50,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:45:50,206 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:50,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:50,206 INFO L85 PathProgramCache]: Analyzing trace with hash -626778887, now seen corresponding path program 1 times [2024-11-13 12:45:50,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:45:50,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678014981] [2024-11-13 12:45:50,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:50,207 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:45:50,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:45:50,209 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:45:50,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-13 12:45:50,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:50,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-13 12:45:50,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:45:50,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-13 12:45:50,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-13 12:45:51,186 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:45:51,186 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:45:51,186 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:45:51,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1678014981] [2024-11-13 12:45:51,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1678014981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:51,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:51,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 12:45:51,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511084930] [2024-11-13 12:45:51,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:51,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 12:45:51,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:45:51,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 12:45:51,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-13 12:45:51,189 INFO L87 Difference]: Start difference. First operand 151 states and 225 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:45:53,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:53,403 INFO L93 Difference]: Finished difference Result 588 states and 878 transitions. [2024-11-13 12:45:53,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:45:53,404 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2024-11-13 12:45:53,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:53,407 INFO L225 Difference]: With dead ends: 588 [2024-11-13 12:45:53,407 INFO L226 Difference]: Without dead ends: 440 [2024-11-13 12:45:53,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-11-13 12:45:53,409 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 454 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:53,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 1139 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-13 12:45:53,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-11-13 12:45:53,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 310. [2024-11-13 12:45:53,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 269 states have (on average 1.449814126394052) internal successors, (390), 269 states have internal predecessors, (390), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-13 12:45:53,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 466 transitions. [2024-11-13 12:45:53,440 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 466 transitions. Word has length 150 [2024-11-13 12:45:53,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:53,441 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 466 transitions. [2024-11-13 12:45:53,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:45:53,441 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 466 transitions. [2024-11-13 12:45:53,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 12:45:53,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:53,444 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:45:53,450 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-13 12:45:53,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:45:53,645 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:45:53,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:53,646 INFO L85 PathProgramCache]: Analyzing trace with hash -2100432968, now seen corresponding path program 1 times [2024-11-13 12:45:53,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:45:53,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1212593057] [2024-11-13 12:45:53,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:53,647 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:45:53,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:45:53,649 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:45:53,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-13 12:45:53,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:53,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-13 12:45:54,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:45:54,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-13 12:46:04,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2024-11-13 12:46:05,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2024-11-13 12:46:05,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-13 12:46:05,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-13 12:46:06,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 56 [2024-11-13 12:46:06,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2024-11-13 12:46:06,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 51 [2024-11-13 12:46:07,043 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 13 proven. 523 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-13 12:46:07,043 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:46:09,690 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:46:09,690 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:46:09,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1212593057] [2024-11-13 12:46:09,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1212593057] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:46:09,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:46:09,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [43] total 54 [2024-11-13 12:46:09,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19757135] [2024-11-13 12:46:09,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:46:09,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 12:46:09,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:46:09,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 12:46:09,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=2660, Unknown=0, NotChecked=0, Total=2862 [2024-11-13 12:46:09,694 INFO L87 Difference]: Start difference. First operand 310 states and 466 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:46:13,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:46:13,050 INFO L93 Difference]: Finished difference Result 779 states and 1169 transitions. [2024-11-13 12:46:13,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 12:46:13,053 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-11-13 12:46:13,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:46:13,059 INFO L225 Difference]: With dead ends: 779 [2024-11-13 12:46:13,059 INFO L226 Difference]: Without dead ends: 472 [2024-11-13 12:46:13,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1067 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=321, Invalid=3461, Unknown=0, NotChecked=0, Total=3782 [2024-11-13 12:46:13,061 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 480 mSDsluCounter, 1345 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 1534 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-13 12:46:13,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 1534 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-13 12:46:13,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2024-11-13 12:46:13,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 352. [2024-11-13 12:46:13,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 311 states have (on average 1.4662379421221865) internal successors, (456), 311 states have internal predecessors, (456), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-13 12:46:13,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 532 transitions. [2024-11-13 12:46:13,091 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 532 transitions. Word has length 151 [2024-11-13 12:46:13,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:46:13,092 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 532 transitions. [2024-11-13 12:46:13,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:46:13,092 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 532 transitions. [2024-11-13 12:46:13,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 12:46:13,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:46:13,095 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:46:13,102 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-13 12:46:13,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:46:13,295 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:46:13,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:46:13,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1607728314, now seen corresponding path program 1 times [2024-11-13 12:46:13,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:46:13,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1683660912] [2024-11-13 12:46:13,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:13,296 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:46:13,296 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:46:13,298 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:46:13,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-13 12:46:13,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:13,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-13 12:46:13,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:46:14,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-13 12:46:22,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2024-11-13 12:46:23,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2024-11-13 12:46:24,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-11-13 12:46:24,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-13 12:46:24,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2024-11-13 12:46:25,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 59 [2024-11-13 12:46:25,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2024-11-13 12:46:25,813 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 13 proven. 523 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-13 12:46:25,813 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:46:27,570 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:46:27,570 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:46:27,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1683660912] [2024-11-13 12:46:27,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1683660912] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:46:27,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:46:27,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [42] total 52 [2024-11-13 12:46:27,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458143060] [2024-11-13 12:46:27,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:46:27,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 12:46:27,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:46:27,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 12:46:27,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=2454, Unknown=0, NotChecked=0, Total=2652 [2024-11-13 12:46:27,573 INFO L87 Difference]: Start difference. First operand 352 states and 532 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:46:29,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:46:29,970 INFO L93 Difference]: Finished difference Result 853 states and 1272 transitions. [2024-11-13 12:46:29,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 12:46:29,973 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-11-13 12:46:29,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:46:29,977 INFO L225 Difference]: With dead ends: 853 [2024-11-13 12:46:29,977 INFO L226 Difference]: Without dead ends: 504 [2024-11-13 12:46:29,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 953 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=282, Invalid=3024, Unknown=0, NotChecked=0, Total=3306 [2024-11-13 12:46:29,981 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 483 mSDsluCounter, 1224 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 1449 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-13 12:46:29,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 1449 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-13 12:46:29,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2024-11-13 12:46:30,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 451. [2024-11-13 12:46:30,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 400 states have (on average 1.4525) internal successors, (581), 402 states have internal predecessors, (581), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-13 12:46:30,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 673 transitions. [2024-11-13 12:46:30,034 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 673 transitions. Word has length 151 [2024-11-13 12:46:30,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:46:30,036 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 673 transitions. [2024-11-13 12:46:30,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:46:30,036 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 673 transitions. [2024-11-13 12:46:30,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 12:46:30,038 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:46:30,038 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:46:30,045 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-13 12:46:30,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:46:30,242 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:46:30,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:46:30,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1771832502, now seen corresponding path program 1 times [2024-11-13 12:46:30,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:46:30,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [627136696] [2024-11-13 12:46:30,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:30,243 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:46:30,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:46:30,245 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:46:30,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-13 12:46:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:30,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-13 12:46:30,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:46:30,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-13 12:46:34,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2024-11-13 12:46:34,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2024-11-13 12:46:35,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 30 [2024-11-13 12:46:35,272 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 13 proven. 347 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-11-13 12:46:35,272 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:46:36,164 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:46:36,164 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:46:36,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [627136696] [2024-11-13 12:46:36,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [627136696] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:46:36,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:46:36,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [24] total 30 [2024-11-13 12:46:36,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594655411] [2024-11-13 12:46:36,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:46:36,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 12:46:36,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:46:36,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 12:46:36,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=785, Unknown=0, NotChecked=0, Total=870 [2024-11-13 12:46:36,166 INFO L87 Difference]: Start difference. First operand 451 states and 673 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:46:37,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:46:37,040 INFO L93 Difference]: Finished difference Result 1006 states and 1502 transitions. [2024-11-13 12:46:37,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:46:37,043 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-11-13 12:46:37,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:46:37,052 INFO L225 Difference]: With dead ends: 1006 [2024-11-13 12:46:37,052 INFO L226 Difference]: Without dead ends: 558 [2024-11-13 12:46:37,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=108, Invalid=948, Unknown=0, NotChecked=0, Total=1056 [2024-11-13 12:46:37,058 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 200 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 12:46:37,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 821 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 12:46:37,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2024-11-13 12:46:37,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 489. [2024-11-13 12:46:37,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 438 states have (on average 1.4589041095890412) internal successors, (639), 440 states have internal predecessors, (639), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-13 12:46:37,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 731 transitions. [2024-11-13 12:46:37,116 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 731 transitions. Word has length 151 [2024-11-13 12:46:37,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:46:37,119 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 731 transitions. [2024-11-13 12:46:37,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:46:37,120 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 731 transitions. [2024-11-13 12:46:37,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 12:46:37,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:46:37,123 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:46:37,133 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-13 12:46:37,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:46:37,324 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:46:37,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:46:37,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1185026488, now seen corresponding path program 1 times [2024-11-13 12:46:37,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:46:37,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [397528042] [2024-11-13 12:46:37,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:37,325 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:46:37,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:46:37,327 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:46:37,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-13 12:46:37,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:37,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-13 12:46:37,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:46:39,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-11-13 12:46:39,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2024-11-13 12:46:39,341 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 412 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-13 12:46:39,341 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:46:39,670 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:46:39,670 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:46:39,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [397528042] [2024-11-13 12:46:39,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [397528042] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:46:39,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:46:39,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2024-11-13 12:46:39,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414361635] [2024-11-13 12:46:39,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:46:39,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:46:39,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:46:39,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:46:39,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-11-13 12:46:39,672 INFO L87 Difference]: Start difference. First operand 489 states and 731 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:46:40,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:46:40,033 INFO L93 Difference]: Finished difference Result 1104 states and 1642 transitions. [2024-11-13 12:46:40,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:46:40,034 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-11-13 12:46:40,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:46:40,042 INFO L225 Difference]: With dead ends: 1104 [2024-11-13 12:46:40,043 INFO L226 Difference]: Without dead ends: 618 [2024-11-13 12:46:40,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-11-13 12:46:40,047 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 156 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:46:40,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 424 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 12:46:40,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-11-13 12:46:40,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 478. [2024-11-13 12:46:40,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 427 states have (on average 1.4473067915690867) internal successors, (618), 429 states have internal predecessors, (618), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-13 12:46:40,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 710 transitions. [2024-11-13 12:46:40,094 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 710 transitions. Word has length 151 [2024-11-13 12:46:40,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:46:40,095 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 710 transitions. [2024-11-13 12:46:40,095 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:46:40,095 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 710 transitions. [2024-11-13 12:46:40,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 12:46:40,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:46:40,098 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:46:40,106 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-13 12:46:40,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:46:40,299 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:46:40,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:46:40,300 INFO L85 PathProgramCache]: Analyzing trace with hash -600392093, now seen corresponding path program 1 times [2024-11-13 12:46:40,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:46:40,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1952030359] [2024-11-13 12:46:40,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:40,301 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:46:40,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:46:40,304 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:46:40,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-13 12:46:40,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:40,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 12:46:40,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:46:40,767 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:46:40,767 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:46:40,767 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:46:40,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1952030359] [2024-11-13 12:46:40,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1952030359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:46:40,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:46:40,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:46:40,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71795122] [2024-11-13 12:46:40,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:46:40,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:46:40,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:46:40,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:46:40,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:46:40,770 INFO L87 Difference]: Start difference. First operand 478 states and 710 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:46:40,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:46:40,832 INFO L93 Difference]: Finished difference Result 965 states and 1433 transitions. [2024-11-13 12:46:40,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:46:40,833 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-11-13 12:46:40,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:46:40,837 INFO L225 Difference]: With dead ends: 965 [2024-11-13 12:46:40,837 INFO L226 Difference]: Without dead ends: 490 [2024-11-13 12:46:40,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 147 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 12:46:40,839 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 643 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 12:46:40,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 643 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:46:40,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2024-11-13 12:46:40,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2024-11-13 12:46:40,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 439 states have (on average 1.4350797266514805) internal successors, (630), 441 states have internal predecessors, (630), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-13 12:46:40,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 722 transitions. [2024-11-13 12:46:40,883 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 722 transitions. Word has length 151 [2024-11-13 12:46:40,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:46:40,884 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 722 transitions. [2024-11-13 12:46:40,884 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:46:40,884 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 722 transitions. [2024-11-13 12:46:40,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 12:46:40,888 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:46:40,888 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:46:40,896 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-13 12:46:41,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:46:41,089 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:46:41,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:46:41,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1464003592, now seen corresponding path program 1 times [2024-11-13 12:46:41,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:46:41,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1285262014] [2024-11-13 12:46:41,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:41,091 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:46:41,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:46:41,093 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:46:41,095 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-13 12:46:41,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:41,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-13 12:46:41,534 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:46:41,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-13 12:46:46,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2024-11-13 12:46:46,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 34 [2024-11-13 12:46:46,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 29 [2024-11-13 12:46:47,159 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 15 proven. 353 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2024-11-13 12:46:47,159 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:46:48,122 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:46:48,122 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:46:48,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1285262014] [2024-11-13 12:46:48,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1285262014] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:46:48,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:46:48,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [28] total 34 [2024-11-13 12:46:48,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669198237] [2024-11-13 12:46:48,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:46:48,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 12:46:48,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:46:48,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 12:46:48,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2024-11-13 12:46:48,124 INFO L87 Difference]: Start difference. First operand 490 states and 722 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:46:48,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:46:48,946 INFO L93 Difference]: Finished difference Result 1037 states and 1524 transitions. [2024-11-13 12:46:48,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:46:48,948 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-11-13 12:46:48,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:46:48,952 INFO L225 Difference]: With dead ends: 1037 [2024-11-13 12:46:48,953 INFO L226 Difference]: Without dead ends: 550 [2024-11-13 12:46:48,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=119, Invalid=1213, Unknown=0, NotChecked=0, Total=1332 [2024-11-13 12:46:48,955 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 181 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 12:46:48,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 756 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 12:46:48,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-11-13 12:46:48,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 490. [2024-11-13 12:46:48,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 439 states have (on average 1.430523917995444) internal successors, (628), 441 states have internal predecessors, (628), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-13 12:46:49,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 720 transitions. [2024-11-13 12:46:49,001 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 720 transitions. Word has length 151 [2024-11-13 12:46:49,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:46:49,002 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 720 transitions. [2024-11-13 12:46:49,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:46:49,002 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 720 transitions. [2024-11-13 12:46:49,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 12:46:49,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:46:49,006 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:46:49,014 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-13 12:46:49,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:46:49,207 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:46:49,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:46:49,207 INFO L85 PathProgramCache]: Analyzing trace with hash -177204934, now seen corresponding path program 1 times [2024-11-13 12:46:49,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:46:49,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [581612049] [2024-11-13 12:46:49,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:49,208 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:46:49,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:46:49,213 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:46:49,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-13 12:46:49,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:49,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-13 12:46:49,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:46:51,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-13 12:46:51,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2024-11-13 12:46:51,482 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 412 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-13 12:46:51,483 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:46:51,746 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:46:51,746 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:46:51,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [581612049] [2024-11-13 12:46:51,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [581612049] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:46:51,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:46:51,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2024-11-13 12:46:51,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972270967] [2024-11-13 12:46:51,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:46:51,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:46:51,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:46:51,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:46:51,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-11-13 12:46:51,748 INFO L87 Difference]: Start difference. First operand 490 states and 720 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:46:52,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:46:52,108 INFO L93 Difference]: Finished difference Result 1070 states and 1564 transitions. [2024-11-13 12:46:52,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:46:52,109 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-11-13 12:46:52,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:46:52,113 INFO L225 Difference]: With dead ends: 1070 [2024-11-13 12:46:52,113 INFO L226 Difference]: Without dead ends: 583 [2024-11-13 12:46:52,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-11-13 12:46:52,116 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 176 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:46:52,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 554 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 12:46:52,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2024-11-13 12:46:52,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 483. [2024-11-13 12:46:52,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 432 states have (on average 1.4351851851851851) internal successors, (620), 434 states have internal predecessors, (620), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-13 12:46:52,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 712 transitions. [2024-11-13 12:46:52,150 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 712 transitions. Word has length 151 [2024-11-13 12:46:52,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:46:52,151 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 712 transitions. [2024-11-13 12:46:52,151 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:46:52,151 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 712 transitions. [2024-11-13 12:46:52,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 12:46:52,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:46:52,155 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:46:52,163 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-13 12:46:52,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:46:52,360 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:46:52,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:46:52,360 INFO L85 PathProgramCache]: Analyzing trace with hash -36656324, now seen corresponding path program 1 times [2024-11-13 12:46:52,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:46:52,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1547861373] [2024-11-13 12:46:52,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:46:52,361 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:46:52,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:46:52,364 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:46:52,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-13 12:46:52,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:46:52,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-13 12:46:52,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:46:53,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-13 12:47:01,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2024-11-13 12:47:02,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-11-13 12:47:02,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-13 12:47:02,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 43 [2024-11-13 12:47:04,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-13 12:47:05,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2024-11-13 12:47:06,700 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 14 proven. 502 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2024-11-13 12:47:06,700 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:47:12,448 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:47:12,448 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 47 treesize of output 50 [2024-11-13 12:47:13,128 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:47:13,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1547861373] [2024-11-13 12:47:13,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1547861373] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:47:13,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373536164] [2024-11-13 12:47:13,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:47:13,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:47:13,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:47:13,131 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:47:13,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-13 12:47:13,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:13,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-13 12:47:13,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:47:13,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-13 12:47:25,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2024-11-13 12:47:26,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2024-11-13 12:47:27,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2024-11-13 12:47:27,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-13 12:47:28,405 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 15 proven. 445 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2024-11-13 12:47:28,406 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:47:33,198 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:47:33,199 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 51 treesize of output 50 [2024-11-13 12:47:34,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373536164] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:47:34,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 12:47:34,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 28] total 67 [2024-11-13 12:47:34,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419241537] [2024-11-13 12:47:34,213 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 12:47:34,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2024-11-13 12:47:34,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:47:34,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2024-11-13 12:47:34,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=460, Invalid=8470, Unknown=0, NotChecked=0, Total=8930 [2024-11-13 12:47:34,218 INFO L87 Difference]: Start difference. First operand 483 states and 712 transitions. Second operand has 68 states, 59 states have (on average 2.5762711864406778) internal successors, (152), 57 states have internal predecessors, (152), 16 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (38), 9 states have call predecessors, (38), 16 states have call successors, (38) [2024-11-13 12:48:50,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:50,492 INFO L93 Difference]: Finished difference Result 1199 states and 1716 transitions. [2024-11-13 12:48:50,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2024-11-13 12:48:50,493 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 59 states have (on average 2.5762711864406778) internal successors, (152), 57 states have internal predecessors, (152), 16 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (38), 9 states have call predecessors, (38), 16 states have call successors, (38) Word has length 151 [2024-11-13 12:48:50,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:48:50,496 INFO L225 Difference]: With dead ends: 1199 [2024-11-13 12:48:50,497 INFO L226 Difference]: Without dead ends: 719 [2024-11-13 12:48:50,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 401 SyntacticMatches, 6 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6615 ImplicationChecksByTransitivity, 72.9s TimeCoverageRelationStatistics Valid=3386, Invalid=25344, Unknown=0, NotChecked=0, Total=28730 [2024-11-13 12:48:50,506 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 3175 mSDsluCounter, 7306 mSDsCounter, 0 mSdLazyCounter, 6336 mSolverCounterSat, 505 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3175 SdHoareTripleChecker+Valid, 7475 SdHoareTripleChecker+Invalid, 6841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 505 IncrementalHoareTripleChecker+Valid, 6336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.4s IncrementalHoareTripleChecker+Time [2024-11-13 12:48:50,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3175 Valid, 7475 Invalid, 6841 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [505 Valid, 6336 Invalid, 0 Unknown, 0 Unchecked, 30.4s Time] [2024-11-13 12:48:50,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2024-11-13 12:48:50,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 587. [2024-11-13 12:48:50,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 516 states have (on average 1.3875968992248062) internal successors, (716), 519 states have internal predecessors, (716), 52 states have call successors, (52), 18 states have call predecessors, (52), 18 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-13 12:48:50,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 820 transitions. [2024-11-13 12:48:50,563 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 820 transitions. Word has length 151 [2024-11-13 12:48:50,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:48:50,564 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 820 transitions. [2024-11-13 12:48:50,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 59 states have (on average 2.5762711864406778) internal successors, (152), 57 states have internal predecessors, (152), 16 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (38), 9 states have call predecessors, (38), 16 states have call successors, (38) [2024-11-13 12:48:50,564 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 820 transitions. [2024-11-13 12:48:50,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 12:48:50,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:48:50,567 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:48:50,573 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-13 12:48:50,782 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-13 12:48:50,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:48:50,968 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:48:50,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:50,968 INFO L85 PathProgramCache]: Analyzing trace with hash 459224442, now seen corresponding path program 1 times [2024-11-13 12:48:50,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:48:50,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [668622340] [2024-11-13 12:48:50,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:50,969 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:48:50,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:48:50,970 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:48:50,972 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-13 12:48:51,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:51,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-13 12:48:51,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:48:54,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-13 12:48:54,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2024-11-13 12:48:54,333 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 412 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-13 12:48:54,333 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:48:55,040 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:48:55,040 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:48:55,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [668622340] [2024-11-13 12:48:55,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [668622340] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:48:55,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:48:55,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [17] total 23 [2024-11-13 12:48:55,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836134631] [2024-11-13 12:48:55,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:48:55,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 12:48:55,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:48:55,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 12:48:55,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2024-11-13 12:48:55,042 INFO L87 Difference]: Start difference. First operand 587 states and 820 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:48:56,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:56,321 INFO L93 Difference]: Finished difference Result 1364 states and 1896 transitions. [2024-11-13 12:48:56,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:48:56,322 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-11-13 12:48:56,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:48:56,325 INFO L225 Difference]: With dead ends: 1364 [2024-11-13 12:48:56,325 INFO L226 Difference]: Without dead ends: 780 [2024-11-13 12:48:56,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2024-11-13 12:48:56,327 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 166 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:48:56,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 1045 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-13 12:48:56,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2024-11-13 12:48:56,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 615. [2024-11-13 12:48:56,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 544 states have (on average 1.3952205882352942) internal successors, (759), 547 states have internal predecessors, (759), 52 states have call successors, (52), 18 states have call predecessors, (52), 18 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-13 12:48:56,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 863 transitions. [2024-11-13 12:48:56,381 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 863 transitions. Word has length 151 [2024-11-13 12:48:56,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:48:56,381 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 863 transitions. [2024-11-13 12:48:56,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:48:56,382 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 863 transitions. [2024-11-13 12:48:56,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 12:48:56,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:48:56,384 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:48:56,391 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-13 12:48:56,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:48:56,585 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:48:56,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:56,585 INFO L85 PathProgramCache]: Analyzing trace with hash -820639236, now seen corresponding path program 1 times [2024-11-13 12:48:56,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:48:56,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [316603662] [2024-11-13 12:48:56,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:56,586 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:48:56,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:48:56,588 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:48:56,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-13 12:48:56,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:56,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-13 12:48:56,951 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:48:59,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-13 12:48:59,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2024-11-13 12:48:59,935 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 412 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-13 12:48:59,935 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:49:00,687 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:49:00,688 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:49:00,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [316603662] [2024-11-13 12:49:00,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [316603662] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:49:00,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:49:00,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [17] total 23 [2024-11-13 12:49:00,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605354125] [2024-11-13 12:49:00,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:49:00,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 12:49:00,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:49:00,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 12:49:00,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2024-11-13 12:49:00,690 INFO L87 Difference]: Start difference. First operand 615 states and 863 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:49:02,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:49:02,224 INFO L93 Difference]: Finished difference Result 1392 states and 1936 transitions. [2024-11-13 12:49:02,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:49:02,225 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-11-13 12:49:02,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:49:02,229 INFO L225 Difference]: With dead ends: 1392 [2024-11-13 12:49:02,229 INFO L226 Difference]: Without dead ends: 780 [2024-11-13 12:49:02,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2024-11-13 12:49:02,231 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 163 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:49:02,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 1047 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-13 12:49:02,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2024-11-13 12:49:02,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 619. [2024-11-13 12:49:02,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 548 states have (on average 1.3941605839416058) internal successors, (764), 551 states have internal predecessors, (764), 52 states have call successors, (52), 18 states have call predecessors, (52), 18 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-13 12:49:02,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 868 transitions. [2024-11-13 12:49:02,288 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 868 transitions. Word has length 151 [2024-11-13 12:49:02,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:49:02,289 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 868 transitions. [2024-11-13 12:49:02,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:49:02,289 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 868 transitions. [2024-11-13 12:49:02,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 12:49:02,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:49:02,291 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:49:02,297 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-13 12:49:02,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:49:02,492 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:49:02,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:49:02,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1407445250, now seen corresponding path program 1 times [2024-11-13 12:49:02,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:49:02,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2124161022] [2024-11-13 12:49:02,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:49:02,494 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:49:02,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:49:02,496 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:49:02,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-13 12:49:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:49:02,880 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-13 12:49:02,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:49:03,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-13 12:49:10,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2024-11-13 12:49:10,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 34 [2024-11-13 12:49:11,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 33 [2024-11-13 12:49:11,583 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 15 proven. 425 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2024-11-13 12:49:11,583 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:49:13,534 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:49:13,535 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:49:13,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2124161022] [2024-11-13 12:49:13,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2124161022] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:49:13,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:49:13,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [30] total 38 [2024-11-13 12:49:13,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173924024] [2024-11-13 12:49:13,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:49:13,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 12:49:13,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:49:13,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 12:49:13,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1283, Unknown=0, NotChecked=0, Total=1406 [2024-11-13 12:49:13,537 INFO L87 Difference]: Start difference. First operand 619 states and 868 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:49:15,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:49:15,714 INFO L93 Difference]: Finished difference Result 1339 states and 1873 transitions. [2024-11-13 12:49:15,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:49:15,716 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-11-13 12:49:15,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:49:15,720 INFO L225 Difference]: With dead ends: 1339 [2024-11-13 12:49:15,720 INFO L226 Difference]: Without dead ends: 723 [2024-11-13 12:49:15,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=166, Invalid=1556, Unknown=0, NotChecked=0, Total=1722 [2024-11-13 12:49:15,723 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 242 mSDsluCounter, 890 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-13 12:49:15,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 1104 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-13 12:49:15,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2024-11-13 12:49:15,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 616. [2024-11-13 12:49:15,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 545 states have (on average 1.3926605504587155) internal successors, (759), 548 states have internal predecessors, (759), 52 states have call successors, (52), 18 states have call predecessors, (52), 18 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-13 12:49:15,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 863 transitions. [2024-11-13 12:49:15,796 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 863 transitions. Word has length 151 [2024-11-13 12:49:15,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:49:15,797 INFO L471 AbstractCegarLoop]: Abstraction has 616 states and 863 transitions. [2024-11-13 12:49:15,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:49:15,797 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 863 transitions. [2024-11-13 12:49:15,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 12:49:15,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:49:15,799 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:49:15,806 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-13 12:49:16,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:49:16,003 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:49:16,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:49:16,003 INFO L85 PathProgramCache]: Analyzing trace with hash -2030304520, now seen corresponding path program 1 times [2024-11-13 12:49:16,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:49:16,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [548447867] [2024-11-13 12:49:16,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:49:16,004 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:49:16,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:49:16,006 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:49:16,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-13 12:49:16,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:49:16,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-13 12:49:16,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:49:19,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-13 12:49:19,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2024-11-13 12:49:19,221 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 412 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-13 12:49:19,221 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:49:19,692 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:49:19,692 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:49:19,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [548447867] [2024-11-13 12:49:19,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [548447867] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:49:19,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:49:19,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2024-11-13 12:49:19,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323444749] [2024-11-13 12:49:19,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:49:19,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:49:19,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:49:19,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:49:19,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-11-13 12:49:19,694 INFO L87 Difference]: Start difference. First operand 616 states and 863 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:49:20,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:49:20,086 INFO L93 Difference]: Finished difference Result 992 states and 1396 transitions. [2024-11-13 12:49:20,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:49:20,087 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-11-13 12:49:20,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:49:20,091 INFO L225 Difference]: With dead ends: 992 [2024-11-13 12:49:20,091 INFO L226 Difference]: Without dead ends: 725 [2024-11-13 12:49:20,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-11-13 12:49:20,093 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 154 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:49:20,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 556 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 12:49:20,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2024-11-13 12:49:20,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 616. [2024-11-13 12:49:20,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 545 states have (on average 1.3889908256880734) internal successors, (757), 548 states have internal predecessors, (757), 52 states have call successors, (52), 18 states have call predecessors, (52), 18 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-13 12:49:20,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 861 transitions. [2024-11-13 12:49:20,163 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 861 transitions. Word has length 151 [2024-11-13 12:49:20,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:49:20,164 INFO L471 AbstractCegarLoop]: Abstraction has 616 states and 861 transitions. [2024-11-13 12:49:20,164 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:49:20,164 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 861 transitions. [2024-11-13 12:49:20,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 12:49:20,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:49:20,166 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:49:20,173 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-13 12:49:20,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:49:20,367 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:49:20,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:49:20,370 INFO L85 PathProgramCache]: Analyzing trace with hash 984799098, now seen corresponding path program 1 times [2024-11-13 12:49:20,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:49:20,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1153263146] [2024-11-13 12:49:20,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:49:20,371 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:49:20,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:49:20,378 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:49:20,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-13 12:49:20,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:49:20,779 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-13 12:49:20,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:49:23,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-13 12:49:23,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2024-11-13 12:49:23,644 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 412 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-13 12:49:23,644 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:49:24,146 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:49:24,146 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:49:24,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1153263146] [2024-11-13 12:49:24,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1153263146] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:49:24,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:49:24,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2024-11-13 12:49:24,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290835657] [2024-11-13 12:49:24,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:49:24,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:49:24,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:49:24,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:49:24,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-11-13 12:49:24,148 INFO L87 Difference]: Start difference. First operand 616 states and 861 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:49:24,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:49:24,547 INFO L93 Difference]: Finished difference Result 992 states and 1392 transitions. [2024-11-13 12:49:24,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:49:24,548 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-11-13 12:49:24,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:49:24,552 INFO L225 Difference]: With dead ends: 992 [2024-11-13 12:49:24,552 INFO L226 Difference]: Without dead ends: 725 [2024-11-13 12:49:24,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-11-13 12:49:24,554 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 148 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:49:24,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 559 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 12:49:24,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2024-11-13 12:49:24,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 601. [2024-11-13 12:49:24,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 530 states have (on average 1.3830188679245283) internal successors, (733), 533 states have internal predecessors, (733), 52 states have call successors, (52), 18 states have call predecessors, (52), 18 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-13 12:49:24,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 837 transitions. [2024-11-13 12:49:24,630 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 837 transitions. Word has length 151 [2024-11-13 12:49:24,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:49:24,631 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 837 transitions. [2024-11-13 12:49:24,631 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:49:24,631 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 837 transitions. [2024-11-13 12:49:24,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 12:49:24,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:49:24,634 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:49:24,641 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2024-11-13 12:49:24,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:49:24,834 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:49:24,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:49:24,835 INFO L85 PathProgramCache]: Analyzing trace with hash 397993084, now seen corresponding path program 1 times [2024-11-13 12:49:24,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:49:24,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1689690467] [2024-11-13 12:49:24,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:49:24,836 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:49:24,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:49:24,840 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:49:24,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-13 12:49:25,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:49:25,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-13 12:49:25,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:49:25,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-13 12:49:35,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2024-11-13 12:49:35,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2024-11-13 12:49:35,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-13 12:49:36,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2024-11-13 12:49:36,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-13 12:49:36,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2024-11-13 12:49:36,942 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 14 proven. 502 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2024-11-13 12:49:36,942 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:49:42,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:49:42,015 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 39 treesize of output 42 [2024-11-13 12:49:43,155 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:49:43,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1689690467] [2024-11-13 12:49:43,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1689690467] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:49:43,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149540845] [2024-11-13 12:49:43,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:49:43,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:49:43,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:49:43,159 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:49:43,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-13 12:49:43,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:49:43,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-13 12:49:43,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:49:43,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-13 12:49:55,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2024-11-13 12:49:55,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2024-11-13 12:49:55,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-13 12:49:55,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2024-11-13 12:49:55,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-13 12:49:56,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2024-11-13 12:49:56,325 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 15 proven. 501 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2024-11-13 12:49:56,325 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:49:57,620 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:49:57,620 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 39 treesize of output 42 [2024-11-13 12:49:58,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149540845] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:49:58,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 12:49:58,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 31] total 55 [2024-11-13 12:49:58,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165983729] [2024-11-13 12:49:58,155 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 12:49:58,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-11-13 12:49:58,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:49:58,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-11-13 12:49:58,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=4575, Unknown=0, NotChecked=0, Total=4970 [2024-11-13 12:49:58,157 INFO L87 Difference]: Start difference. First operand 601 states and 837 transitions. Second operand has 56 states, 47 states have (on average 2.74468085106383) internal successors, (129), 46 states have internal predecessors, (129), 16 states have call successors, (38), 15 states have call predecessors, (38), 16 states have return successors, (38), 9 states have call predecessors, (38), 16 states have call successors, (38) [2024-11-13 12:50:29,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:50:29,234 INFO L93 Difference]: Finished difference Result 1051 states and 1477 transitions. [2024-11-13 12:50:29,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-13 12:50:29,235 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 47 states have (on average 2.74468085106383) internal successors, (129), 46 states have internal predecessors, (129), 16 states have call successors, (38), 15 states have call predecessors, (38), 16 states have return successors, (38), 9 states have call predecessors, (38), 16 states have call successors, (38) Word has length 151 [2024-11-13 12:50:29,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:50:29,237 INFO L225 Difference]: With dead ends: 1051 [2024-11-13 12:50:29,237 INFO L226 Difference]: Without dead ends: 799 [2024-11-13 12:50:29,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 421 SyntacticMatches, 4 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3434 ImplicationChecksByTransitivity, 31.4s TimeCoverageRelationStatistics Valid=1663, Invalid=11219, Unknown=0, NotChecked=0, Total=12882 [2024-11-13 12:50:29,239 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 3143 mSDsluCounter, 7031 mSDsCounter, 0 mSdLazyCounter, 3784 mSolverCounterSat, 300 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3143 SdHoareTripleChecker+Valid, 7238 SdHoareTripleChecker+Invalid, 4084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 300 IncrementalHoareTripleChecker+Valid, 3784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.6s IncrementalHoareTripleChecker+Time [2024-11-13 12:50:29,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3143 Valid, 7238 Invalid, 4084 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [300 Valid, 3784 Invalid, 0 Unknown, 0 Unchecked, 15.6s Time] [2024-11-13 12:50:29,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2024-11-13 12:50:29,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 601. [2024-11-13 12:50:29,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 530 states have (on average 1.3830188679245283) internal successors, (733), 533 states have internal predecessors, (733), 52 states have call successors, (52), 18 states have call predecessors, (52), 18 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-13 12:50:29,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 837 transitions. [2024-11-13 12:50:29,312 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 837 transitions. Word has length 151 [2024-11-13 12:50:29,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:50:29,313 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 837 transitions. [2024-11-13 12:50:29,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 47 states have (on average 2.74468085106383) internal successors, (129), 46 states have internal predecessors, (129), 16 states have call successors, (38), 15 states have call predecessors, (38), 16 states have return successors, (38), 9 states have call predecessors, (38), 16 states have call successors, (38) [2024-11-13 12:50:29,313 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 837 transitions. [2024-11-13 12:50:29,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 12:50:29,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:50:29,315 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:50:29,323 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-11-13 12:50:29,539 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-11-13 12:50:29,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:50:29,717 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:50:29,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:50:29,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1070009258, now seen corresponding path program 1 times [2024-11-13 12:50:29,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:50:29,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1193323155] [2024-11-13 12:50:29,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:50:29,718 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:50:29,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:50:29,721 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:50:29,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-13 12:50:30,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:50:30,104 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-13 12:50:30,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:50:30,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-13 12:50:35,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2024-11-13 12:50:35,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 37 [2024-11-13 12:50:35,987 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 16 proven. 344 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-11-13 12:50:35,987 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:50:36,686 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:50:36,686 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:50:36,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1193323155] [2024-11-13 12:50:36,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1193323155] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:50:36,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:50:36,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [21] total 25 [2024-11-13 12:50:36,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938742853] [2024-11-13 12:50:36,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:50:36,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:50:36,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:50:36,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:50:36,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2024-11-13 12:50:36,688 INFO L87 Difference]: Start difference. First operand 601 states and 837 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:50:37,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:50:37,180 INFO L93 Difference]: Finished difference Result 1327 states and 1860 transitions. [2024-11-13 12:50:37,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:50:37,181 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-11-13 12:50:37,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:50:37,185 INFO L225 Difference]: With dead ends: 1327 [2024-11-13 12:50:37,185 INFO L226 Difference]: Without dead ends: 729 [2024-11-13 12:50:37,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2024-11-13 12:50:37,187 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 73 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 12:50:37,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 661 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 12:50:37,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2024-11-13 12:50:37,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 652. [2024-11-13 12:50:37,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 581 states have (on average 1.3993115318416522) internal successors, (813), 584 states have internal predecessors, (813), 52 states have call successors, (52), 18 states have call predecessors, (52), 18 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-13 12:50:37,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 917 transitions. [2024-11-13 12:50:37,244 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 917 transitions. Word has length 151 [2024-11-13 12:50:37,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:50:37,244 INFO L471 AbstractCegarLoop]: Abstraction has 652 states and 917 transitions. [2024-11-13 12:50:37,245 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:50:37,245 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 917 transitions. [2024-11-13 12:50:37,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 12:50:37,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:50:37,246 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:50:37,253 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2024-11-13 12:50:37,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:50:37,447 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:50:37,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:50:37,448 INFO L85 PathProgramCache]: Analyzing trace with hash 58892008, now seen corresponding path program 1 times [2024-11-13 12:50:37,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:50:37,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [568542311] [2024-11-13 12:50:37,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:50:37,449 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:50:37,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:50:37,452 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:50:37,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-13 12:50:37,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:50:37,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-13 12:50:37,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:50:41,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2024-11-13 12:50:41,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-13 12:50:41,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 41 [2024-11-13 12:50:41,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 52 [2024-11-13 12:50:42,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 47 [2024-11-13 12:50:42,709 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 10 proven. 446 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2024-11-13 12:50:42,709 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:50:44,544 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:50:44,544 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:50:44,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [568542311] [2024-11-13 12:50:44,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [568542311] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:50:44,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:50:44,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [23] total 33 [2024-11-13 12:50:44,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525046694] [2024-11-13 12:50:44,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:50:44,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 12:50:44,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:50:44,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 12:50:44,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=956, Unknown=0, NotChecked=0, Total=1056 [2024-11-13 12:50:44,547 INFO L87 Difference]: Start difference. First operand 652 states and 917 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:50:47,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:50:47,124 INFO L93 Difference]: Finished difference Result 1486 states and 2100 transitions. [2024-11-13 12:50:47,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 12:50:47,125 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-11-13 12:50:47,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:50:47,128 INFO L225 Difference]: With dead ends: 1486 [2024-11-13 12:50:47,128 INFO L226 Difference]: Without dead ends: 837 [2024-11-13 12:50:47,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=160, Invalid=1480, Unknown=0, NotChecked=0, Total=1640 [2024-11-13 12:50:47,130 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 166 mSDsluCounter, 1742 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 1939 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-13 12:50:47,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 1939 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-13 12:50:47,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2024-11-13 12:50:47,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 696. [2024-11-13 12:50:47,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 625 states have (on average 1.4048) internal successors, (878), 628 states have internal predecessors, (878), 52 states have call successors, (52), 18 states have call predecessors, (52), 18 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-13 12:50:47,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 982 transitions. [2024-11-13 12:50:47,191 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 982 transitions. Word has length 151 [2024-11-13 12:50:47,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:50:47,191 INFO L471 AbstractCegarLoop]: Abstraction has 696 states and 982 transitions. [2024-11-13 12:50:47,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:50:47,192 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 982 transitions. [2024-11-13 12:50:47,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 12:50:47,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:50:47,193 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:50:47,204 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2024-11-13 12:50:47,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:50:47,395 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:50:47,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:50:47,397 INFO L85 PathProgramCache]: Analyzing trace with hash 317057446, now seen corresponding path program 1 times [2024-11-13 12:50:47,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:50:47,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [181440979] [2024-11-13 12:50:47,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:50:47,398 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:50:47,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:50:47,400 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:50:47,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-11-13 12:50:47,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:50:47,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-13 12:50:47,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:50:48,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-13 12:50:55,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 30 [2024-11-13 12:50:56,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-11-13 12:50:56,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2024-11-13 12:50:57,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2024-11-13 12:50:57,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2024-11-13 12:50:58,122 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 15 proven. 485 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-13 12:50:58,123 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:50:59,730 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:50:59,730 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:50:59,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [181440979] [2024-11-13 12:50:59,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [181440979] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:50:59,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:50:59,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [31] total 38 [2024-11-13 12:50:59,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859819320] [2024-11-13 12:50:59,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:50:59,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 12:50:59,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:50:59,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 12:50:59,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1283, Unknown=0, NotChecked=0, Total=1406 [2024-11-13 12:50:59,732 INFO L87 Difference]: Start difference. First operand 696 states and 982 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:51:01,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:51:01,319 INFO L93 Difference]: Finished difference Result 1687 states and 2374 transitions. [2024-11-13 12:51:01,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:51:01,324 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-11-13 12:51:01,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:51:01,328 INFO L225 Difference]: With dead ends: 1687 [2024-11-13 12:51:01,329 INFO L226 Difference]: Without dead ends: 994 [2024-11-13 12:51:01,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=163, Invalid=1559, Unknown=0, NotChecked=0, Total=1722 [2024-11-13 12:51:01,332 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 473 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:51:01,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 1111 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-13 12:51:01,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2024-11-13 12:51:01,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 842. [2024-11-13 12:51:01,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 764 states have (on average 1.4240837696335078) internal successors, (1088), 768 states have internal predecessors, (1088), 58 states have call successors, (58), 19 states have call predecessors, (58), 19 states have return successors, (58), 54 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-13 12:51:01,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1204 transitions. [2024-11-13 12:51:01,410 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1204 transitions. Word has length 151 [2024-11-13 12:51:01,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:51:01,410 INFO L471 AbstractCegarLoop]: Abstraction has 842 states and 1204 transitions. [2024-11-13 12:51:01,410 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:51:01,411 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1204 transitions. [2024-11-13 12:51:01,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 12:51:01,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:51:01,412 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:51:01,419 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2024-11-13 12:51:01,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:51:01,616 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:51:01,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:51:01,617 INFO L85 PathProgramCache]: Analyzing trace with hash -159962710, now seen corresponding path program 1 times [2024-11-13 12:51:01,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:51:01,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [524781431] [2024-11-13 12:51:01,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:51:01,618 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:51:01,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:51:01,620 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:51:01,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-11-13 12:51:01,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:51:01,979 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-13 12:51:01,983 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:51:02,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2024-11-13 12:51:02,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2024-11-13 12:51:02,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2024-11-13 12:51:02,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2024-11-13 12:51:03,139 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2024-11-13 12:51:03,139 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:51:03,952 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:51:03,953 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:51:03,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [524781431] [2024-11-13 12:51:03,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [524781431] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:51:03,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:51:03,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 18 [2024-11-13 12:51:03,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080300676] [2024-11-13 12:51:03,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:51:03,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 12:51:03,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:51:03,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 12:51:03,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2024-11-13 12:51:03,954 INFO L87 Difference]: Start difference. First operand 842 states and 1204 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:51:05,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:51:05,366 INFO L93 Difference]: Finished difference Result 1309 states and 1891 transitions. [2024-11-13 12:51:05,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 12:51:05,367 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-11-13 12:51:05,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:51:05,370 INFO L225 Difference]: With dead ends: 1309 [2024-11-13 12:51:05,370 INFO L226 Difference]: Without dead ends: 915 [2024-11-13 12:51:05,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 283 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2024-11-13 12:51:05,372 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 81 mSDsluCounter, 1466 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 1667 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-13 12:51:05,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 1667 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-13 12:51:05,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2024-11-13 12:51:05,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 844. [2024-11-13 12:51:05,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 766 states have (on average 1.4242819843342036) internal successors, (1091), 770 states have internal predecessors, (1091), 58 states have call successors, (58), 19 states have call predecessors, (58), 19 states have return successors, (58), 54 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-13 12:51:05,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1207 transitions. [2024-11-13 12:51:05,445 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1207 transitions. Word has length 151 [2024-11-13 12:51:05,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:51:05,454 INFO L471 AbstractCegarLoop]: Abstraction has 844 states and 1207 transitions. [2024-11-13 12:51:05,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:51:05,455 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1207 transitions. [2024-11-13 12:51:05,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 12:51:05,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:51:05,457 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:51:05,465 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2024-11-13 12:51:05,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:51:05,658 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:51:05,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:51:05,658 INFO L85 PathProgramCache]: Analyzing trace with hash 98202728, now seen corresponding path program 1 times [2024-11-13 12:51:05,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:51:05,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1639677989] [2024-11-13 12:51:05,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:51:05,659 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:51:05,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:51:05,661 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:51:05,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-11-13 12:51:06,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:51:06,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-13 12:51:06,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:51:08,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2024-11-13 12:51:08,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-11-13 12:51:09,069 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 10 proven. 446 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2024-11-13 12:51:09,069 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:51:09,591 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:51:09,591 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:51:09,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1639677989] [2024-11-13 12:51:09,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1639677989] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:51:09,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:51:09,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2024-11-13 12:51:09,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721835804] [2024-11-13 12:51:09,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:51:09,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:51:09,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:51:09,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:51:09,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-11-13 12:51:09,593 INFO L87 Difference]: Start difference. First operand 844 states and 1207 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:51:10,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:51:10,029 INFO L93 Difference]: Finished difference Result 1303 states and 1872 transitions. [2024-11-13 12:51:10,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:51:10,030 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-11-13 12:51:10,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:51:10,034 INFO L225 Difference]: With dead ends: 1303 [2024-11-13 12:51:10,034 INFO L226 Difference]: Without dead ends: 907 [2024-11-13 12:51:10,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-11-13 12:51:10,036 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 166 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:51:10,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 627 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 12:51:10,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2024-11-13 12:51:10,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 812. [2024-11-13 12:51:10,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 734 states have (on average 1.4141689373297002) internal successors, (1038), 738 states have internal predecessors, (1038), 58 states have call successors, (58), 19 states have call predecessors, (58), 19 states have return successors, (58), 54 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-13 12:51:10,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1154 transitions. [2024-11-13 12:51:10,103 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1154 transitions. Word has length 151 [2024-11-13 12:51:10,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:51:10,104 INFO L471 AbstractCegarLoop]: Abstraction has 812 states and 1154 transitions. [2024-11-13 12:51:10,104 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:51:10,104 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1154 transitions. [2024-11-13 12:51:10,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 12:51:10,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:51:10,106 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:51:10,113 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2024-11-13 12:51:10,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:51:10,307 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:51:10,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:51:10,307 INFO L85 PathProgramCache]: Analyzing trace with hash 199440618, now seen corresponding path program 1 times [2024-11-13 12:51:10,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:51:10,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [838974827] [2024-11-13 12:51:10,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:51:10,308 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:51:10,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:51:10,310 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:51:10,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2024-11-13 12:51:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:51:10,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-13 12:51:10,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:51:17,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2024-11-13 12:51:17,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2024-11-13 12:51:17,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2024-11-13 12:51:18,216 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 15 proven. 485 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-13 12:51:18,216 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:51:19,371 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:51:19,372 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:51:19,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [838974827] [2024-11-13 12:51:19,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [838974827] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:51:19,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:51:19,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [26] total 33 [2024-11-13 12:51:19,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934405912] [2024-11-13 12:51:19,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:51:19,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 12:51:19,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:51:19,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 12:51:19,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=951, Unknown=0, NotChecked=0, Total=1056 [2024-11-13 12:51:19,373 INFO L87 Difference]: Start difference. First operand 812 states and 1154 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:51:20,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:51:20,746 INFO L93 Difference]: Finished difference Result 1810 states and 2550 transitions. [2024-11-13 12:51:20,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 12:51:20,747 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-11-13 12:51:20,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:51:20,751 INFO L225 Difference]: With dead ends: 1810 [2024-11-13 12:51:20,751 INFO L226 Difference]: Without dead ends: 1001 [2024-11-13 12:51:20,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=131, Invalid=1129, Unknown=0, NotChecked=0, Total=1260 [2024-11-13 12:51:20,753 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 267 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 1158 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:51:20,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 1158 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-13 12:51:20,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2024-11-13 12:51:20,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 798. [2024-11-13 12:51:20,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 724 states have (on average 1.4226519337016574) internal successors, (1030), 727 states have internal predecessors, (1030), 54 states have call successors, (54), 19 states have call predecessors, (54), 19 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-13 12:51:20,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1138 transitions. [2024-11-13 12:51:20,793 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1138 transitions. Word has length 151 [2024-11-13 12:51:20,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:51:20,794 INFO L471 AbstractCegarLoop]: Abstraction has 798 states and 1138 transitions. [2024-11-13 12:51:20,794 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:51:20,794 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1138 transitions. [2024-11-13 12:51:20,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 12:51:20,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:51:20,796 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:51:20,803 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Ended with exit code 0 [2024-11-13 12:51:20,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:51:20,997 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:51:20,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:51:20,997 INFO L85 PathProgramCache]: Analyzing trace with hash 457606056, now seen corresponding path program 1 times [2024-11-13 12:51:20,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:51:20,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [908474890] [2024-11-13 12:51:20,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:51:20,998 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:51:20,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:51:20,999 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:51:21,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2024-11-13 12:51:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:51:21,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-13 12:51:21,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:51:21,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-13 12:51:29,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2024-11-13 12:51:29,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-11-13 12:51:29,853 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 15 proven. 485 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-13 12:51:29,854 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:51:32,165 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:51:32,165 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:51:32,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [908474890] [2024-11-13 12:51:32,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [908474890] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:51:32,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:51:32,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [29] total 41 [2024-11-13 12:51:32,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883477666] [2024-11-13 12:51:32,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:51:32,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 12:51:32,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:51:32,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 12:51:32,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1519, Unknown=0, NotChecked=0, Total=1640 [2024-11-13 12:51:32,169 INFO L87 Difference]: Start difference. First operand 798 states and 1138 transitions. Second operand has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:51:34,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:51:34,964 INFO L93 Difference]: Finished difference Result 1713 states and 2438 transitions. [2024-11-13 12:51:34,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 12:51:34,965 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-11-13 12:51:34,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:51:34,969 INFO L225 Difference]: With dead ends: 1713 [2024-11-13 12:51:34,969 INFO L226 Difference]: Without dead ends: 918 [2024-11-13 12:51:34,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 685 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=191, Invalid=2259, Unknown=0, NotChecked=0, Total=2450 [2024-11-13 12:51:34,971 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 276 mSDsluCounter, 1879 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 2099 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-13 12:51:34,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 2099 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-13 12:51:34,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2024-11-13 12:51:35,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 802. [2024-11-13 12:51:35,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 728 states have (on average 1.4203296703296704) internal successors, (1034), 731 states have internal predecessors, (1034), 54 states have call successors, (54), 19 states have call predecessors, (54), 19 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-13 12:51:35,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1142 transitions. [2024-11-13 12:51:35,029 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1142 transitions. Word has length 151 [2024-11-13 12:51:35,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:51:35,030 INFO L471 AbstractCegarLoop]: Abstraction has 802 states and 1142 transitions. [2024-11-13 12:51:35,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:51:35,030 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1142 transitions. [2024-11-13 12:51:35,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 12:51:35,032 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:51:35,032 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:51:35,038 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Ended with exit code 0 [2024-11-13 12:51:35,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:51:35,233 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:51:35,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:51:35,233 INFO L85 PathProgramCache]: Analyzing trace with hash -19414100, now seen corresponding path program 1 times [2024-11-13 12:51:35,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:51:35,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [184453145] [2024-11-13 12:51:35,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:51:35,233 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:51:35,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:51:35,235 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:51:35,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2024-11-13 12:51:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:51:35,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-13 12:51:35,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:51:38,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-11-13 12:51:38,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-13 12:51:38,209 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 10 proven. 446 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2024-11-13 12:51:38,209 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:51:38,695 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:51:38,695 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:51:38,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [184453145] [2024-11-13 12:51:38,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [184453145] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:51:38,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:51:38,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2024-11-13 12:51:38,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487446628] [2024-11-13 12:51:38,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:51:38,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:51:38,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:51:38,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:51:38,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-11-13 12:51:38,697 INFO L87 Difference]: Start difference. First operand 802 states and 1142 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:51:39,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:51:39,085 INFO L93 Difference]: Finished difference Result 1308 states and 1854 transitions. [2024-11-13 12:51:39,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:51:39,086 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-11-13 12:51:39,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:51:39,090 INFO L225 Difference]: With dead ends: 1308 [2024-11-13 12:51:39,090 INFO L226 Difference]: Without dead ends: 956 [2024-11-13 12:51:39,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-11-13 12:51:39,091 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 91 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:51:39,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 689 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 12:51:39,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2024-11-13 12:51:39,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 786. [2024-11-13 12:51:39,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 712 states have (on average 1.4143258426966292) internal successors, (1007), 715 states have internal predecessors, (1007), 54 states have call successors, (54), 19 states have call predecessors, (54), 19 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-13 12:51:39,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1115 transitions. [2024-11-13 12:51:39,150 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1115 transitions. Word has length 151 [2024-11-13 12:51:39,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:51:39,150 INFO L471 AbstractCegarLoop]: Abstraction has 786 states and 1115 transitions. [2024-11-13 12:51:39,151 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:51:39,151 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1115 transitions. [2024-11-13 12:51:39,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 12:51:39,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:51:39,152 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:51:39,159 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Ended with exit code 0 [2024-11-13 12:51:39,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:51:39,353 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:51:39,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:51:39,353 INFO L85 PathProgramCache]: Analyzing trace with hash 238751338, now seen corresponding path program 1 times [2024-11-13 12:51:39,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:51:39,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [574698259] [2024-11-13 12:51:39,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:51:39,354 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:51:39,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:51:39,356 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:51:39,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2024-11-13 12:51:39,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:51:39,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-13 12:51:39,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:51:42,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2024-11-13 12:51:43,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2024-11-13 12:51:43,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 32 [2024-11-13 12:51:43,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2024-11-13 12:51:43,896 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 16 proven. 408 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-13 12:51:43,896 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:51:44,854 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:51:44,854 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:51:44,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [574698259] [2024-11-13 12:51:44,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [574698259] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:51:44,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:51:44,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [24] total 32 [2024-11-13 12:51:44,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098134392] [2024-11-13 12:51:44,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:51:44,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 12:51:44,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:51:44,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 12:51:44,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=900, Unknown=0, NotChecked=0, Total=992 [2024-11-13 12:51:44,856 INFO L87 Difference]: Start difference. First operand 786 states and 1115 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:51:46,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:51:46,288 INFO L93 Difference]: Finished difference Result 1200 states and 1716 transitions. [2024-11-13 12:51:46,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 12:51:46,288 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-11-13 12:51:46,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:51:46,290 INFO L225 Difference]: With dead ends: 1200 [2024-11-13 12:51:46,291 INFO L226 Difference]: Without dead ends: 864 [2024-11-13 12:51:46,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=123, Invalid=1283, Unknown=0, NotChecked=0, Total=1406 [2024-11-13 12:51:46,291 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 77 mSDsluCounter, 1540 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1762 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:51:46,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1762 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-13 12:51:46,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2024-11-13 12:51:46,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 772. [2024-11-13 12:51:46,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 698 states have (on average 1.4097421203438396) internal successors, (984), 701 states have internal predecessors, (984), 54 states have call successors, (54), 19 states have call predecessors, (54), 19 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-13 12:51:46,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1092 transitions. [2024-11-13 12:51:46,329 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1092 transitions. Word has length 151 [2024-11-13 12:51:46,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:51:46,329 INFO L471 AbstractCegarLoop]: Abstraction has 772 states and 1092 transitions. [2024-11-13 12:51:46,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:51:46,330 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1092 transitions. [2024-11-13 12:51:46,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 12:51:46,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:51:46,331 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:51:46,341 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Ended with exit code 0 [2024-11-13 12:51:46,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:51:46,531 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:51:46,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:51:46,532 INFO L85 PathProgramCache]: Analyzing trace with hash -853218776, now seen corresponding path program 1 times [2024-11-13 12:51:46,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:51:46,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [462731363] [2024-11-13 12:51:46,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:51:46,532 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:51:46,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:51:46,534 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:51:46,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2024-11-13 12:51:46,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:51:46,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-13 12:51:46,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:51:49,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2024-11-13 12:51:49,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-13 12:51:50,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 41 [2024-11-13 12:51:50,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 52 [2024-11-13 12:51:50,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 47 [2024-11-13 12:51:50,992 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 10 proven. 494 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-13 12:51:50,992 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:51:52,478 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:51:52,478 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:51:52,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [462731363] [2024-11-13 12:51:52,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [462731363] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:51:52,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:51:52,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [23] total 33 [2024-11-13 12:51:52,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148351375] [2024-11-13 12:51:52,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:51:52,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 12:51:52,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:51:52,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 12:51:52,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=956, Unknown=0, NotChecked=0, Total=1056 [2024-11-13 12:51:52,479 INFO L87 Difference]: Start difference. First operand 772 states and 1092 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:51:55,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:51:55,203 INFO L93 Difference]: Finished difference Result 1751 states and 2452 transitions. [2024-11-13 12:51:55,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 12:51:55,204 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-11-13 12:51:55,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:51:55,206 INFO L225 Difference]: With dead ends: 1751 [2024-11-13 12:51:55,207 INFO L226 Difference]: Without dead ends: 982 [2024-11-13 12:51:55,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=160, Invalid=1480, Unknown=0, NotChecked=0, Total=1640 [2024-11-13 12:51:55,208 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 293 mSDsluCounter, 1602 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 1813 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-13 12:51:55,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 1813 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-13 12:51:55,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2024-11-13 12:51:55,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 843. [2024-11-13 12:51:55,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 764 states have (on average 1.4083769633507854) internal successors, (1076), 768 states have internal predecessors, (1076), 58 states have call successors, (58), 20 states have call predecessors, (58), 20 states have return successors, (58), 54 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-13 12:51:55,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1192 transitions. [2024-11-13 12:51:55,265 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1192 transitions. Word has length 151 [2024-11-13 12:51:55,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:51:55,266 INFO L471 AbstractCegarLoop]: Abstraction has 843 states and 1192 transitions. [2024-11-13 12:51:55,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:51:55,266 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1192 transitions. [2024-11-13 12:51:55,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 12:51:55,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:51:55,267 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:51:55,274 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Ended with exit code 0 [2024-11-13 12:51:55,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:51:55,468 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:51:55,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:51:55,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1864336026, now seen corresponding path program 1 times [2024-11-13 12:51:55,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:51:55,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1489018436] [2024-11-13 12:51:55,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:51:55,469 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:51:55,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:51:55,471 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:51:55,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2024-11-13 12:51:55,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:51:55,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-13 12:51:55,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:51:55,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-13 12:52:00,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2024-11-13 12:52:00,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2024-11-13 12:52:00,377 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 16 proven. 344 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-11-13 12:52:00,377 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:52:00,970 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:52:00,970 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:52:00,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1489018436] [2024-11-13 12:52:00,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1489018436] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:52:00,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:52:00,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [21] total 25 [2024-11-13 12:52:00,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95909209] [2024-11-13 12:52:00,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:52:00,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:52:00,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:52:00,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:52:00,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2024-11-13 12:52:00,971 INFO L87 Difference]: Start difference. First operand 843 states and 1192 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:52:01,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:52:01,364 INFO L93 Difference]: Finished difference Result 1778 states and 2515 transitions. [2024-11-13 12:52:01,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:52:01,365 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-11-13 12:52:01,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:52:01,369 INFO L225 Difference]: With dead ends: 1778 [2024-11-13 12:52:01,369 INFO L226 Difference]: Without dead ends: 938 [2024-11-13 12:52:01,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2024-11-13 12:52:01,371 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 142 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:52:01,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 549 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 12:52:01,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2024-11-13 12:52:01,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 840. [2024-11-13 12:52:01,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 840 states, 761 states have (on average 1.4034165571616295) internal successors, (1068), 765 states have internal predecessors, (1068), 58 states have call successors, (58), 20 states have call predecessors, (58), 20 states have return successors, (58), 54 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-13 12:52:01,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1184 transitions. [2024-11-13 12:52:01,442 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1184 transitions. Word has length 151 [2024-11-13 12:52:01,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:52:01,443 INFO L471 AbstractCegarLoop]: Abstraction has 840 states and 1184 transitions. [2024-11-13 12:52:01,443 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:52:01,443 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1184 transitions. [2024-11-13 12:52:01,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 12:52:01,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:52:01,445 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:52:01,452 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Ended with exit code 0 [2024-11-13 12:52:01,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:52:01,646 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:52:01,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:52:01,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1072073494, now seen corresponding path program 1 times [2024-11-13 12:52:01,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:52:01,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [547628340] [2024-11-13 12:52:01,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:52:01,647 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:52:01,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:52:01,648 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:52:01,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2024-11-13 12:52:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:52:02,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-13 12:52:02,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:52:03,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2024-11-13 12:52:03,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2024-11-13 12:52:03,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2024-11-13 12:52:03,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2024-11-13 12:52:03,418 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-13 12:52:03,418 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:52:04,119 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:52:04,120 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:52:04,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [547628340] [2024-11-13 12:52:04,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [547628340] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:52:04,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:52:04,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 18 [2024-11-13 12:52:04,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534840094] [2024-11-13 12:52:04,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:52:04,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 12:52:04,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:52:04,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 12:52:04,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2024-11-13 12:52:04,121 INFO L87 Difference]: Start difference. First operand 840 states and 1184 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:52:05,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:52:05,756 INFO L93 Difference]: Finished difference Result 1289 states and 1821 transitions. [2024-11-13 12:52:05,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 12:52:05,757 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-11-13 12:52:05,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:52:05,761 INFO L225 Difference]: With dead ends: 1289 [2024-11-13 12:52:05,761 INFO L226 Difference]: Without dead ends: 900 [2024-11-13 12:52:05,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 283 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2024-11-13 12:52:05,762 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 92 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 1851 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-13 12:52:05,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 1851 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-13 12:52:05,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2024-11-13 12:52:05,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 823. [2024-11-13 12:52:05,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 744 states have (on average 1.4005376344086022) internal successors, (1042), 748 states have internal predecessors, (1042), 58 states have call successors, (58), 20 states have call predecessors, (58), 20 states have return successors, (58), 54 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-13 12:52:05,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1158 transitions. [2024-11-13 12:52:05,817 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1158 transitions. Word has length 151 [2024-11-13 12:52:05,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:52:05,817 INFO L471 AbstractCegarLoop]: Abstraction has 823 states and 1158 transitions. [2024-11-13 12:52:05,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:52:05,817 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1158 transitions. [2024-11-13 12:52:05,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 12:52:05,818 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:52:05,818 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:52:05,822 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Ended with exit code 0 [2024-11-13 12:52:06,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:52:06,018 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:52:06,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:52:06,019 INFO L85 PathProgramCache]: Analyzing trace with hash -454504728, now seen corresponding path program 1 times [2024-11-13 12:52:06,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:52:06,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1759129474] [2024-11-13 12:52:06,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:52:06,019 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:52:06,019 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:52:06,021 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:52:06,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2024-11-13 12:52:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:52:06,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-13 12:52:06,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:52:13,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-13 12:52:14,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2024-11-13 12:52:14,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-11-13 12:52:14,948 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 14 proven. 514 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2024-11-13 12:52:14,948 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:52:17,223 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:52:17,223 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:52:17,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1759129474] [2024-11-13 12:52:17,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1759129474] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:52:17,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:52:17,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [32] total 44 [2024-11-13 12:52:17,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516461855] [2024-11-13 12:52:17,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:52:17,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 12:52:17,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:52:17,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 12:52:17,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2024-11-13 12:52:17,225 INFO L87 Difference]: Start difference. First operand 823 states and 1158 transitions. Second operand has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:52:21,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:52:21,009 INFO L93 Difference]: Finished difference Result 1841 states and 2569 transitions. [2024-11-13 12:52:21,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 12:52:21,010 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-11-13 12:52:21,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:52:21,012 INFO L225 Difference]: With dead ends: 1841 [2024-11-13 12:52:21,013 INFO L226 Difference]: Without dead ends: 1021 [2024-11-13 12:52:21,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 257 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 782 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=196, Invalid=2560, Unknown=0, NotChecked=0, Total=2756 [2024-11-13 12:52:21,014 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 215 mSDsluCounter, 2010 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 2242 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-13 12:52:21,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 2242 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-13 12:52:21,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2024-11-13 12:52:21,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 836. [2024-11-13 12:52:21,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 836 states, 757 states have (on average 1.404227212681638) internal successors, (1063), 761 states have internal predecessors, (1063), 58 states have call successors, (58), 20 states have call predecessors, (58), 20 states have return successors, (58), 54 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-13 12:52:21,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1179 transitions. [2024-11-13 12:52:21,078 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1179 transitions. Word has length 151 [2024-11-13 12:52:21,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:52:21,078 INFO L471 AbstractCegarLoop]: Abstraction has 836 states and 1179 transitions. [2024-11-13 12:52:21,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:52:21,079 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1179 transitions. [2024-11-13 12:52:21,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 12:52:21,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:52:21,080 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:52:21,087 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Ended with exit code 0 [2024-11-13 12:52:21,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:52:21,281 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:52:21,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:52:21,281 INFO L85 PathProgramCache]: Analyzing trace with hash -673359446, now seen corresponding path program 1 times [2024-11-13 12:52:21,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:52:21,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1055172316] [2024-11-13 12:52:21,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:52:21,282 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:52:21,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:52:21,284 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:52:21,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2024-11-13 12:52:21,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:52:21,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-13 12:52:21,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:52:26,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-13 12:52:26,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2024-11-13 12:52:27,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2024-11-13 12:52:27,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2024-11-13 12:52:28,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2024-11-13 12:52:28,624 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 15 proven. 437 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-11-13 12:52:28,624 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:52:30,119 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:52:30,120 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:52:30,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1055172316] [2024-11-13 12:52:30,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1055172316] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:52:30,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:52:30,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [30] total 38 [2024-11-13 12:52:30,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212873484] [2024-11-13 12:52:30,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:52:30,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 12:52:30,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:52:30,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 12:52:30,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1305, Unknown=0, NotChecked=0, Total=1406 [2024-11-13 12:52:30,121 INFO L87 Difference]: Start difference. First operand 836 states and 1179 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:52:32,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:52:32,053 INFO L93 Difference]: Finished difference Result 1335 states and 1885 transitions. [2024-11-13 12:52:32,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 12:52:32,053 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-11-13 12:52:32,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:52:32,056 INFO L225 Difference]: With dead ends: 1335 [2024-11-13 12:52:32,056 INFO L226 Difference]: Without dead ends: 947 [2024-11-13 12:52:32,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=132, Invalid=1760, Unknown=0, NotChecked=0, Total=1892 [2024-11-13 12:52:32,057 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 92 mSDsluCounter, 1582 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 1820 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:52:32,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 1820 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-13 12:52:32,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2024-11-13 12:52:32,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 819. [2024-11-13 12:52:32,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 740 states have (on average 1.4013513513513514) internal successors, (1037), 744 states have internal predecessors, (1037), 58 states have call successors, (58), 20 states have call predecessors, (58), 20 states have return successors, (58), 54 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-13 12:52:32,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1153 transitions. [2024-11-13 12:52:32,127 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1153 transitions. Word has length 151 [2024-11-13 12:52:32,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:52:32,128 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 1153 transitions. [2024-11-13 12:52:32,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:52:32,128 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1153 transitions. [2024-11-13 12:52:32,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-13 12:52:32,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:52:32,130 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:52:32,136 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Ended with exit code 0 [2024-11-13 12:52:32,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:52:32,330 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:52:32,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:52:32,331 INFO L85 PathProgramCache]: Analyzing trace with hash 143374482, now seen corresponding path program 1 times [2024-11-13 12:52:32,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:52:32,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1262069516] [2024-11-13 12:52:32,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:52:32,331 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:52:32,331 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:52:32,333 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:52:32,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2024-11-13 12:52:32,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:52:32,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-11-13 12:52:32,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:52:33,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-13 12:52:47,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2024-11-13 12:52:47,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-13 12:52:47,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-13 12:52:49,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 39 [2024-11-13 12:52:49,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2024-11-13 12:52:50,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 69 [2024-11-13 12:52:50,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 64 [2024-11-13 12:52:52,641 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 13 proven. 523 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-13 12:52:52,641 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:52:57,300 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:52:57,300 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:52:57,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1262069516] [2024-11-13 12:52:57,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1262069516] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:52:57,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:52:57,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [48] total 61 [2024-11-13 12:52:57,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638172135] [2024-11-13 12:52:57,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:52:57,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-13 12:52:57,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:52:57,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-13 12:52:57,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=3483, Unknown=0, NotChecked=0, Total=3660 [2024-11-13 12:52:57,301 INFO L87 Difference]: Start difference. First operand 819 states and 1153 transitions. Second operand has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:53:02,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:53:02,425 INFO L93 Difference]: Finished difference Result 1804 states and 2540 transitions. [2024-11-13 12:53:02,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 12:53:02,426 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-13 12:53:02,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:53:02,428 INFO L225 Difference]: With dead ends: 1804 [2024-11-13 12:53:02,429 INFO L226 Difference]: Without dead ends: 988 [2024-11-13 12:53:02,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1382 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=265, Invalid=4705, Unknown=0, NotChecked=0, Total=4970 [2024-11-13 12:53:02,430 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 295 mSDsluCounter, 1906 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 2093 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-13 12:53:02,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 2093 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-13 12:53:02,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2024-11-13 12:53:02,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 861. [2024-11-13 12:53:02,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 782 states have (on average 1.4053708439897699) internal successors, (1099), 786 states have internal predecessors, (1099), 58 states have call successors, (58), 20 states have call predecessors, (58), 20 states have return successors, (58), 54 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-13 12:53:02,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1215 transitions. [2024-11-13 12:53:02,472 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1215 transitions. Word has length 153 [2024-11-13 12:53:02,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:53:02,472 INFO L471 AbstractCegarLoop]: Abstraction has 861 states and 1215 transitions. [2024-11-13 12:53:02,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:53:02,473 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1215 transitions. [2024-11-13 12:53:02,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-13 12:53:02,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:53:02,473 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:53:02,479 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Ended with exit code 0 [2024-11-13 12:53:02,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:53:02,674 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:53:02,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:53:02,674 INFO L85 PathProgramCache]: Analyzing trace with hash -443431532, now seen corresponding path program 1 times [2024-11-13 12:53:02,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:53:02,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [493502544] [2024-11-13 12:53:02,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:53:02,675 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:53:02,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:53:02,677 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:53:02,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2024-11-13 12:53:03,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:03,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-13 12:53:03,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:53:03,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-13 12:53:17,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2024-11-13 12:53:18,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2024-11-13 12:53:18,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-13 12:53:19,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 60 [2024-11-13 12:53:19,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2024-11-13 12:53:20,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 59 [2024-11-13 12:53:20,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2024-11-13 12:53:20,982 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 13 proven. 523 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-13 12:53:20,982 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:53:25,348 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:53:25,348 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:53:25,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [493502544] [2024-11-13 12:53:25,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [493502544] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:53:25,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:53:25,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [44] total 56 [2024-11-13 12:53:25,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996023249] [2024-11-13 12:53:25,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:53:25,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 12:53:25,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:53:25,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 12:53:25,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=2839, Unknown=0, NotChecked=0, Total=3080 [2024-11-13 12:53:25,350 INFO L87 Difference]: Start difference. First operand 861 states and 1215 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:53:30,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:53:30,623 INFO L93 Difference]: Finished difference Result 1846 states and 2602 transitions. [2024-11-13 12:53:30,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 12:53:30,624 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-13 12:53:30,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:53:30,629 INFO L225 Difference]: With dead ends: 1846 [2024-11-13 12:53:30,629 INFO L226 Difference]: Without dead ends: 988 [2024-11-13 12:53:30,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1186 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=406, Invalid=3754, Unknown=0, NotChecked=0, Total=4160 [2024-11-13 12:53:30,631 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 290 mSDsluCounter, 1456 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 1663 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-13 12:53:30,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 1663 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-13 12:53:30,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2024-11-13 12:53:30,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 861. [2024-11-13 12:53:30,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 782 states have (on average 1.4028132992327367) internal successors, (1097), 786 states have internal predecessors, (1097), 58 states have call successors, (58), 20 states have call predecessors, (58), 20 states have return successors, (58), 54 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-13 12:53:30,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1213 transitions. [2024-11-13 12:53:30,708 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1213 transitions. Word has length 153 [2024-11-13 12:53:30,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:53:30,708 INFO L471 AbstractCegarLoop]: Abstraction has 861 states and 1213 transitions. [2024-11-13 12:53:30,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:53:30,709 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1213 transitions. [2024-11-13 12:53:30,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-13 12:53:30,709 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:53:30,709 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:53:30,714 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Ended with exit code 0 [2024-11-13 12:53:30,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:53:30,910 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:53:30,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:53:30,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1948812816, now seen corresponding path program 1 times [2024-11-13 12:53:30,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:53:30,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [895143135] [2024-11-13 12:53:30,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:53:30,911 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:53:30,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:53:30,913 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:53:30,916 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2024-11-13 12:53:31,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:31,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-13 12:53:31,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:53:31,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-13 12:53:37,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2024-11-13 12:53:38,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2024-11-13 12:53:39,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2024-11-13 12:53:39,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2024-11-13 12:53:39,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 43 [2024-11-13 12:53:41,082 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 15 proven. 353 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2024-11-13 12:53:41,082 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:53:43,120 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:53:43,120 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:53:43,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [895143135] [2024-11-13 12:53:43,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [895143135] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:53:43,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:53:43,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [35] total 45 [2024-11-13 12:53:43,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621363020] [2024-11-13 12:53:43,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:53:43,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 12:53:43,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:53:43,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 12:53:43,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1861, Unknown=0, NotChecked=0, Total=1980 [2024-11-13 12:53:43,122 INFO L87 Difference]: Start difference. First operand 861 states and 1213 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:53:45,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:53:45,157 INFO L93 Difference]: Finished difference Result 1363 states and 1926 transitions. [2024-11-13 12:53:45,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 12:53:45,158 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-13 12:53:45,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:53:45,161 INFO L225 Difference]: With dead ends: 1363 [2024-11-13 12:53:45,162 INFO L226 Difference]: Without dead ends: 971 [2024-11-13 12:53:45,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=156, Invalid=2496, Unknown=0, NotChecked=0, Total=2652 [2024-11-13 12:53:45,163 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 84 mSDsluCounter, 1778 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 1979 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-13 12:53:45,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 1979 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-13 12:53:45,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2024-11-13 12:53:45,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 920. [2024-11-13 12:53:45,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 838 states have (on average 1.402147971360382) internal successors, (1175), 843 states have internal predecessors, (1175), 60 states have call successors, (60), 21 states have call predecessors, (60), 21 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-13 12:53:45,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1295 transitions. [2024-11-13 12:53:45,234 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1295 transitions. Word has length 153 [2024-11-13 12:53:45,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:53:45,235 INFO L471 AbstractCegarLoop]: Abstraction has 920 states and 1295 transitions. [2024-11-13 12:53:45,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:53:45,235 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1295 transitions. [2024-11-13 12:53:45,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-13 12:53:45,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:53:45,236 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:53:45,244 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Ended with exit code 0 [2024-11-13 12:53:45,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:53:45,438 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:53:45,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:53:45,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1362006802, now seen corresponding path program 1 times [2024-11-13 12:53:45,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:53:45,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [272815590] [2024-11-13 12:53:45,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:53:45,439 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:53:45,439 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:53:45,441 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:53:45,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2024-11-13 12:53:45,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:45,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-13 12:53:45,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:53:48,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-11-13 12:53:48,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2024-11-13 12:53:48,651 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 412 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-13 12:53:48,651 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:53:49,162 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:53:49,163 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:53:49,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [272815590] [2024-11-13 12:53:49,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [272815590] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:53:49,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:53:49,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2024-11-13 12:53:49,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167151491] [2024-11-13 12:53:49,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:53:49,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:53:49,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:53:49,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:53:49,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-11-13 12:53:49,164 INFO L87 Difference]: Start difference. First operand 920 states and 1295 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:53:49,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:53:49,668 INFO L93 Difference]: Finished difference Result 1967 states and 2743 transitions. [2024-11-13 12:53:49,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:53:49,669 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-13 12:53:49,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:53:49,676 INFO L225 Difference]: With dead ends: 1967 [2024-11-13 12:53:49,676 INFO L226 Difference]: Without dead ends: 1050 [2024-11-13 12:53:49,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-11-13 12:53:49,678 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 79 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 12:53:49,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 559 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 12:53:49,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2024-11-13 12:53:49,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 900. [2024-11-13 12:53:49,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 818 states have (on average 1.3973105134474328) internal successors, (1143), 823 states have internal predecessors, (1143), 60 states have call successors, (60), 21 states have call predecessors, (60), 21 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-13 12:53:49,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1263 transitions. [2024-11-13 12:53:49,765 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1263 transitions. Word has length 153 [2024-11-13 12:53:49,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:53:49,765 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1263 transitions. [2024-11-13 12:53:49,765 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:53:49,765 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1263 transitions. [2024-11-13 12:53:49,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-13 12:53:49,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:53:49,767 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:53:49,774 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Forceful destruction successful, exit code 0 [2024-11-13 12:53:49,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:53:49,968 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:53:49,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:53:49,968 INFO L85 PathProgramCache]: Analyzing trace with hash 2066602516, now seen corresponding path program 1 times [2024-11-13 12:53:49,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:53:49,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1836874233] [2024-11-13 12:53:49,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:53:49,969 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:53:49,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:53:49,971 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:53:49,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2024-11-13 12:53:50,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:50,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-13 12:53:50,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:53:52,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-11-13 12:53:52,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2024-11-13 12:53:52,922 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 412 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-13 12:53:52,922 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:53:53,352 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:53:53,352 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:53:53,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1836874233] [2024-11-13 12:53:53,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1836874233] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:53:53,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:53:53,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2024-11-13 12:53:53,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822527631] [2024-11-13 12:53:53,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:53:53,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:53:53,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:53:53,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:53:53,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-11-13 12:53:53,354 INFO L87 Difference]: Start difference. First operand 900 states and 1263 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:53:53,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:53:53,817 INFO L93 Difference]: Finished difference Result 1883 states and 2616 transitions. [2024-11-13 12:53:53,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:53:53,818 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-13 12:53:53,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:53:53,821 INFO L225 Difference]: With dead ends: 1883 [2024-11-13 12:53:53,822 INFO L226 Difference]: Without dead ends: 986 [2024-11-13 12:53:53,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-11-13 12:53:53,824 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 91 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:53:53,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 563 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 12:53:53,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2024-11-13 12:53:53,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 856. [2024-11-13 12:53:53,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 774 states have (on average 1.392764857881137) internal successors, (1078), 779 states have internal predecessors, (1078), 60 states have call successors, (60), 21 states have call predecessors, (60), 21 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-13 12:53:53,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1198 transitions. [2024-11-13 12:53:53,903 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1198 transitions. Word has length 153 [2024-11-13 12:53:53,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:53:53,904 INFO L471 AbstractCegarLoop]: Abstraction has 856 states and 1198 transitions. [2024-11-13 12:53:53,904 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:53:53,904 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1198 transitions. [2024-11-13 12:53:53,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-13 12:53:53,906 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:53:53,906 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:53:53,912 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (41)] Ended with exit code 0 [2024-11-13 12:53:54,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:53:54,107 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:53:54,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:53:54,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1989166786, now seen corresponding path program 1 times [2024-11-13 12:53:54,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:53:54,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [734176187] [2024-11-13 12:53:54,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:53:54,108 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:53:54,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:53:54,110 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:53:54,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2024-11-13 12:53:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:54,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-13 12:53:54,538 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:53:54,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-13 12:54:02,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-11-13 12:54:02,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-13 12:54:03,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2024-11-13 12:54:03,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2024-11-13 12:54:03,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2024-11-13 12:54:03,879 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 15 proven. 485 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-13 12:54:03,879 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:54:04,729 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:54:04,729 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:54:04,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [734176187] [2024-11-13 12:54:04,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [734176187] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:54:04,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:54:04,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [29] total 33 [2024-11-13 12:54:04,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056605577] [2024-11-13 12:54:04,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:54:04,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:54:04,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:54:04,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:54:04,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2024-11-13 12:54:04,731 INFO L87 Difference]: Start difference. First operand 856 states and 1198 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:54:05,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:54:05,304 INFO L93 Difference]: Finished difference Result 2070 states and 2893 transitions. [2024-11-13 12:54:05,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:54:05,306 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-13 12:54:05,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:54:05,310 INFO L225 Difference]: With dead ends: 2070 [2024-11-13 12:54:05,310 INFO L226 Difference]: Without dead ends: 1217 [2024-11-13 12:54:05,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2024-11-13 12:54:05,311 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 81 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 12:54:05,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 618 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 12:54:05,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2024-11-13 12:54:05,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1122. [2024-11-13 12:54:05,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 1029 states have (on average 1.3994169096209912) internal successors, (1440), 1036 states have internal predecessors, (1440), 68 states have call successors, (68), 24 states have call predecessors, (68), 24 states have return successors, (68), 61 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-13 12:54:05,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1576 transitions. [2024-11-13 12:54:05,433 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1576 transitions. Word has length 153 [2024-11-13 12:54:05,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:54:05,434 INFO L471 AbstractCegarLoop]: Abstraction has 1122 states and 1576 transitions. [2024-11-13 12:54:05,434 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:54:05,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1576 transitions. [2024-11-13 12:54:05,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-13 12:54:05,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:54:05,436 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:54:05,444 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Ended with exit code 0 [2024-11-13 12:54:05,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:54:05,636 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:54:05,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:54:05,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1496453884, now seen corresponding path program 1 times [2024-11-13 12:54:05,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:54:05,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1647101666] [2024-11-13 12:54:05,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:54:05,637 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:54:05,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:54:05,639 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:54:05,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2024-11-13 12:54:06,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:54:06,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 12:54:06,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:54:06,176 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:54:06,176 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:54:06,176 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:54:06,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1647101666] [2024-11-13 12:54:06,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1647101666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:54:06,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:54:06,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:54:06,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734910496] [2024-11-13 12:54:06,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:54:06,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:54:06,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:54:06,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:54:06,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:54:06,178 INFO L87 Difference]: Start difference. First operand 1122 states and 1576 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:54:06,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:54:06,296 INFO L93 Difference]: Finished difference Result 2263 states and 3180 transitions. [2024-11-13 12:54:06,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:54:06,297 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-13 12:54:06,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:54:06,303 INFO L225 Difference]: With dead ends: 2263 [2024-11-13 12:54:06,303 INFO L226 Difference]: Without dead ends: 1144 [2024-11-13 12:54:06,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 149 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 12:54:06,306 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:54:06,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 644 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:54:06,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2024-11-13 12:54:06,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1144. [2024-11-13 12:54:06,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 1051 states have (on average 1.391056137012369) internal successors, (1462), 1058 states have internal predecessors, (1462), 68 states have call successors, (68), 24 states have call predecessors, (68), 24 states have return successors, (68), 61 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-13 12:54:06,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1598 transitions. [2024-11-13 12:54:06,419 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1598 transitions. Word has length 153 [2024-11-13 12:54:06,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:54:06,420 INFO L471 AbstractCegarLoop]: Abstraction has 1144 states and 1598 transitions. [2024-11-13 12:54:06,420 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:54:06,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1598 transitions. [2024-11-13 12:54:06,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-13 12:54:06,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:54:06,422 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:54:06,430 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (43)] Ended with exit code 0 [2024-11-13 12:54:06,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:54:06,623 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:54:06,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:54:06,624 INFO L85 PathProgramCache]: Analyzing trace with hash -2129715396, now seen corresponding path program 1 times [2024-11-13 12:54:06,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:54:06,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1948490620] [2024-11-13 12:54:06,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:54:06,624 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:54:06,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:54:06,629 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:54:06,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2024-11-13 12:54:07,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:54:07,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-13 12:54:07,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:54:08,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-13 12:54:08,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 47 [2024-11-13 12:54:08,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2024-11-13 12:54:08,506 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 13 proven. 319 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2024-11-13 12:54:08,506 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:54:08,929 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:54:08,929 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:54:08,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1948490620] [2024-11-13 12:54:08,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1948490620] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:54:08,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:54:08,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 13 [2024-11-13 12:54:08,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757484135] [2024-11-13 12:54:08,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:54:08,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 12:54:08,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:54:08,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 12:54:08,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-13 12:54:08,931 INFO L87 Difference]: Start difference. First operand 1144 states and 1598 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:54:09,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:54:09,530 INFO L93 Difference]: Finished difference Result 1892 states and 2652 transitions. [2024-11-13 12:54:09,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:54:09,531 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-13 12:54:09,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:54:09,540 INFO L225 Difference]: With dead ends: 1892 [2024-11-13 12:54:09,544 INFO L226 Difference]: Without dead ends: 1213 [2024-11-13 12:54:09,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2024-11-13 12:54:09,546 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 77 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 12:54:09,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1068 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 12:54:09,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2024-11-13 12:54:09,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 1113. [2024-11-13 12:54:09,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1113 states, 1020 states have (on average 1.3931372549019607) internal successors, (1421), 1027 states have internal predecessors, (1421), 68 states have call successors, (68), 24 states have call predecessors, (68), 24 states have return successors, (68), 61 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-13 12:54:09,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1557 transitions. [2024-11-13 12:54:09,664 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1557 transitions. Word has length 153 [2024-11-13 12:54:09,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:54:09,664 INFO L471 AbstractCegarLoop]: Abstraction has 1113 states and 1557 transitions. [2024-11-13 12:54:09,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:54:09,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1557 transitions. [2024-11-13 12:54:09,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-13 12:54:09,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:54:09,666 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:54:09,670 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Ended with exit code 0 [2024-11-13 12:54:09,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:54:09,866 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:54:09,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:54:09,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1586136218, now seen corresponding path program 1 times [2024-11-13 12:54:09,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:54:09,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1702698966] [2024-11-13 12:54:09,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:54:09,867 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:54:09,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:54:09,869 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:54:09,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (45)] Waiting until timeout for monitored process [2024-11-13 12:54:10,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:54:10,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-13 12:54:10,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:54:10,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-13 12:54:22,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2024-11-13 12:54:22,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-13 12:54:24,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2024-11-13 12:54:24,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 39 [2024-11-13 12:54:24,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2024-11-13 12:54:25,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 37 [2024-11-13 12:54:27,823 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 14 proven. 502 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2024-11-13 12:54:27,824 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:54:32,646 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:54:32,646 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:54:32,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1702698966] [2024-11-13 12:54:32,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1702698966] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:54:32,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:54:32,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [44] total 57 [2024-11-13 12:54:32,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602191676] [2024-11-13 12:54:32,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:54:32,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-13 12:54:32,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:54:32,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-13 12:54:32,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=3020, Unknown=0, NotChecked=0, Total=3192 [2024-11-13 12:54:32,648 INFO L87 Difference]: Start difference. First operand 1113 states and 1557 transitions. Second operand has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:54:37,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:54:37,875 INFO L93 Difference]: Finished difference Result 2299 states and 3210 transitions. [2024-11-13 12:54:37,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 12:54:37,877 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-13 12:54:37,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:54:37,880 INFO L225 Difference]: With dead ends: 2299 [2024-11-13 12:54:37,880 INFO L226 Difference]: Without dead ends: 1189 [2024-11-13 12:54:37,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1244 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=261, Invalid=4161, Unknown=0, NotChecked=0, Total=4422 [2024-11-13 12:54:37,882 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 275 mSDsluCounter, 2256 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 2474 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:54:37,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 2474 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-13 12:54:37,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2024-11-13 12:54:37,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1110. [2024-11-13 12:54:37,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 1017 states have (on average 1.393313667649951) internal successors, (1417), 1024 states have internal predecessors, (1417), 68 states have call successors, (68), 24 states have call predecessors, (68), 24 states have return successors, (68), 61 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-13 12:54:37,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1553 transitions. [2024-11-13 12:54:37,942 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1553 transitions. Word has length 153 [2024-11-13 12:54:37,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:54:37,942 INFO L471 AbstractCegarLoop]: Abstraction has 1110 states and 1553 transitions. [2024-11-13 12:54:37,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:54:37,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1553 transitions. [2024-11-13 12:54:37,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-13 12:54:37,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:54:37,944 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:54:37,951 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (45)] Forceful destruction successful, exit code 0 [2024-11-13 12:54:38,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:54:38,145 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:54:38,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:54:38,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1180781675, now seen corresponding path program 1 times [2024-11-13 12:54:38,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:54:38,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [155271232] [2024-11-13 12:54:38,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:54:38,147 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:54:38,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:54:38,149 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:54:38,152 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (46)] Waiting until timeout for monitored process [2024-11-13 12:54:38,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:54:38,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-13 12:54:38,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:54:39,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-11-13 12:54:39,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-13 12:54:39,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-13 12:54:39,914 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 2 proven. 198 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2024-11-13 12:54:39,914 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:54:40,446 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-13 12:54:40,447 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 20 treesize of output 19 [2024-11-13 12:54:41,069 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-13 12:54:41,069 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:54:41,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [155271232] [2024-11-13 12:54:41,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [155271232] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:54:41,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 12:54:41,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2024-11-13 12:54:41,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248787162] [2024-11-13 12:54:41,070 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 12:54:41,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 12:54:41,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:54:41,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 12:54:41,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-13 12:54:41,071 INFO L87 Difference]: Start difference. First operand 1110 states and 1553 transitions. Second operand has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 14 states have internal predecessors, (86), 4 states have call successors, (38), 3 states have call predecessors, (38), 5 states have return successors, (38), 2 states have call predecessors, (38), 4 states have call successors, (38) [2024-11-13 12:54:43,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:54:43,416 INFO L93 Difference]: Finished difference Result 3300 states and 4585 transitions. [2024-11-13 12:54:43,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-13 12:54:43,417 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 14 states have internal predecessors, (86), 4 states have call successors, (38), 3 states have call predecessors, (38), 5 states have return successors, (38), 2 states have call predecessors, (38), 4 states have call successors, (38) Word has length 154 [2024-11-13 12:54:43,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:54:43,424 INFO L225 Difference]: With dead ends: 3300 [2024-11-13 12:54:43,424 INFO L226 Difference]: Without dead ends: 2193 [2024-11-13 12:54:43,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 296 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=259, Invalid=863, Unknown=0, NotChecked=0, Total=1122 [2024-11-13 12:54:43,426 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 833 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:54:43,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 771 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-13 12:54:43,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2193 states. [2024-11-13 12:54:43,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2193 to 1456. [2024-11-13 12:54:43,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1456 states, 1361 states have (on average 1.3982365907421015) internal successors, (1903), 1368 states have internal predecessors, (1903), 68 states have call successors, (68), 26 states have call predecessors, (68), 26 states have return successors, (68), 61 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-13 12:54:43,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 1456 states and 2039 transitions. [2024-11-13 12:54:43,509 INFO L78 Accepts]: Start accepts. Automaton has 1456 states and 2039 transitions. Word has length 154 [2024-11-13 12:54:43,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:54:43,509 INFO L471 AbstractCegarLoop]: Abstraction has 1456 states and 2039 transitions. [2024-11-13 12:54:43,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 14 states have internal predecessors, (86), 4 states have call successors, (38), 3 states have call predecessors, (38), 5 states have return successors, (38), 2 states have call predecessors, (38), 4 states have call successors, (38) [2024-11-13 12:54:43,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 2039 transitions. [2024-11-13 12:54:43,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-13 12:54:43,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:54:43,511 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:54:43,517 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (46)] Ended with exit code 0 [2024-11-13 12:54:43,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:54:43,712 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:54:43,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:54:43,712 INFO L85 PathProgramCache]: Analyzing trace with hash 998539741, now seen corresponding path program 1 times [2024-11-13 12:54:43,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:54:43,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [361931746] [2024-11-13 12:54:43,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:54:43,713 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:54:43,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:54:43,714 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:54:43,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (47)] Waiting until timeout for monitored process [2024-11-13 12:54:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:54:44,115 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-13 12:54:44,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:54:45,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-11-13 12:54:45,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-13 12:54:46,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-13 12:54:46,121 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 51 proven. 72 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-13 12:54:46,121 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:54:47,189 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-13 12:54:47,190 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 30 treesize of output 25 [2024-11-13 12:54:47,917 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2024-11-13 12:54:47,917 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:54:47,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [361931746] [2024-11-13 12:54:47,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [361931746] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:54:47,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:54:47,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 23 [2024-11-13 12:54:47,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619094498] [2024-11-13 12:54:47,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:54:47,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 12:54:47,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:54:47,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 12:54:47,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2024-11-13 12:54:47,919 INFO L87 Difference]: Start difference. First operand 1456 states and 2039 transitions. Second operand has 13 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 12 states have internal predecessors, (69), 3 states have call successors, (19), 1 states have call predecessors, (19), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-13 12:54:49,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:54:49,362 INFO L93 Difference]: Finished difference Result 3622 states and 5033 transitions. [2024-11-13 12:54:49,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 12:54:49,362 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 12 states have internal predecessors, (69), 3 states have call successors, (19), 1 states have call predecessors, (19), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2024-11-13 12:54:49,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:54:49,370 INFO L225 Difference]: With dead ends: 3622 [2024-11-13 12:54:49,371 INFO L226 Difference]: Without dead ends: 2169 [2024-11-13 12:54:49,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 287 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=208, Invalid=784, Unknown=0, NotChecked=0, Total=992 [2024-11-13 12:54:49,374 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 355 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 12:54:49,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 747 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 12:54:49,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2169 states. [2024-11-13 12:54:49,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2169 to 1464. [2024-11-13 12:54:49,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1464 states, 1367 states have (on average 1.3752743233357718) internal successors, (1880), 1374 states have internal predecessors, (1880), 68 states have call successors, (68), 28 states have call predecessors, (68), 28 states have return successors, (68), 61 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-13 12:54:49,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 2016 transitions. [2024-11-13 12:54:49,566 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 2016 transitions. Word has length 155 [2024-11-13 12:54:49,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:54:49,566 INFO L471 AbstractCegarLoop]: Abstraction has 1464 states and 2016 transitions. [2024-11-13 12:54:49,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 12 states have internal predecessors, (69), 3 states have call successors, (19), 1 states have call predecessors, (19), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-13 12:54:49,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 2016 transitions. [2024-11-13 12:54:49,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-13 12:54:49,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:54:49,569 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:54:49,577 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (47)] Forceful destruction successful, exit code 0 [2024-11-13 12:54:49,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:54:49,770 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:54:49,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:54:49,770 INFO L85 PathProgramCache]: Analyzing trace with hash 777683838, now seen corresponding path program 1 times [2024-11-13 12:54:49,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:54:49,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [802261111] [2024-11-13 12:54:49,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:54:49,771 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:54:49,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:54:49,774 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:54:49,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (48)] Waiting until timeout for monitored process [2024-11-13 12:54:50,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:54:50,447 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-13 12:54:50,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:54:51,935 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 5 proven. 327 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2024-11-13 12:54:51,935 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:54:52,278 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:54:52,278 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:54:52,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [802261111] [2024-11-13 12:54:52,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [802261111] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:54:52,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:54:52,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-11-13 12:54:52,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597173514] [2024-11-13 12:54:52,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:54:52,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:54:52,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:54:52,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:54:52,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-13 12:54:52,280 INFO L87 Difference]: Start difference. First operand 1464 states and 2016 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:54:52,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:54:52,664 INFO L93 Difference]: Finished difference Result 4140 states and 5693 transitions. [2024-11-13 12:54:52,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:54:52,665 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 156 [2024-11-13 12:54:52,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:54:52,672 INFO L225 Difference]: With dead ends: 4140 [2024-11-13 12:54:52,673 INFO L226 Difference]: Without dead ends: 2679 [2024-11-13 12:54:52,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-13 12:54:52,675 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 169 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 12:54:52,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 505 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 12:54:52,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2679 states. [2024-11-13 12:54:52,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2679 to 2675. [2024-11-13 12:54:52,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2675 states, 2500 states have (on average 1.3696) internal successors, (3424), 2516 states have internal predecessors, (3424), 122 states have call successors, (122), 52 states have call predecessors, (122), 52 states have return successors, (122), 106 states have call predecessors, (122), 122 states have call successors, (122) [2024-11-13 12:54:52,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2675 states to 2675 states and 3668 transitions. [2024-11-13 12:54:52,950 INFO L78 Accepts]: Start accepts. Automaton has 2675 states and 3668 transitions. Word has length 156 [2024-11-13 12:54:52,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:54:52,951 INFO L471 AbstractCegarLoop]: Abstraction has 2675 states and 3668 transitions. [2024-11-13 12:54:52,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:54:52,951 INFO L276 IsEmpty]: Start isEmpty. Operand 2675 states and 3668 transitions. [2024-11-13 12:54:52,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-13 12:54:52,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:54:52,953 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:54:52,963 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (48)] Ended with exit code 0 [2024-11-13 12:54:53,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:54:53,154 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:54:53,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:54:53,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1742276096, now seen corresponding path program 1 times [2024-11-13 12:54:53,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:54:53,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [592316548] [2024-11-13 12:54:53,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:54:53,155 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:54:53,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:54:53,157 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:54:53,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (49)] Waiting until timeout for monitored process [2024-11-13 12:54:53,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:54:53,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-13 12:54:53,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:54:55,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-13 12:54:55,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2024-11-13 12:54:55,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 34 [2024-11-13 12:54:55,496 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 2 proven. 198 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2024-11-13 12:54:55,496 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:54:56,002 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:54:56,002 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:54:56,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [592316548] [2024-11-13 12:54:56,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [592316548] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:54:56,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:54:56,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 16 [2024-11-13 12:54:56,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479286900] [2024-11-13 12:54:56,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:54:56,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 12:54:56,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:54:56,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 12:54:56,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-11-13 12:54:56,004 INFO L87 Difference]: Start difference. First operand 2675 states and 3668 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:54:56,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:54:56,747 INFO L93 Difference]: Finished difference Result 3569 states and 4755 transitions. [2024-11-13 12:54:56,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:54:56,747 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 156 [2024-11-13 12:54:56,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:54:56,757 INFO L225 Difference]: With dead ends: 3569 [2024-11-13 12:54:56,757 INFO L226 Difference]: Without dead ends: 3567 [2024-11-13 12:54:56,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2024-11-13 12:54:56,759 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 102 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 938 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 12:54:56,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 938 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 12:54:56,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3567 states. [2024-11-13 12:54:57,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3567 to 3563. [2024-11-13 12:54:57,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3563 states, 3226 states have (on average 1.3208307501549907) internal successors, (4261), 3260 states have internal predecessors, (4261), 236 states have call successors, (236), 100 states have call predecessors, (236), 100 states have return successors, (236), 202 states have call predecessors, (236), 236 states have call successors, (236) [2024-11-13 12:54:57,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3563 states to 3563 states and 4733 transitions. [2024-11-13 12:54:57,328 INFO L78 Accepts]: Start accepts. Automaton has 3563 states and 4733 transitions. Word has length 156 [2024-11-13 12:54:57,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:54:57,328 INFO L471 AbstractCegarLoop]: Abstraction has 3563 states and 4733 transitions. [2024-11-13 12:54:57,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:54:57,329 INFO L276 IsEmpty]: Start isEmpty. Operand 3563 states and 4733 transitions. [2024-11-13 12:54:57,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-13 12:54:57,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:54:57,331 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:54:57,339 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (49)] Forceful destruction successful, exit code 0 [2024-11-13 12:54:57,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:54:57,535 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:54:57,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:54:57,535 INFO L85 PathProgramCache]: Analyzing trace with hash -474139913, now seen corresponding path program 1 times [2024-11-13 12:54:57,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:54:57,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [525254659] [2024-11-13 12:54:57,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:54:57,536 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:54:57,536 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:54:57,538 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:54:57,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (50)] Waiting until timeout for monitored process [2024-11-13 12:54:57,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:54:57,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-13 12:54:57,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:54:59,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-11-13 12:54:59,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-13 12:54:59,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-13 12:54:59,807 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 51 proven. 72 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-13 12:54:59,807 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:55:00,906 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-13 12:55:00,906 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 30 treesize of output 25 [2024-11-13 12:55:01,520 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2024-11-13 12:55:01,521 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:55:01,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [525254659] [2024-11-13 12:55:01,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [525254659] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:55:01,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:55:01,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [14] total 24 [2024-11-13 12:55:01,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849286740] [2024-11-13 12:55:01,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:55:01,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 12:55:01,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:55:01,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 12:55:01,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2024-11-13 12:55:01,522 INFO L87 Difference]: Start difference. First operand 3563 states and 4733 transitions. Second operand has 14 states, 12 states have (on average 5.916666666666667) internal successors, (71), 13 states have internal predecessors, (71), 3 states have call successors, (19), 1 states have call predecessors, (19), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-13 12:55:03,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:55:03,263 INFO L93 Difference]: Finished difference Result 7533 states and 10135 transitions. [2024-11-13 12:55:03,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:55:03,264 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.916666666666667) internal successors, (71), 13 states have internal predecessors, (71), 3 states have call successors, (19), 1 states have call predecessors, (19), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 157 [2024-11-13 12:55:03,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:55:03,276 INFO L225 Difference]: With dead ends: 7533 [2024-11-13 12:55:03,276 INFO L226 Difference]: Without dead ends: 3973 [2024-11-13 12:55:03,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 290 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=249, Invalid=941, Unknown=0, NotChecked=0, Total=1190 [2024-11-13 12:55:03,281 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 478 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 12:55:03,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 1020 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 12:55:03,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3973 states. [2024-11-13 12:55:03,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3973 to 3661. [2024-11-13 12:55:03,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3661 states, 3310 states have (on average 1.277643504531722) internal successors, (4229), 3344 states have internal predecessors, (4229), 244 states have call successors, (244), 106 states have call predecessors, (244), 106 states have return successors, (244), 210 states have call predecessors, (244), 244 states have call successors, (244) [2024-11-13 12:55:03,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3661 states to 3661 states and 4717 transitions. [2024-11-13 12:55:03,760 INFO L78 Accepts]: Start accepts. Automaton has 3661 states and 4717 transitions. Word has length 157 [2024-11-13 12:55:03,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:55:03,761 INFO L471 AbstractCegarLoop]: Abstraction has 3661 states and 4717 transitions. [2024-11-13 12:55:03,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.916666666666667) internal successors, (71), 13 states have internal predecessors, (71), 3 states have call successors, (19), 1 states have call predecessors, (19), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-13 12:55:03,761 INFO L276 IsEmpty]: Start isEmpty. Operand 3661 states and 4717 transitions. [2024-11-13 12:55:03,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-13 12:55:03,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:55:03,762 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:55:03,767 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (50)] Ended with exit code 0 [2024-11-13 12:55:03,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:55:03,963 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:55:03,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:55:03,963 INFO L85 PathProgramCache]: Analyzing trace with hash 364026493, now seen corresponding path program 1 times [2024-11-13 12:55:03,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:55:03,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1534417072] [2024-11-13 12:55:03,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:55:03,964 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:55:03,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:55:03,966 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:55:03,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (51)] Waiting until timeout for monitored process [2024-11-13 12:55:04,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:55:04,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-13 12:55:04,457 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:55:06,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-11-13 12:55:06,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-13 12:55:06,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-11-13 12:55:06,560 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 51 proven. 72 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-13 12:55:06,560 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:55:07,439 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-13 12:55:07,439 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 30 treesize of output 25 [2024-11-13 12:55:08,012 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2024-11-13 12:55:08,012 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:55:08,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1534417072] [2024-11-13 12:55:08,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1534417072] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:55:08,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:55:08,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 22 [2024-11-13 12:55:08,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125288353] [2024-11-13 12:55:08,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:55:08,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 12:55:08,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:55:08,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 12:55:08,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2024-11-13 12:55:08,014 INFO L87 Difference]: Start difference. First operand 3661 states and 4717 transitions. Second operand has 13 states, 11 states have (on average 6.545454545454546) internal successors, (72), 12 states have internal predecessors, (72), 3 states have call successors, (19), 1 states have call predecessors, (19), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-13 12:55:09,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:55:09,494 INFO L93 Difference]: Finished difference Result 7631 states and 9945 transitions. [2024-11-13 12:55:09,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 12:55:09,495 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.545454545454546) internal successors, (72), 12 states have internal predecessors, (72), 3 states have call successors, (19), 1 states have call predecessors, (19), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 158 [2024-11-13 12:55:09,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:55:09,506 INFO L225 Difference]: With dead ends: 7631 [2024-11-13 12:55:09,506 INFO L226 Difference]: Without dead ends: 3973 [2024-11-13 12:55:09,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 294 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=205, Invalid=725, Unknown=0, NotChecked=0, Total=930 [2024-11-13 12:55:09,512 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 683 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 12:55:09,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 742 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 12:55:09,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3973 states. [2024-11-13 12:55:10,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3973 to 3661. [2024-11-13 12:55:10,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3661 states, 3310 states have (on average 1.265558912386707) internal successors, (4189), 3344 states have internal predecessors, (4189), 244 states have call successors, (244), 106 states have call predecessors, (244), 106 states have return successors, (244), 210 states have call predecessors, (244), 244 states have call successors, (244) [2024-11-13 12:55:10,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3661 states to 3661 states and 4677 transitions. [2024-11-13 12:55:10,037 INFO L78 Accepts]: Start accepts. Automaton has 3661 states and 4677 transitions. Word has length 158 [2024-11-13 12:55:10,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:55:10,037 INFO L471 AbstractCegarLoop]: Abstraction has 3661 states and 4677 transitions. [2024-11-13 12:55:10,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.545454545454546) internal successors, (72), 12 states have internal predecessors, (72), 3 states have call successors, (19), 1 states have call predecessors, (19), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-13 12:55:10,038 INFO L276 IsEmpty]: Start isEmpty. Operand 3661 states and 4677 transitions. [2024-11-13 12:55:10,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-13 12:55:10,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:55:10,040 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:55:10,049 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (51)] Ended with exit code 0 [2024-11-13 12:55:10,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:55:10,240 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:55:10,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:55:10,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1624949870, now seen corresponding path program 1 times [2024-11-13 12:55:10,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:55:10,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [477387784] [2024-11-13 12:55:10,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:55:10,241 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:55:10,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:55:10,247 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:55:10,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (52)] Waiting until timeout for monitored process [2024-11-13 12:55:10,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:55:10,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-13 12:55:10,842 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:55:12,240 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 7 proven. 373 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2024-11-13 12:55:12,240 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:55:12,576 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:55:12,577 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:55:12,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [477387784] [2024-11-13 12:55:12,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [477387784] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:55:12,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:55:12,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-11-13 12:55:12,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930840305] [2024-11-13 12:55:12,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:55:12,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:55:12,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:55:12,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:55:12,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-13 12:55:12,579 INFO L87 Difference]: Start difference. First operand 3661 states and 4677 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:55:13,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:55:13,287 INFO L93 Difference]: Finished difference Result 8051 states and 10276 transitions. [2024-11-13 12:55:13,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:55:13,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 158 [2024-11-13 12:55:13,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:55:13,305 INFO L225 Difference]: With dead ends: 8051 [2024-11-13 12:55:13,305 INFO L226 Difference]: Without dead ends: 4393 [2024-11-13 12:55:13,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-13 12:55:13,313 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 116 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:55:13,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 478 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:55:13,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4393 states. [2024-11-13 12:55:13,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4393 to 4271. [2024-11-13 12:55:13,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4271 states, 3882 states have (on average 1.2671303451828955) internal successors, (4919), 3922 states have internal predecessors, (4919), 274 states have call successors, (274), 114 states have call predecessors, (274), 114 states have return successors, (274), 234 states have call predecessors, (274), 274 states have call successors, (274) [2024-11-13 12:55:13,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4271 states to 4271 states and 5467 transitions. [2024-11-13 12:55:13,996 INFO L78 Accepts]: Start accepts. Automaton has 4271 states and 5467 transitions. Word has length 158 [2024-11-13 12:55:13,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:55:13,996 INFO L471 AbstractCegarLoop]: Abstraction has 4271 states and 5467 transitions. [2024-11-13 12:55:13,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:55:13,996 INFO L276 IsEmpty]: Start isEmpty. Operand 4271 states and 5467 transitions. [2024-11-13 12:55:13,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-13 12:55:13,999 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:55:13,999 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:55:14,005 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (52)] Forceful destruction successful, exit code 0 [2024-11-13 12:55:14,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:55:14,200 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:55:14,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:55:14,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1708465494, now seen corresponding path program 1 times [2024-11-13 12:55:14,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:55:14,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [839641689] [2024-11-13 12:55:14,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:55:14,201 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:55:14,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:55:14,206 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:55:14,209 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (53)] Waiting until timeout for monitored process [2024-11-13 12:55:14,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:55:14,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-13 12:55:14,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:55:17,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2024-11-13 12:55:17,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-13 12:55:17,233 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 13 proven. 319 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2024-11-13 12:55:17,233 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:55:17,747 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:55:17,747 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:55:17,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [839641689] [2024-11-13 12:55:17,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [839641689] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:55:17,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:55:17,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2024-11-13 12:55:17,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068881326] [2024-11-13 12:55:17,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:55:17,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 12:55:17,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:55:17,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 12:55:17,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2024-11-13 12:55:17,749 INFO L87 Difference]: Start difference. First operand 4271 states and 5467 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:55:18,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:55:18,834 INFO L93 Difference]: Finished difference Result 11379 states and 14256 transitions. [2024-11-13 12:55:18,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:55:18,835 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 160 [2024-11-13 12:55:18,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:55:18,854 INFO L225 Difference]: With dead ends: 11379 [2024-11-13 12:55:18,854 INFO L226 Difference]: Without dead ends: 7111 [2024-11-13 12:55:18,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-11-13 12:55:18,861 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 122 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:55:18,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 652 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 12:55:18,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7111 states. [2024-11-13 12:55:19,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7111 to 4695. [2024-11-13 12:55:19,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4695 states, 4306 states have (on average 1.2561542034370645) internal successors, (5409), 4346 states have internal predecessors, (5409), 274 states have call successors, (274), 114 states have call predecessors, (274), 114 states have return successors, (274), 234 states have call predecessors, (274), 274 states have call successors, (274) [2024-11-13 12:55:19,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4695 states to 4695 states and 5957 transitions. [2024-11-13 12:55:19,505 INFO L78 Accepts]: Start accepts. Automaton has 4695 states and 5957 transitions. Word has length 160 [2024-11-13 12:55:19,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:55:19,506 INFO L471 AbstractCegarLoop]: Abstraction has 4695 states and 5957 transitions. [2024-11-13 12:55:19,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:55:19,506 INFO L276 IsEmpty]: Start isEmpty. Operand 4695 states and 5957 transitions. [2024-11-13 12:55:19,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-13 12:55:19,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:55:19,508 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:55:19,514 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (53)] Forceful destruction successful, exit code 0 [2024-11-13 12:55:19,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:55:19,709 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:55:19,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:55:19,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1450300056, now seen corresponding path program 1 times [2024-11-13 12:55:19,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:55:19,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1843484896] [2024-11-13 12:55:19,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:55:19,710 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:55:19,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:55:19,712 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:55:19,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (54)] Waiting until timeout for monitored process [2024-11-13 12:55:20,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:55:20,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-13 12:55:20,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:55:23,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2024-11-13 12:55:23,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:55:23,833 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 203 treesize of output 133 [2024-11-13 12:55:23,842 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:55:23,842 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 288 treesize of output 138 [2024-11-13 12:55:24,152 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 280 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2024-11-13 12:55:24,152 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:55:24,983 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:55:24,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1843484896] [2024-11-13 12:55:24,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1843484896] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:55:24,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857295897] [2024-11-13 12:55:24,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:55:24,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:55:24,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:55:24,985 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:55:24,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2024-11-13 12:55:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:55:26,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-13 12:55:26,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:55:28,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2024-11-13 12:55:31,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2024-11-13 12:55:31,979 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:55:31,979 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 191 treesize of output 121 [2024-11-13 12:55:31,991 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:55:31,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 258 treesize of output 138 [2024-11-13 12:55:32,074 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 307 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2024-11-13 12:55:32,075 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:55:32,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857295897] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:55:32,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 12:55:32,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 20 [2024-11-13 12:55:32,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586468772] [2024-11-13 12:55:32,666 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 12:55:32,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-13 12:55:32,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:55:32,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-13 12:55:32,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2024-11-13 12:55:32,667 INFO L87 Difference]: Start difference. First operand 4695 states and 5957 transitions. Second operand has 21 states, 21 states have (on average 6.380952380952381) internal successors, (134), 20 states have internal predecessors, (134), 4 states have call successors, (38), 4 states have call predecessors, (38), 5 states have return successors, (38), 4 states have call predecessors, (38), 4 states have call successors, (38) [2024-11-13 12:55:43,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:55:43,939 INFO L93 Difference]: Finished difference Result 16637 states and 20835 transitions. [2024-11-13 12:55:43,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-13 12:55:43,939 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.380952380952381) internal successors, (134), 20 states have internal predecessors, (134), 4 states have call successors, (38), 4 states have call predecessors, (38), 5 states have return successors, (38), 4 states have call predecessors, (38), 4 states have call successors, (38) Word has length 160 [2024-11-13 12:55:43,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:55:43,958 INFO L225 Difference]: With dead ends: 16637 [2024-11-13 12:55:43,958 INFO L226 Difference]: Without dead ends: 11945 [2024-11-13 12:55:43,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 373 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=366, Invalid=2390, Unknown=0, NotChecked=0, Total=2756 [2024-11-13 12:55:43,965 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 558 mSDsluCounter, 2650 mSDsCounter, 0 mSdLazyCounter, 1453 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 2887 SdHoareTripleChecker+Invalid, 1588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:55:43,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 2887 Invalid, 1588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1453 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2024-11-13 12:55:43,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11945 states. [2024-11-13 12:55:45,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11945 to 11021. [2024-11-13 12:55:45,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11021 states, 10018 states have (on average 1.2376721900578957) internal successors, (12399), 10126 states have internal predecessors, (12399), 712 states have call successors, (712), 290 states have call predecessors, (712), 290 states have return successors, (712), 604 states have call predecessors, (712), 712 states have call successors, (712) [2024-11-13 12:55:45,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11021 states to 11021 states and 13823 transitions. [2024-11-13 12:55:45,530 INFO L78 Accepts]: Start accepts. Automaton has 11021 states and 13823 transitions. Word has length 160 [2024-11-13 12:55:45,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:55:45,531 INFO L471 AbstractCegarLoop]: Abstraction has 11021 states and 13823 transitions. [2024-11-13 12:55:45,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.380952380952381) internal successors, (134), 20 states have internal predecessors, (134), 4 states have call successors, (38), 4 states have call predecessors, (38), 5 states have return successors, (38), 4 states have call predecessors, (38), 4 states have call successors, (38) [2024-11-13 12:55:45,532 INFO L276 IsEmpty]: Start isEmpty. Operand 11021 states and 13823 transitions. [2024-11-13 12:55:45,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-13 12:55:45,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:55:45,540 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:55:45,571 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2024-11-13 12:55:45,746 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (54)] Ended with exit code 0 [2024-11-13 12:55:45,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,54 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:55:45,941 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:55:45,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:55:45,941 INFO L85 PathProgramCache]: Analyzing trace with hash -720351130, now seen corresponding path program 1 times [2024-11-13 12:55:45,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:55:45,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2093778329] [2024-11-13 12:55:45,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:55:45,942 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:55:45,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:55:45,944 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:55:45,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (56)] Waiting until timeout for monitored process [2024-11-13 12:55:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:55:46,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-13 12:55:46,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:55:48,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-11-13 12:55:48,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-13 12:55:48,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-13 12:55:48,674 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 51 proven. 72 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-13 12:55:48,674 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:55:49,827 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-13 12:55:49,827 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 30 treesize of output 25 [2024-11-13 12:55:50,526 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2024-11-13 12:55:50,526 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:55:50,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2093778329] [2024-11-13 12:55:50,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2093778329] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:55:50,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:55:50,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 23 [2024-11-13 12:55:50,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285509050] [2024-11-13 12:55:50,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:55:50,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 12:55:50,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:55:50,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 12:55:50,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2024-11-13 12:55:50,528 INFO L87 Difference]: Start difference. First operand 11021 states and 13823 transitions. Second operand has 13 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 12 states have internal predecessors, (74), 3 states have call successors, (19), 1 states have call predecessors, (19), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-13 12:55:53,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:55:53,027 INFO L93 Difference]: Finished difference Result 22661 states and 28670 transitions. [2024-11-13 12:55:53,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 12:55:53,028 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 12 states have internal predecessors, (74), 3 states have call successors, (19), 1 states have call predecessors, (19), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 160 [2024-11-13 12:55:53,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:55:53,048 INFO L225 Difference]: With dead ends: 22661 [2024-11-13 12:55:53,048 INFO L226 Difference]: Without dead ends: 11643 [2024-11-13 12:55:53,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 297 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=208, Invalid=784, Unknown=0, NotChecked=0, Total=992 [2024-11-13 12:55:53,061 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 812 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 12:55:53,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 734 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 12:55:53,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11643 states. [2024-11-13 12:55:55,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11643 to 11021. [2024-11-13 12:55:55,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11021 states, 10018 states have (on average 1.2308844080654822) internal successors, (12331), 10126 states have internal predecessors, (12331), 712 states have call successors, (712), 290 states have call predecessors, (712), 290 states have return successors, (712), 604 states have call predecessors, (712), 712 states have call successors, (712) [2024-11-13 12:55:55,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11021 states to 11021 states and 13755 transitions. [2024-11-13 12:55:55,268 INFO L78 Accepts]: Start accepts. Automaton has 11021 states and 13755 transitions. Word has length 160 [2024-11-13 12:55:55,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:55:55,269 INFO L471 AbstractCegarLoop]: Abstraction has 11021 states and 13755 transitions. [2024-11-13 12:55:55,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 12 states have internal predecessors, (74), 3 states have call successors, (19), 1 states have call predecessors, (19), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-13 12:55:55,269 INFO L276 IsEmpty]: Start isEmpty. Operand 11021 states and 13755 transitions. [2024-11-13 12:55:55,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-13 12:55:55,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:55:55,274 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:55:55,281 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (56)] Forceful destruction successful, exit code 0 [2024-11-13 12:55:55,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 56 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:55:55,474 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:55:55,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:55:55,475 INFO L85 PathProgramCache]: Analyzing trace with hash -355138278, now seen corresponding path program 1 times [2024-11-13 12:55:55,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:55:55,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1614431971] [2024-11-13 12:55:55,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:55:55,475 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:55:55,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:55:55,477 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:55:55,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (57)] Waiting until timeout for monitored process [2024-11-13 12:55:56,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:55:56,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-13 12:55:56,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:55:58,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-11-13 12:55:58,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-11-13 12:55:58,776 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 13 proven. 319 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2024-11-13 12:55:58,776 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:55:59,286 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:55:59,287 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:55:59,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1614431971] [2024-11-13 12:55:59,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1614431971] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:55:59,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:55:59,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2024-11-13 12:55:59,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572904831] [2024-11-13 12:55:59,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:55:59,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 12:55:59,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:55:59,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 12:55:59,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2024-11-13 12:55:59,288 INFO L87 Difference]: Start difference. First operand 11021 states and 13755 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:56:01,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:56:01,199 INFO L93 Difference]: Finished difference Result 24610 states and 30452 transitions. [2024-11-13 12:56:01,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:56:01,200 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 160 [2024-11-13 12:56:01,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:56:01,220 INFO L225 Difference]: With dead ends: 24610 [2024-11-13 12:56:01,220 INFO L226 Difference]: Without dead ends: 13392 [2024-11-13 12:56:01,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-11-13 12:56:01,231 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 214 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 12:56:01,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 733 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 12:56:01,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13392 states. [2024-11-13 12:56:02,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13392 to 9683. [2024-11-13 12:56:02,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9683 states, 8806 states have (on average 1.235066999772882) internal successors, (10876), 8896 states have internal predecessors, (10876), 628 states have call successors, (628), 248 states have call predecessors, (628), 248 states have return successors, (628), 538 states have call predecessors, (628), 628 states have call successors, (628) [2024-11-13 12:56:02,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9683 states to 9683 states and 12132 transitions. [2024-11-13 12:56:02,494 INFO L78 Accepts]: Start accepts. Automaton has 9683 states and 12132 transitions. Word has length 160 [2024-11-13 12:56:02,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:56:02,495 INFO L471 AbstractCegarLoop]: Abstraction has 9683 states and 12132 transitions. [2024-11-13 12:56:02,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:56:02,495 INFO L276 IsEmpty]: Start isEmpty. Operand 9683 states and 12132 transitions. [2024-11-13 12:56:02,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-13 12:56:02,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:56:02,500 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:56:02,507 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (57)] Forceful destruction successful, exit code 0 [2024-11-13 12:56:02,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:56:02,701 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:56:02,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:56:02,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1508888803, now seen corresponding path program 1 times [2024-11-13 12:56:02,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:56:02,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2013372585] [2024-11-13 12:56:02,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:56:02,701 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:56:02,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:56:02,703 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:56:02,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (58)] Waiting until timeout for monitored process [2024-11-13 12:56:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:56:03,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-13 12:56:03,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:56:03,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-13 12:56:08,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2024-11-13 12:56:08,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2024-11-13 12:56:09,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2024-11-13 12:56:09,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 33 [2024-11-13 12:56:09,947 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 16 proven. 440 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2024-11-13 12:56:09,947 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:56:11,282 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:56:11,282 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:56:11,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2013372585] [2024-11-13 12:56:11,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2013372585] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:56:11,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:56:11,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [24] total 30 [2024-11-13 12:56:11,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223512943] [2024-11-13 12:56:11,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:56:11,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 12:56:11,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:56:11,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 12:56:11,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 [2024-11-13 12:56:11,284 INFO L87 Difference]: Start difference. First operand 9683 states and 12132 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:56:13,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:56:13,246 INFO L93 Difference]: Finished difference Result 21652 states and 26914 transitions. [2024-11-13 12:56:13,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:56:13,247 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 160 [2024-11-13 12:56:13,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:56:13,264 INFO L225 Difference]: With dead ends: 21652 [2024-11-13 12:56:13,264 INFO L226 Difference]: Without dead ends: 11972 [2024-11-13 12:56:13,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=102, Invalid=890, Unknown=0, NotChecked=0, Total=992 [2024-11-13 12:56:13,270 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 190 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 12:56:13,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 843 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 12:56:13,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11972 states. [2024-11-13 12:56:14,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11972 to 10721. [2024-11-13 12:56:14,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10721 states, 9844 states have (on average 1.2236895570906137) internal successors, (12046), 9934 states have internal predecessors, (12046), 628 states have call successors, (628), 248 states have call predecessors, (628), 248 states have return successors, (628), 538 states have call predecessors, (628), 628 states have call successors, (628) [2024-11-13 12:56:14,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10721 states to 10721 states and 13302 transitions. [2024-11-13 12:56:14,580 INFO L78 Accepts]: Start accepts. Automaton has 10721 states and 13302 transitions. Word has length 160 [2024-11-13 12:56:14,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:56:14,581 INFO L471 AbstractCegarLoop]: Abstraction has 10721 states and 13302 transitions. [2024-11-13 12:56:14,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:56:14,581 INFO L276 IsEmpty]: Start isEmpty. Operand 10721 states and 13302 transitions. [2024-11-13 12:56:14,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-13 12:56:14,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:56:14,588 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:56:14,593 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (58)] Ended with exit code 0 [2024-11-13 12:56:14,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:56:14,789 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:56:14,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:56:14,789 INFO L85 PathProgramCache]: Analyzing trace with hash 482949402, now seen corresponding path program 1 times [2024-11-13 12:56:14,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:56:14,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2125835696] [2024-11-13 12:56:14,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:56:14,790 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:56:14,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:56:14,792 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:56:14,793 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (59)] Waiting until timeout for monitored process [2024-11-13 12:56:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:56:15,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 12:56:15,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:56:15,392 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2024-11-13 12:56:15,392 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:56:15,392 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:56:15,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2125835696] [2024-11-13 12:56:15,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2125835696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:56:15,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:56:15,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:56:15,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760131632] [2024-11-13 12:56:15,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:56:15,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:56:15,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:56:15,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:56:15,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:56:15,396 INFO L87 Difference]: Start difference. First operand 10721 states and 13302 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-13 12:56:16,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:56:16,767 INFO L93 Difference]: Finished difference Result 21439 states and 26601 transitions. [2024-11-13 12:56:16,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:56:16,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 160 [2024-11-13 12:56:16,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:56:16,786 INFO L225 Difference]: With dead ends: 21439 [2024-11-13 12:56:16,786 INFO L226 Difference]: Without dead ends: 10721 [2024-11-13 12:56:16,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 157 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 12:56:16,799 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:56:16,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 484 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:56:16,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10721 states. [2024-11-13 12:56:17,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10721 to 10721. [2024-11-13 12:56:17,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10721 states, 9844 states have (on average 1.2232832182039821) internal successors, (12042), 9934 states have internal predecessors, (12042), 628 states have call successors, (628), 248 states have call predecessors, (628), 248 states have return successors, (628), 538 states have call predecessors, (628), 628 states have call successors, (628) [2024-11-13 12:56:17,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10721 states to 10721 states and 13298 transitions. [2024-11-13 12:56:17,986 INFO L78 Accepts]: Start accepts. Automaton has 10721 states and 13298 transitions. Word has length 160 [2024-11-13 12:56:17,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:56:17,987 INFO L471 AbstractCegarLoop]: Abstraction has 10721 states and 13298 transitions. [2024-11-13 12:56:17,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-13 12:56:17,987 INFO L276 IsEmpty]: Start isEmpty. Operand 10721 states and 13298 transitions. [2024-11-13 12:56:17,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-13 12:56:17,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:56:17,991 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:56:17,997 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (59)] Ended with exit code 0 [2024-11-13 12:56:18,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:56:18,192 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:56:18,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:56:18,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1113641404, now seen corresponding path program 1 times [2024-11-13 12:56:18,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:56:18,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1112942019] [2024-11-13 12:56:18,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:56:18,193 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:56:18,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:56:18,195 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:56:18,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (60)] Waiting until timeout for monitored process [2024-11-13 12:56:18,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:56:18,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-13 12:56:18,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:56:22,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-11-13 12:56:22,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2024-11-13 12:56:22,178 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 412 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-13 12:56:22,178 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:56:23,085 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:56:23,086 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:56:23,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1112942019] [2024-11-13 12:56:23,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1112942019] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:56:23,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:56:23,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [17] total 23 [2024-11-13 12:56:23,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624863691] [2024-11-13 12:56:23,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:56:23,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 12:56:23,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:56:23,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 12:56:23,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2024-11-13 12:56:23,087 INFO L87 Difference]: Start difference. First operand 10721 states and 13298 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:56:25,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:56:25,607 INFO L93 Difference]: Finished difference Result 23794 states and 29237 transitions. [2024-11-13 12:56:25,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:56:25,608 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 162 [2024-11-13 12:56:25,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:56:25,633 INFO L225 Difference]: With dead ends: 23794 [2024-11-13 12:56:25,633 INFO L226 Difference]: Without dead ends: 13076 [2024-11-13 12:56:25,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2024-11-13 12:56:25,647 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 230 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-13 12:56:25,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 682 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-13 12:56:25,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13076 states. [2024-11-13 12:56:26,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13076 to 11615. [2024-11-13 12:56:27,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11615 states, 10738 states have (on average 1.2126094244738312) internal successors, (13021), 10828 states have internal predecessors, (13021), 628 states have call successors, (628), 248 states have call predecessors, (628), 248 states have return successors, (628), 538 states have call predecessors, (628), 628 states have call successors, (628) [2024-11-13 12:56:27,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11615 states to 11615 states and 14277 transitions. [2024-11-13 12:56:27,027 INFO L78 Accepts]: Start accepts. Automaton has 11615 states and 14277 transitions. Word has length 162 [2024-11-13 12:56:27,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:56:27,028 INFO L471 AbstractCegarLoop]: Abstraction has 11615 states and 14277 transitions. [2024-11-13 12:56:27,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:56:27,028 INFO L276 IsEmpty]: Start isEmpty. Operand 11615 states and 14277 transitions. [2024-11-13 12:56:27,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-13 12:56:27,032 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:56:27,033 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:56:27,038 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (60)] Ended with exit code 0 [2024-11-13 12:56:27,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:56:27,233 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:56:27,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:56:27,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1922988030, now seen corresponding path program 1 times [2024-11-13 12:56:27,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:56:27,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1764754760] [2024-11-13 12:56:27,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:56:27,234 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:56:27,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:56:27,236 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:56:27,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (61)] Waiting until timeout for monitored process [2024-11-13 12:56:27,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:56:27,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-13 12:56:27,833 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:56:29,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-13 12:56:29,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2024-11-13 12:56:29,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 34 [2024-11-13 12:56:29,871 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 2 proven. 198 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2024-11-13 12:56:29,871 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:56:30,626 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:56:30,626 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:56:30,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1764754760] [2024-11-13 12:56:30,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1764754760] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:56:30,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:56:30,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14] total 20 [2024-11-13 12:56:30,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437837529] [2024-11-13 12:56:30,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:56:30,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 12:56:30,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:56:30,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 12:56:30,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2024-11-13 12:56:30,628 INFO L87 Difference]: Start difference. First operand 11615 states and 14277 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:56:32,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:56:32,380 INFO L93 Difference]: Finished difference Result 11889 states and 14595 transitions. [2024-11-13 12:56:32,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:56:32,380 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 162 [2024-11-13 12:56:32,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:56:32,403 INFO L225 Difference]: With dead ends: 11889 [2024-11-13 12:56:32,403 INFO L226 Difference]: Without dead ends: 11887 [2024-11-13 12:56:32,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2024-11-13 12:56:32,408 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 102 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 12:56:32,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 1213 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 12:56:32,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11887 states. [2024-11-13 12:56:33,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11887 to 11701. [2024-11-13 12:56:33,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11701 states, 10824 states have (on average 1.210920177383592) internal successors, (13107), 10914 states have internal predecessors, (13107), 628 states have call successors, (628), 248 states have call predecessors, (628), 248 states have return successors, (628), 538 states have call predecessors, (628), 628 states have call successors, (628) [2024-11-13 12:56:33,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11701 states to 11701 states and 14363 transitions. [2024-11-13 12:56:33,925 INFO L78 Accepts]: Start accepts. Automaton has 11701 states and 14363 transitions. Word has length 162 [2024-11-13 12:56:33,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:56:33,925 INFO L471 AbstractCegarLoop]: Abstraction has 11701 states and 14363 transitions. [2024-11-13 12:56:33,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:56:33,926 INFO L276 IsEmpty]: Start isEmpty. Operand 11701 states and 14363 transitions. [2024-11-13 12:56:33,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-13 12:56:33,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:56:33,933 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:56:33,939 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (61)] Ended with exit code 0 [2024-11-13 12:56:34,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 61 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:56:34,133 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:56:34,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:56:34,134 INFO L85 PathProgramCache]: Analyzing trace with hash 342521084, now seen corresponding path program 1 times [2024-11-13 12:56:34,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:56:34,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1317060059] [2024-11-13 12:56:34,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:56:34,135 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:56:34,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:56:34,137 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:56:34,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (62)] Waiting until timeout for monitored process [2024-11-13 12:56:34,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:56:34,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-13 12:56:34,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:56:37,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-11-13 12:56:37,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2024-11-13 12:56:37,942 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 412 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-13 12:56:37,942 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:56:38,590 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:56:38,590 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:56:38,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1317060059] [2024-11-13 12:56:38,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1317060059] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:56:38,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:56:38,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2024-11-13 12:56:38,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644456757] [2024-11-13 12:56:38,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:56:38,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:56:38,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:56:38,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:56:38,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-11-13 12:56:38,592 INFO L87 Difference]: Start difference. First operand 11701 states and 14363 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:56:41,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:56:41,231 INFO L93 Difference]: Finished difference Result 20457 states and 25129 transitions. [2024-11-13 12:56:41,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:56:41,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 162 [2024-11-13 12:56:41,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:56:41,274 INFO L225 Difference]: With dead ends: 20457 [2024-11-13 12:56:41,274 INFO L226 Difference]: Without dead ends: 13112 [2024-11-13 12:56:41,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-11-13 12:56:41,286 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 60 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 12:56:41,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 557 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 12:56:41,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13112 states. [2024-11-13 12:56:42,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13112 to 11955. [2024-11-13 12:56:42,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11955 states, 11078 states have (on average 1.2087019317566348) internal successors, (13390), 11168 states have internal predecessors, (13390), 628 states have call successors, (628), 248 states have call predecessors, (628), 248 states have return successors, (628), 538 states have call predecessors, (628), 628 states have call successors, (628) [2024-11-13 12:56:42,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11955 states to 11955 states and 14646 transitions. [2024-11-13 12:56:42,454 INFO L78 Accepts]: Start accepts. Automaton has 11955 states and 14646 transitions. Word has length 162 [2024-11-13 12:56:42,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:56:42,455 INFO L471 AbstractCegarLoop]: Abstraction has 11955 states and 14646 transitions. [2024-11-13 12:56:42,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:56:42,455 INFO L276 IsEmpty]: Start isEmpty. Operand 11955 states and 14646 transitions. [2024-11-13 12:56:42,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-13 12:56:42,459 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:56:42,459 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:56:42,465 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (62)] Ended with exit code 0 [2024-11-13 12:56:42,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 62 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:56:42,660 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:56:42,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:56:42,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1699292989, now seen corresponding path program 1 times [2024-11-13 12:56:42,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:56:42,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [616188538] [2024-11-13 12:56:42,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:56:42,661 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:56:42,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:56:42,663 INFO L229 MonitoredProcess]: Starting monitored process 63 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:56:42,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (63)] Waiting until timeout for monitored process [2024-11-13 12:56:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:56:43,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-13 12:56:43,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:56:43,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-13 12:56:54,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2024-11-13 12:56:54,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-13 12:56:55,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2024-11-13 12:56:55,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2024-11-13 12:56:56,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 45 [2024-11-13 12:56:56,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2024-11-13 12:56:57,537 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 14 proven. 502 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2024-11-13 12:56:57,538 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:57:00,958 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:57:00,959 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:57:00,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [616188538] [2024-11-13 12:57:00,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [616188538] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:57:00,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:57:00,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [40] total 50 [2024-11-13 12:57:00,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312007169] [2024-11-13 12:57:00,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:57:00,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 12:57:00,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:57:00,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 12:57:00,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=2304, Unknown=0, NotChecked=0, Total=2450 [2024-11-13 12:57:00,960 INFO L87 Difference]: Start difference. First operand 11955 states and 14646 transitions. Second operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:57:06,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:57:06,130 INFO L93 Difference]: Finished difference Result 25075 states and 30645 transitions. [2024-11-13 12:57:06,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 12:57:06,132 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 162 [2024-11-13 12:57:06,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:57:06,150 INFO L225 Difference]: With dead ends: 25075 [2024-11-13 12:57:06,151 INFO L226 Difference]: Without dead ends: 13072 [2024-11-13 12:57:06,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 987 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=215, Invalid=3207, Unknown=0, NotChecked=0, Total=3422 [2024-11-13 12:57:06,160 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 201 mSDsluCounter, 1854 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 2066 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:57:06,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 2066 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-13 12:57:06,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13072 states. [2024-11-13 12:57:07,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13072 to 11982. [2024-11-13 12:57:07,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11982 states, 11105 states have (on average 1.2061233678523189) internal successors, (13394), 11195 states have internal predecessors, (13394), 628 states have call successors, (628), 248 states have call predecessors, (628), 248 states have return successors, (628), 538 states have call predecessors, (628), 628 states have call successors, (628) [2024-11-13 12:57:07,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11982 states to 11982 states and 14650 transitions. [2024-11-13 12:57:07,357 INFO L78 Accepts]: Start accepts. Automaton has 11982 states and 14650 transitions. Word has length 162 [2024-11-13 12:57:07,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:57:07,357 INFO L471 AbstractCegarLoop]: Abstraction has 11982 states and 14650 transitions. [2024-11-13 12:57:07,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:57:07,358 INFO L276 IsEmpty]: Start isEmpty. Operand 11982 states and 14650 transitions. [2024-11-13 12:57:07,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-13 12:57:07,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:57:07,364 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:07,371 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (63)] Forceful destruction successful, exit code 0 [2024-11-13 12:57:07,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:57:07,565 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:57:07,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:57:07,565 INFO L85 PathProgramCache]: Analyzing trace with hash -49731400, now seen corresponding path program 1 times [2024-11-13 12:57:07,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:57:07,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1161853893] [2024-11-13 12:57:07,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:57:07,566 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:57:07,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:57:07,568 INFO L229 MonitoredProcess]: Starting monitored process 64 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:57:07,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (64)] Waiting until timeout for monitored process [2024-11-13 12:57:08,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:57:08,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-13 12:57:08,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:57:11,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-13 12:57:11,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2024-11-13 12:57:11,307 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 412 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-13 12:57:11,308 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:57:12,167 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:57:12,168 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:57:12,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1161853893] [2024-11-13 12:57:12,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1161853893] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:57:12,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:57:12,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [17] total 23 [2024-11-13 12:57:12,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433983134] [2024-11-13 12:57:12,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:57:12,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 12:57:12,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:57:12,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 12:57:12,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2024-11-13 12:57:12,169 INFO L87 Difference]: Start difference. First operand 11982 states and 14650 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:57:14,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:57:14,920 INFO L93 Difference]: Finished difference Result 24488 states and 29834 transitions. [2024-11-13 12:57:14,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:57:14,921 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 162 [2024-11-13 12:57:14,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:57:14,947 INFO L225 Difference]: With dead ends: 24488 [2024-11-13 12:57:14,947 INFO L226 Difference]: Without dead ends: 12509 [2024-11-13 12:57:14,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2024-11-13 12:57:14,959 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 418 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-13 12:57:14,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 789 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-13 12:57:14,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12509 states. [2024-11-13 12:57:16,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12509 to 11308. [2024-11-13 12:57:16,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11308 states, 10453 states have (on average 1.2048215823208648) internal successors, (12594), 10541 states have internal predecessors, (12594), 616 states have call successors, (616), 238 states have call predecessors, (616), 238 states have return successors, (616), 528 states have call predecessors, (616), 616 states have call successors, (616) [2024-11-13 12:57:16,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11308 states to 11308 states and 13826 transitions. [2024-11-13 12:57:16,306 INFO L78 Accepts]: Start accepts. Automaton has 11308 states and 13826 transitions. Word has length 162 [2024-11-13 12:57:16,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:57:16,306 INFO L471 AbstractCegarLoop]: Abstraction has 11308 states and 13826 transitions. [2024-11-13 12:57:16,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:57:16,306 INFO L276 IsEmpty]: Start isEmpty. Operand 11308 states and 13826 transitions. [2024-11-13 12:57:16,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-13 12:57:16,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:57:16,311 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:16,317 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (64)] Forceful destruction successful, exit code 0 [2024-11-13 12:57:16,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:57:16,512 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:57:16,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:57:16,512 INFO L85 PathProgramCache]: Analyzing trace with hash -820851720, now seen corresponding path program 1 times [2024-11-13 12:57:16,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:57:16,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1803006296] [2024-11-13 12:57:16,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:57:16,513 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:57:16,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:57:16,518 INFO L229 MonitoredProcess]: Starting monitored process 65 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:57:16,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (65)] Waiting until timeout for monitored process [2024-11-13 12:57:17,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:57:17,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-13 12:57:17,155 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:57:19,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-13 12:57:19,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2024-11-13 12:57:19,964 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 412 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-13 12:57:19,964 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:57:20,424 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 12:57:20,424 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 12:57:20,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1803006296] [2024-11-13 12:57:20,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1803006296] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:57:20,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:57:20,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2024-11-13 12:57:20,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070093538] [2024-11-13 12:57:20,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:57:20,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:57:20,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 12:57:20,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:57:20,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-11-13 12:57:20,426 INFO L87 Difference]: Start difference. First operand 11308 states and 13826 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:57:22,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:57:22,063 INFO L93 Difference]: Finished difference Result 19285 states and 23597 transitions. [2024-11-13 12:57:22,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:57:22,064 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 162 [2024-11-13 12:57:22,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:57:22,084 INFO L225 Difference]: With dead ends: 19285 [2024-11-13 12:57:22,084 INFO L226 Difference]: Without dead ends: 11937 [2024-11-13 12:57:22,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-11-13 12:57:22,089 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 80 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 12:57:22,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 723 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 12:57:22,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11937 states. [2024-11-13 12:57:23,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11937 to 10864. [2024-11-13 12:57:23,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10864 states, 10009 states have (on average 1.1983215106404237) internal successors, (11994), 10097 states have internal predecessors, (11994), 616 states have call successors, (616), 238 states have call predecessors, (616), 238 states have return successors, (616), 528 states have call predecessors, (616), 616 states have call successors, (616) [2024-11-13 12:57:23,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10864 states to 10864 states and 13226 transitions. [2024-11-13 12:57:23,149 INFO L78 Accepts]: Start accepts. Automaton has 10864 states and 13226 transitions. Word has length 162 [2024-11-13 12:57:23,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:57:23,150 INFO L471 AbstractCegarLoop]: Abstraction has 10864 states and 13226 transitions. [2024-11-13 12:57:23,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 12:57:23,150 INFO L276 IsEmpty]: Start isEmpty. Operand 10864 states and 13226 transitions. [2024-11-13 12:57:23,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-13 12:57:23,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:57:23,155 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:23,161 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (65)] Forceful destruction successful, exit code 0 [2024-11-13 12:57:23,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 65 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:57:23,355 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:57:23,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:57:23,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1715973877, now seen corresponding path program 1 times [2024-11-13 12:57:23,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 12:57:23,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1117417691] [2024-11-13 12:57:23,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:57:23,356 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 12:57:23,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 12:57:23,358 INFO L229 MonitoredProcess]: Starting monitored process 66 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 12:57:23,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc325d4-2232-4efe-8fb7-bb8e2ae02881/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (66)] Waiting until timeout for monitored process [2024-11-13 12:57:23,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:57:23,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-13 12:57:23,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:57:24,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9