./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-55.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_c6e2c11b-f63f-4659-8641-cf61cc80b990/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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_c6e2c11b-f63f-4659-8641-cf61cc80b990/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-55.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 85aa73e9da404b3237f6b534f76a96725f8c968f66c8526708e2a81ace8745de --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:49:42,766 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:49:42,832 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 14:49:42,838 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:49:42,839 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:49:42,865 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:49:42,866 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:49:42,866 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:49:42,866 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:49:42,867 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:49:42,867 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:49:42,867 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:49:42,867 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:49:42,868 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:49:42,868 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:49:42,868 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:49:42,868 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:49:42,868 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:49:42,869 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:49:42,869 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:49:42,869 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:49:42,869 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:49:42,869 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:49:42,869 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:49:42,870 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:49:42,870 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:49:42,870 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:49:42,870 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:49:42,870 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:49:42,870 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:49:42,871 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:49:42,871 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:49:42,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:49:42,871 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:49:42,871 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:49:42,871 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:49:42,872 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 14:49:42,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 14:49:42,872 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:49:42,872 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:49:42,872 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:49:42,872 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:49:42,872 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_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 -> 85aa73e9da404b3237f6b534f76a96725f8c968f66c8526708e2a81ace8745de [2024-11-13 14:49:43,190 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:49:43,200 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:49:43,204 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:49:43,206 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:49:43,206 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:49:43,208 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-55.i Unable to find full path for "g++" [2024-11-13 14:49:45,342 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:49:45,619 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:49:45,622 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-55.i [2024-11-13 14:49:45,634 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/bin/uautomizer-verify-qhAvR1uOyd/data/b7293af61/bbe11338125e42c9a6dd03e470b03974/FLAG14c50085b [2024-11-13 14:49:45,926 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/bin/uautomizer-verify-qhAvR1uOyd/data/b7293af61/bbe11338125e42c9a6dd03e470b03974 [2024-11-13 14:49:45,928 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:49:45,930 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:49:45,931 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:49:45,931 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:49:45,937 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:49:45,938 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:49:45" (1/1) ... [2024-11-13 14:49:45,939 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7aa30871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:49:45, skipping insertion in model container [2024-11-13 14:49:45,939 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:49:45" (1/1) ... [2024-11-13 14:49:45,959 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:49:46,117 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_c6e2c11b-f63f-4659-8641-cf61cc80b990/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-55.i[916,929] [2024-11-13 14:49:46,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:49:46,193 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:49:46,206 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_c6e2c11b-f63f-4659-8641-cf61cc80b990/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-55.i[916,929] [2024-11-13 14:49:46,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:49:46,323 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:49:46,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:49:46 WrapperNode [2024-11-13 14:49:46,325 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:49:46,327 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:49:46,327 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:49:46,328 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:49:46,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:49:46" (1/1) ... [2024-11-13 14:49:46,358 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:49:46" (1/1) ... [2024-11-13 14:49:46,431 INFO L138 Inliner]: procedures = 29, calls = 138, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 452 [2024-11-13 14:49:46,431 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:49:46,432 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:49:46,432 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:49:46,432 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:49:46,444 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:49:46" (1/1) ... [2024-11-13 14:49:46,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:49:46" (1/1) ... [2024-11-13 14:49:46,454 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:49:46" (1/1) ... [2024-11-13 14:49:46,501 INFO L175 MemorySlicer]: Split 108 memory accesses to 8 slices as follows [2, 14, 37, 3, 6, 24, 3, 19]. 34 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 2, 5, 1, 1, 3, 1, 1]. The 17 writes are split as follows [0, 2, 5, 1, 2, 3, 1, 3]. [2024-11-13 14:49:46,505 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:49:46" (1/1) ... [2024-11-13 14:49:46,505 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:49:46" (1/1) ... [2024-11-13 14:49:46,539 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:49:46" (1/1) ... [2024-11-13 14:49:46,545 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:49:46" (1/1) ... [2024-11-13 14:49:46,548 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:49:46" (1/1) ... [2024-11-13 14:49:46,551 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:49:46" (1/1) ... [2024-11-13 14:49:46,560 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:49:46,561 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:49:46,561 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:49:46,561 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:49:46,562 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:49:46" (1/1) ... [2024-11-13 14:49:46,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:49:46,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:49:46,607 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:49:46,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:49:46,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:49:46,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-13 14:49:46,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-13 14:49:46,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-13 14:49:46,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-13 14:49:46,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-13 14:49:46,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-13 14:49:46,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-13 14:49:46,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-11-13 14:49:46,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 14:49:46,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 14:49:46,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-13 14:49:46,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-13 14:49:46,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-13 14:49:46,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-13 14:49:46,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-13 14:49:46,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-13 14:49:46,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-13 14:49:46,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-13 14:49:46,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-13 14:49:46,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-13 14:49:46,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-13 14:49:46,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-13 14:49:46,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-13 14:49:46,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-11-13 14:49:46,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 14:49:46,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 14:49:46,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-13 14:49:46,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-13 14:49:46,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-13 14:49:46,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-13 14:49:46,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-13 14:49:46,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-13 14:49:46,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-13 14:49:46,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-13 14:49:46,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-13 14:49:46,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-13 14:49:46,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-13 14:49:46,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-13 14:49:46,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-13 14:49:46,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-11-13 14:49:46,652 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 14:49:46,653 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 14:49:46,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 14:49:46,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 14:49:46,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 14:49:46,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-13 14:49:46,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-13 14:49:46,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-13 14:49:46,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-13 14:49:46,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-13 14:49:46,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:49:46,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:49:46,852 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:49:46,854 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:49:47,607 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2024-11-13 14:49:47,607 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:49:47,625 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:49:47,627 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 14:49:47,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:49:47 BoogieIcfgContainer [2024-11-13 14:49:47,628 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:49:47,631 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:49:47,631 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:49:47,636 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:49:47,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:49:45" (1/3) ... [2024-11-13 14:49:47,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76fd602e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:49:47, skipping insertion in model container [2024-11-13 14:49:47,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:49:46" (2/3) ... [2024-11-13 14:49:47,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76fd602e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:49:47, skipping insertion in model container [2024-11-13 14:49:47,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:49:47" (3/3) ... [2024-11-13 14:49:47,639 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-55.i [2024-11-13 14:49:47,651 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:49:47,653 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-55.i that has 2 procedures, 111 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 14:49:47,708 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:49:47,725 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;@33ea1184, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:49:47,726 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:49:47,731 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 96 states have (on average 1.4375) internal successors, (138), 97 states have internal predecessors, (138), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 14:49:47,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 14:49:47,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:49:47,748 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:49:47,749 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:49:47,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:49:47,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1804423851, now seen corresponding path program 1 times [2024-11-13 14:49:47,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:49:47,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076315383] [2024-11-13 14:49:47,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:47,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:49:47,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:48,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:49:48,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:48,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:49:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:48,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:49:48,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:48,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:49:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:48,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:49:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:48,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:49:48,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:48,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:49:48,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:48,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:49:48,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:48,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:49:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:48,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:49:48,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:48,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:49:48,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:48,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:49:48,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:48,297 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:49:48,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:49:48,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076315383] [2024-11-13 14:49:48,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076315383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:49:48,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:49:48,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:49:48,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105497158] [2024-11-13 14:49:48,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:49:48,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 14:49:48,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:49:48,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 14:49:48,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:49:48,330 INFO L87 Difference]: Start difference. First operand has 111 states, 96 states have (on average 1.4375) internal successors, (138), 97 states have internal predecessors, (138), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 14:49:48,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:49:48,374 INFO L93 Difference]: Finished difference Result 215 states and 330 transitions. [2024-11-13 14:49:48,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 14:49:48,376 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2024-11-13 14:49:48,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:49:48,386 INFO L225 Difference]: With dead ends: 215 [2024-11-13 14:49:48,386 INFO L226 Difference]: Without dead ends: 107 [2024-11-13 14:49:48,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:49:48,395 INFO L432 NwaCegarLoop]: 155 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, 155 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 14:49:48,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:49:48,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-13 14:49:48,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-13 14:49:48,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 93 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 14:49:48,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 155 transitions. [2024-11-13 14:49:48,466 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 155 transitions. Word has length 115 [2024-11-13 14:49:48,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:49:48,467 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 155 transitions. [2024-11-13 14:49:48,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 14:49:48,468 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 155 transitions. [2024-11-13 14:49:48,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 14:49:48,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:49:48,471 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:49:48,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 14:49:48,472 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:49:48,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:49:48,472 INFO L85 PathProgramCache]: Analyzing trace with hash 78140955, now seen corresponding path program 1 times [2024-11-13 14:49:48,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:49:48,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124000100] [2024-11-13 14:49:48,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:48,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:49:48,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:49,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:49:49,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:49,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:49:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:49,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:49:49,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:49,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:49:49,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:49,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:49:49,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:49,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:49:49,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:49,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:49:49,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:49,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:49:49,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:49,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:49:49,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:49,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:49:49,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:49,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:49:49,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:49,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:49:49,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:49,098 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:49:49,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:49:49,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124000100] [2024-11-13 14:49:49,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124000100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:49:49,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:49:49,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:49:49,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803600126] [2024-11-13 14:49:49,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:49:49,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:49:49,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:49:49,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:49:49,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:49:49,106 INFO L87 Difference]: Start difference. First operand 107 states and 155 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:49:49,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:49:49,197 INFO L93 Difference]: Finished difference Result 214 states and 311 transitions. [2024-11-13 14:49:49,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:49:49,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-13 14:49:49,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:49:49,200 INFO L225 Difference]: With dead ends: 214 [2024-11-13 14:49:49,200 INFO L226 Difference]: Without dead ends: 110 [2024-11-13 14:49:49,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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 14:49:49,202 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:49:49,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 445 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:49:49,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-13 14:49:49,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2024-11-13 14:49:49,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 14:49:49,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2024-11-13 14:49:49,231 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 115 [2024-11-13 14:49:49,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:49:49,233 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2024-11-13 14:49:49,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:49:49,234 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2024-11-13 14:49:49,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 14:49:49,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:49:49,239 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:49:49,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 14:49:49,239 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:49:49,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:49:49,240 INFO L85 PathProgramCache]: Analyzing trace with hash 758199325, now seen corresponding path program 1 times [2024-11-13 14:49:49,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:49:49,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088895341] [2024-11-13 14:49:49,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:49,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:49:49,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:49,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:49:49,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:49,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:49:49,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:49,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:49:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:49,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:49:49,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:49,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:49:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:49,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:49:49,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:49,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:49:49,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:49,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:49:49,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:49,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:49:49,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:49,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:49:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:49,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:49:49,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:49,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:49:49,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:49,725 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:49:49,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:49:49,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088895341] [2024-11-13 14:49:49,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088895341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:49:49,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:49:49,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:49:49,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718891644] [2024-11-13 14:49:49,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:49:49,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:49:49,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:49:49,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:49:49,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:49:49,732 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:49:49,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:49:49,801 INFO L93 Difference]: Finished difference Result 218 states and 315 transitions. [2024-11-13 14:49:49,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:49:49,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-13 14:49:49,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:49:49,804 INFO L225 Difference]: With dead ends: 218 [2024-11-13 14:49:49,808 INFO L226 Difference]: Without dead ends: 112 [2024-11-13 14:49:49,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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 14:49:49,810 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:49:49,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 446 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:49:49,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-13 14:49:49,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2024-11-13 14:49:49,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 97 states have (on average 1.3917525773195876) internal successors, (135), 97 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 14:49:49,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2024-11-13 14:49:49,832 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 115 [2024-11-13 14:49:49,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:49:49,833 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2024-11-13 14:49:49,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:49:49,834 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2024-11-13 14:49:49,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 14:49:49,838 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:49:49,838 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:49:49,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 14:49:49,839 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:49:49,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:49:49,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1761760609, now seen corresponding path program 1 times [2024-11-13 14:49:49,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:49:49,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380307852] [2024-11-13 14:49:49,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:49,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:49:49,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:50,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:49:50,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:50,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:49:50,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:50,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:49:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:50,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:49:50,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:50,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:49:50,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:50,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:49:50,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:50,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:49:50,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:50,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:49:50,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:50,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:49:50,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:50,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:49:50,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:50,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:49:50,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:50,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:49:50,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:50,141 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:49:50,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:49:50,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380307852] [2024-11-13 14:49:50,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380307852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:49:50,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:49:50,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:49:50,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804214505] [2024-11-13 14:49:50,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:49:50,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:49:50,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:49:50,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:49:50,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:49:50,146 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:49:50,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:49:50,192 INFO L93 Difference]: Finished difference Result 222 states and 319 transitions. [2024-11-13 14:49:50,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:49:50,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-13 14:49:50,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:49:50,194 INFO L225 Difference]: With dead ends: 222 [2024-11-13 14:49:50,194 INFO L226 Difference]: Without dead ends: 114 [2024-11-13 14:49:50,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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 14:49:50,196 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:49:50,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:49:50,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-13 14:49:50,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-11-13 14:49:50,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 99 states have (on average 1.3838383838383839) internal successors, (137), 99 states have internal predecessors, (137), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 14:49:50,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 161 transitions. [2024-11-13 14:49:50,220 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 161 transitions. Word has length 115 [2024-11-13 14:49:50,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:49:50,221 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 161 transitions. [2024-11-13 14:49:50,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:49:50,222 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 161 transitions. [2024-11-13 14:49:50,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 14:49:50,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:49:50,227 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:49:50,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 14:49:50,228 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:49:50,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:49:50,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1759913567, now seen corresponding path program 1 times [2024-11-13 14:49:50,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:49:50,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027194553] [2024-11-13 14:49:50,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:50,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:49:50,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:50,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:49:50,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:50,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:49:50,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:50,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:49:50,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:50,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:49:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:50,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:49:50,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:50,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:49:50,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:50,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:49:50,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:50,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:49:50,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:50,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:49:50,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:50,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:49:50,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:50,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:49:50,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:50,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:49:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:50,523 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:49:50,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:49:50,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027194553] [2024-11-13 14:49:50,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027194553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:49:50,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:49:50,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:49:50,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760716701] [2024-11-13 14:49:50,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:49:50,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:49:50,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:49:50,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:49:50,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:49:50,527 INFO L87 Difference]: Start difference. First operand 113 states and 161 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:49:50,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:49:50,551 INFO L93 Difference]: Finished difference Result 223 states and 319 transitions. [2024-11-13 14:49:50,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:49:50,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-13 14:49:50,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:49:50,553 INFO L225 Difference]: With dead ends: 223 [2024-11-13 14:49:50,554 INFO L226 Difference]: Without dead ends: 113 [2024-11-13 14:49:50,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:49:50,558 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:49:50,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 300 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:49:50,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-13 14:49:50,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-13 14:49:50,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 99 states have (on average 1.3737373737373737) internal successors, (136), 99 states have internal predecessors, (136), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 14:49:50,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 160 transitions. [2024-11-13 14:49:50,572 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 160 transitions. Word has length 115 [2024-11-13 14:49:50,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:49:50,573 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 160 transitions. [2024-11-13 14:49:50,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:49:50,573 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 160 transitions. [2024-11-13 14:49:50,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 14:49:50,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:49:50,579 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:49:50,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 14:49:50,579 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:49:50,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:49:50,579 INFO L85 PathProgramCache]: Analyzing trace with hash 2113060828, now seen corresponding path program 1 times [2024-11-13 14:49:50,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:49:50,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104255591] [2024-11-13 14:49:50,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:50,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:49:50,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:51,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:49:51,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:51,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:49:51,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:51,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:49:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:51,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:49:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:51,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:49:51,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:51,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:49:51,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:51,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:49:51,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:51,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:49:51,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:51,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:49:51,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:51,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:49:51,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:51,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:49:51,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:51,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:49:51,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:51,544 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:49:51,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:49:51,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104255591] [2024-11-13 14:49:51,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104255591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:49:51,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:49:51,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:49:51,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744018183] [2024-11-13 14:49:51,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:49:51,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:49:51,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:49:51,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:49:51,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:49:51,548 INFO L87 Difference]: Start difference. First operand 113 states and 160 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:49:51,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:49:51,971 INFO L93 Difference]: Finished difference Result 390 states and 551 transitions. [2024-11-13 14:49:51,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:49:51,972 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2024-11-13 14:49:51,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:49:51,974 INFO L225 Difference]: With dead ends: 390 [2024-11-13 14:49:51,974 INFO L226 Difference]: Without dead ends: 280 [2024-11-13 14:49:51,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:49:51,976 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 294 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:49:51,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 607 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:49:51,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-13 14:49:52,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 172. [2024-11-13 14:49:52,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 145 states have (on average 1.3724137931034484) internal successors, (199), 145 states have internal predecessors, (199), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 14:49:52,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 247 transitions. [2024-11-13 14:49:52,018 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 247 transitions. Word has length 117 [2024-11-13 14:49:52,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:49:52,019 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 247 transitions. [2024-11-13 14:49:52,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:49:52,019 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 247 transitions. [2024-11-13 14:49:52,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-13 14:49:52,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:49:52,021 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:49:52,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 14:49:52,021 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:49:52,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:49:52,022 INFO L85 PathProgramCache]: Analyzing trace with hash 516965168, now seen corresponding path program 1 times [2024-11-13 14:49:52,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:49:52,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768249628] [2024-11-13 14:49:52,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:52,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:49:52,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:52,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:49:52,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:52,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:49:52,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:52,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:49:52,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:52,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:49:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:52,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:49:52,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:52,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:49:52,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:52,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:49:52,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:52,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:49:52,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:52,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:49:52,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:52,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:49:52,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:52,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:49:52,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:52,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:49:52,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:52,874 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:49:52,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:49:52,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768249628] [2024-11-13 14:49:52,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768249628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:49:52,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:49:52,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 14:49:52,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877820158] [2024-11-13 14:49:52,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:49:52,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:49:52,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:49:52,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:49:52,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:49:52,876 INFO L87 Difference]: Start difference. First operand 172 states and 247 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:49:53,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:49:53,314 INFO L93 Difference]: Finished difference Result 338 states and 480 transitions. [2024-11-13 14:49:53,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:49:53,315 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-11-13 14:49:53,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:49:53,317 INFO L225 Difference]: With dead ends: 338 [2024-11-13 14:49:53,317 INFO L226 Difference]: Without dead ends: 228 [2024-11-13 14:49:53,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:49:53,318 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 176 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:49:53,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 726 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:49:53,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-13 14:49:53,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 176. [2024-11-13 14:49:53,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 149 states have (on average 1.3624161073825503) internal successors, (203), 149 states have internal predecessors, (203), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 14:49:53,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 251 transitions. [2024-11-13 14:49:53,335 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 251 transitions. Word has length 118 [2024-11-13 14:49:53,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:49:53,336 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 251 transitions. [2024-11-13 14:49:53,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:49:53,336 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 251 transitions. [2024-11-13 14:49:53,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-13 14:49:53,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:49:53,338 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:49:53,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 14:49:53,338 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:49:53,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:49:53,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1082737249, now seen corresponding path program 1 times [2024-11-13 14:49:53,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:49:53,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298873951] [2024-11-13 14:49:53,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:53,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:49:53,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:53,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:49:53,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:53,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:49:53,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:53,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:49:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:53,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:49:53,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:53,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:49:53,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:53,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:49:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:53,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:49:53,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:53,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:49:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:53,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:49:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:53,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:49:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:53,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:49:53,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:53,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:49:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:53,935 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:49:53,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:49:53,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298873951] [2024-11-13 14:49:53,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298873951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:49:53,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:49:53,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:49:53,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550179396] [2024-11-13 14:49:53,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:49:53,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:49:53,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:49:53,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:49:53,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:49:53,937 INFO L87 Difference]: Start difference. First operand 176 states and 251 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 14:49:54,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:49:54,094 INFO L93 Difference]: Finished difference Result 369 states and 512 transitions. [2024-11-13 14:49:54,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:49:54,095 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2024-11-13 14:49:54,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:49:54,098 INFO L225 Difference]: With dead ends: 369 [2024-11-13 14:49:54,099 INFO L226 Difference]: Without dead ends: 253 [2024-11-13 14:49:54,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:49:54,100 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 79 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:49:54,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 693 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:49:54,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-11-13 14:49:54,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 250. [2024-11-13 14:49:54,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 219 states have (on average 1.3378995433789955) internal successors, (293), 220 states have internal predecessors, (293), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-13 14:49:54,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 345 transitions. [2024-11-13 14:49:54,130 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 345 transitions. Word has length 119 [2024-11-13 14:49:54,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:49:54,132 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 345 transitions. [2024-11-13 14:49:54,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 14:49:54,132 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 345 transitions. [2024-11-13 14:49:54,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-13 14:49:54,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:49:54,134 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:49:54,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 14:49:54,134 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:49:54,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:49:54,135 INFO L85 PathProgramCache]: Analyzing trace with hash 840490785, now seen corresponding path program 1 times [2024-11-13 14:49:54,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:49:54,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305060089] [2024-11-13 14:49:54,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:54,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:49:54,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:54,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:49:54,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:54,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:49:54,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:54,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:49:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:54,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:49:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:54,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:49:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:54,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:49:54,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:54,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:49:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:54,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:49:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:54,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:49:54,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:54,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:49:54,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:54,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:49:54,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:54,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:49:54,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:54,932 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:49:54,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:49:54,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305060089] [2024-11-13 14:49:54,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305060089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:49:54,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:49:54,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:49:54,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085682884] [2024-11-13 14:49:54,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:49:54,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:49:54,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:49:54,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:49:54,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:49:54,935 INFO L87 Difference]: Start difference. First operand 250 states and 345 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:49:55,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:49:55,169 INFO L93 Difference]: Finished difference Result 426 states and 589 transitions. [2024-11-13 14:49:55,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:49:55,170 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2024-11-13 14:49:55,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:49:55,174 INFO L225 Difference]: With dead ends: 426 [2024-11-13 14:49:55,174 INFO L226 Difference]: Without dead ends: 254 [2024-11-13 14:49:55,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:49:55,175 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 57 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:49:55,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 787 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:49:55,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-13 14:49:55,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2024-11-13 14:49:55,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 221 states have (on average 1.334841628959276) internal successors, (295), 222 states have internal predecessors, (295), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-13 14:49:55,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 347 transitions. [2024-11-13 14:49:55,198 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 347 transitions. Word has length 119 [2024-11-13 14:49:55,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:49:55,198 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 347 transitions. [2024-11-13 14:49:55,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:49:55,199 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 347 transitions. [2024-11-13 14:49:55,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-13 14:49:55,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:49:55,201 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:49:55,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 14:49:55,201 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:49:55,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:49:55,201 INFO L85 PathProgramCache]: Analyzing trace with hash -2109032487, now seen corresponding path program 1 times [2024-11-13 14:49:55,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:49:55,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572446775] [2024-11-13 14:49:55,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:55,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:49:55,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:55,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:49:55,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:55,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:49:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:55,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:49:55,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:55,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:49:55,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:55,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:49:55,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:55,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:49:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:55,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:49:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:55,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:49:55,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:55,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:49:55,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:55,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:49:55,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:55,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:49:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:55,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:49:55,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:55,698 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:49:55,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:49:55,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572446775] [2024-11-13 14:49:55,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572446775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:49:55,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:49:55,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:49:55,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935291928] [2024-11-13 14:49:55,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:49:55,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:49:55,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:49:55,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:49:55,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:49:55,701 INFO L87 Difference]: Start difference. First operand 252 states and 347 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:49:55,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:49:55,879 INFO L93 Difference]: Finished difference Result 610 states and 843 transitions. [2024-11-13 14:49:55,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:49:55,880 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2024-11-13 14:49:55,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:49:55,883 INFO L225 Difference]: With dead ends: 610 [2024-11-13 14:49:55,886 INFO L226 Difference]: Without dead ends: 426 [2024-11-13 14:49:55,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:49:55,887 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 143 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:49:55,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 865 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:49:55,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2024-11-13 14:49:55,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 423. [2024-11-13 14:49:55,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 376 states have (on average 1.327127659574468) internal successors, (499), 378 states have internal predecessors, (499), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-13 14:49:55,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 579 transitions. [2024-11-13 14:49:55,922 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 579 transitions. Word has length 121 [2024-11-13 14:49:55,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:49:55,922 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 579 transitions. [2024-11-13 14:49:55,922 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:49:55,923 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 579 transitions. [2024-11-13 14:49:55,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-13 14:49:55,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:49:55,924 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:49:55,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 14:49:55,925 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:49:55,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:49:55,925 INFO L85 PathProgramCache]: Analyzing trace with hash -2086400233, now seen corresponding path program 1 times [2024-11-13 14:49:55,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:49:55,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324954483] [2024-11-13 14:49:55,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:55,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:49:55,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:56,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:49:56,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:56,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:49:56,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:56,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:49:56,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:56,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:49:56,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:56,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:49:56,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:56,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:49:56,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:56,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:49:56,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:56,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:49:56,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:56,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:49:56,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:56,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:49:56,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:56,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:49:56,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:56,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:49:56,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:56,507 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:49:56,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:49:56,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324954483] [2024-11-13 14:49:56,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324954483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:49:56,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:49:56,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:49:56,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138855188] [2024-11-13 14:49:56,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:49:56,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:49:56,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:49:56,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:49:56,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:49:56,510 INFO L87 Difference]: Start difference. First operand 423 states and 579 transitions. Second operand has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 14:49:56,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:49:56,718 INFO L93 Difference]: Finished difference Result 781 states and 1066 transitions. [2024-11-13 14:49:56,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:49:56,719 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2024-11-13 14:49:56,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:49:56,722 INFO L225 Difference]: With dead ends: 781 [2024-11-13 14:49:56,723 INFO L226 Difference]: Without dead ends: 435 [2024-11-13 14:49:56,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:49:56,724 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 69 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:49:56,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 977 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:49:56,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2024-11-13 14:49:56,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 337. [2024-11-13 14:49:56,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 294 states have (on average 1.3129251700680271) internal successors, (386), 294 states have internal predecessors, (386), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-13 14:49:56,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 458 transitions. [2024-11-13 14:49:56,771 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 458 transitions. Word has length 121 [2024-11-13 14:49:56,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:49:56,771 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 458 transitions. [2024-11-13 14:49:56,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 14:49:56,772 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 458 transitions. [2024-11-13 14:49:56,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-13 14:49:56,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:49:56,774 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:49:56,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 14:49:56,774 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:49:56,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:49:56,775 INFO L85 PathProgramCache]: Analyzing trace with hash 2081901628, now seen corresponding path program 1 times [2024-11-13 14:49:56,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:49:56,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036319132] [2024-11-13 14:49:56,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:56,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:49:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:57,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:49:57,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:57,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:49:57,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:57,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:49:57,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:57,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:49:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:57,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:49:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:57,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:49:57,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:57,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:49:57,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:57,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:49:57,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:57,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:49:57,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:57,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:49:57,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:57,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:49:57,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:57,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:49:57,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:57,308 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:49:57,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:49:57,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036319132] [2024-11-13 14:49:57,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036319132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:49:57,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:49:57,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:49:57,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286837542] [2024-11-13 14:49:57,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:49:57,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:49:57,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:49:57,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:49:57,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:49:57,311 INFO L87 Difference]: Start difference. First operand 337 states and 458 transitions. Second operand has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 14:49:57,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:49:57,461 INFO L93 Difference]: Finished difference Result 695 states and 943 transitions. [2024-11-13 14:49:57,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:49:57,462 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2024-11-13 14:49:57,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:49:57,465 INFO L225 Difference]: With dead ends: 695 [2024-11-13 14:49:57,465 INFO L226 Difference]: Without dead ends: 435 [2024-11-13 14:49:57,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:49:57,467 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 122 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:49:57,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 554 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:49:57,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2024-11-13 14:49:57,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 353. [2024-11-13 14:49:57,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 310 states have (on average 1.3193548387096774) internal successors, (409), 310 states have internal predecessors, (409), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-13 14:49:57,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 481 transitions. [2024-11-13 14:49:57,500 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 481 transitions. Word has length 121 [2024-11-13 14:49:57,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:49:57,501 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 481 transitions. [2024-11-13 14:49:57,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 14:49:57,501 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 481 transitions. [2024-11-13 14:49:57,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-13 14:49:57,503 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:49:57,503 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:49:57,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 14:49:57,503 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:49:57,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:49:57,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1070784378, now seen corresponding path program 1 times [2024-11-13 14:49:57,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:49:57,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232081639] [2024-11-13 14:49:57,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:57,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:49:57,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:57,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:49:57,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:57,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:49:57,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:57,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:49:57,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:57,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:49:57,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:57,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:49:57,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:57,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:49:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:57,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:49:57,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:57,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:49:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:57,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:49:57,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:57,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:49:57,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:57,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:49:57,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:57,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:49:57,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:57,744 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:49:57,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:49:57,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232081639] [2024-11-13 14:49:57,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232081639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:49:57,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:49:57,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:49:57,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661167281] [2024-11-13 14:49:57,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:49:57,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:49:57,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:49:57,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:49:57,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:49:57,747 INFO L87 Difference]: Start difference. First operand 353 states and 481 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:49:57,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:49:57,808 INFO L93 Difference]: Finished difference Result 635 states and 869 transitions. [2024-11-13 14:49:57,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:49:57,809 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2024-11-13 14:49:57,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:49:57,811 INFO L225 Difference]: With dead ends: 635 [2024-11-13 14:49:57,811 INFO L226 Difference]: Without dead ends: 359 [2024-11-13 14:49:57,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:49:57,813 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 587 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 14:49:57,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 587 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:49:57,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-11-13 14:49:57,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2024-11-13 14:49:57,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 316 states have (on average 1.3132911392405062) internal successors, (415), 316 states have internal predecessors, (415), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-13 14:49:57,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 487 transitions. [2024-11-13 14:49:57,847 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 487 transitions. Word has length 121 [2024-11-13 14:49:57,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:49:57,847 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 487 transitions. [2024-11-13 14:49:57,847 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:49:57,847 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 487 transitions. [2024-11-13 14:49:57,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-13 14:49:57,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:49:57,850 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:49:57,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 14:49:57,850 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:49:57,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:49:57,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1763046255, now seen corresponding path program 1 times [2024-11-13 14:49:57,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:49:57,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546727533] [2024-11-13 14:49:57,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:57,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:49:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:49:58,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:49:58,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:49:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:49:58,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:49:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:49:58,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:49:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:49:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:49:58,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:49:58,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:49:58,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:49:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,076 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:49:58,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:49:58,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546727533] [2024-11-13 14:49:58,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546727533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:49:58,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:49:58,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:49:58,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072087032] [2024-11-13 14:49:58,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:49:58,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:49:58,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:49:58,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:49:58,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:49:58,078 INFO L87 Difference]: Start difference. First operand 359 states and 487 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:49:58,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:49:58,138 INFO L93 Difference]: Finished difference Result 653 states and 889 transitions. [2024-11-13 14:49:58,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:49:58,139 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2024-11-13 14:49:58,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:49:58,142 INFO L225 Difference]: With dead ends: 653 [2024-11-13 14:49:58,142 INFO L226 Difference]: Without dead ends: 371 [2024-11-13 14:49:58,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:49:58,143 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 594 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 14:49:58,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 594 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:49:58,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-13 14:49:58,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 367. [2024-11-13 14:49:58,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 324 states have (on average 1.3055555555555556) internal successors, (423), 324 states have internal predecessors, (423), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-13 14:49:58,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 495 transitions. [2024-11-13 14:49:58,174 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 495 transitions. Word has length 122 [2024-11-13 14:49:58,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:49:58,175 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 495 transitions. [2024-11-13 14:49:58,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:49:58,175 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 495 transitions. [2024-11-13 14:49:58,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-13 14:49:58,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:49:58,177 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:49:58,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 14:49:58,178 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:49:58,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:49:58,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1826130154, now seen corresponding path program 1 times [2024-11-13 14:49:58,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:49:58,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280873338] [2024-11-13 14:49:58,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:58,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:49:58,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:49:58,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:49:58,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:49:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:49:58,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:49:58,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:49:58,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:49:58,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:49:58,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:49:58,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:49:58,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:49:58,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:49:58,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,454 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:49:58,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:49:58,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280873338] [2024-11-13 14:49:58,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280873338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:49:58,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:49:58,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:49:58,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824753179] [2024-11-13 14:49:58,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:49:58,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:49:58,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:49:58,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:49:58,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:49:58,457 INFO L87 Difference]: Start difference. First operand 367 states and 495 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:49:58,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:49:58,618 INFO L93 Difference]: Finished difference Result 578 states and 778 transitions. [2024-11-13 14:49:58,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:49:58,619 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 124 [2024-11-13 14:49:58,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:49:58,622 INFO L225 Difference]: With dead ends: 578 [2024-11-13 14:49:58,622 INFO L226 Difference]: Without dead ends: 431 [2024-11-13 14:49:58,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:49:58,626 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 249 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:49:58,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 618 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:49:58,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2024-11-13 14:49:58,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 377. [2024-11-13 14:49:58,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 334 states have (on average 1.311377245508982) internal successors, (438), 334 states have internal predecessors, (438), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-13 14:49:58,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 510 transitions. [2024-11-13 14:49:58,664 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 510 transitions. Word has length 124 [2024-11-13 14:49:58,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:49:58,666 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 510 transitions. [2024-11-13 14:49:58,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:49:58,667 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 510 transitions. [2024-11-13 14:49:58,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-13 14:49:58,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:49:58,670 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:49:58,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 14:49:58,671 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:49:58,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:49:58,671 INFO L85 PathProgramCache]: Analyzing trace with hash 880489240, now seen corresponding path program 1 times [2024-11-13 14:49:58,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:49:58,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136469025] [2024-11-13 14:49:58,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:58,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:49:58,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:49:58,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:49:58,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:49:58,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:49:58,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:49:58,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:49:58,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:49:58,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:49:58,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:49:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:49:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:49:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:49:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,863 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:49:58,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:49:58,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136469025] [2024-11-13 14:49:58,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136469025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:49:58,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:49:58,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:49:58,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691512555] [2024-11-13 14:49:58,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:49:58,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:49:58,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:49:58,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:49:58,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:49:58,870 INFO L87 Difference]: Start difference. First operand 377 states and 510 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:49:58,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:49:58,957 INFO L93 Difference]: Finished difference Result 761 states and 1028 transitions. [2024-11-13 14:49:58,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:49:58,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 124 [2024-11-13 14:49:58,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:49:58,961 INFO L225 Difference]: With dead ends: 761 [2024-11-13 14:49:58,961 INFO L226 Difference]: Without dead ends: 457 [2024-11-13 14:49:58,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:49:58,963 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 45 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:49:58,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 449 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:49:58,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2024-11-13 14:49:58,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 365. [2024-11-13 14:49:58,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 322 states have (on average 1.2981366459627328) internal successors, (418), 322 states have internal predecessors, (418), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-13 14:49:58,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 490 transitions. [2024-11-13 14:49:58,997 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 490 transitions. Word has length 124 [2024-11-13 14:49:58,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:49:58,997 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 490 transitions. [2024-11-13 14:49:58,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:49:58,998 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 490 transitions. [2024-11-13 14:49:58,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-13 14:49:58,999 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:49:58,999 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:49:59,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 14:49:59,000 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:49:59,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:49:59,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1238026378, now seen corresponding path program 1 times [2024-11-13 14:49:59,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:49:59,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071430953] [2024-11-13 14:49:59,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:59,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:49:59,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:59,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:49:59,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:59,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:49:59,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:59,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:49:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:59,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:49:59,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:59,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:49:59,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:59,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:49:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:59,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:49:59,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:59,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:49:59,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:59,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:49:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:59,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:49:59,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:59,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:49:59,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:59,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 14:49:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:59,339 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:49:59,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:49:59,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071430953] [2024-11-13 14:49:59,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071430953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:49:59,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:49:59,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 14:49:59,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214987827] [2024-11-13 14:49:59,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:49:59,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:49:59,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:49:59,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:49:59,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:49:59,342 INFO L87 Difference]: Start difference. First operand 365 states and 490 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:49:59,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:49:59,557 INFO L93 Difference]: Finished difference Result 701 states and 938 transitions. [2024-11-13 14:49:59,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:49:59,558 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 126 [2024-11-13 14:49:59,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:49:59,561 INFO L225 Difference]: With dead ends: 701 [2024-11-13 14:49:59,561 INFO L226 Difference]: Without dead ends: 413 [2024-11-13 14:49:59,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:49:59,563 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 180 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:49:59,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 727 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:49:59,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-13 14:49:59,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 365. [2024-11-13 14:49:59,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 322 states have (on average 1.2857142857142858) internal successors, (414), 322 states have internal predecessors, (414), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-13 14:49:59,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 486 transitions. [2024-11-13 14:49:59,597 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 486 transitions. Word has length 126 [2024-11-13 14:49:59,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:49:59,598 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 486 transitions. [2024-11-13 14:49:59,598 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:49:59,598 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 486 transitions. [2024-11-13 14:49:59,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-13 14:49:59,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:49:59,600 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:49:59,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 14:49:59,601 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:49:59,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:49:59,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1367997176, now seen corresponding path program 1 times [2024-11-13 14:49:59,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:49:59,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977316924] [2024-11-13 14:49:59,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:59,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:49:59,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:49:59,717 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:49:59,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:49:59,862 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:49:59,863 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 14:49:59,864 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 14:49:59,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-13 14:49:59,870 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:50:00,021 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 14:50:00,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 02:50:00 BoogieIcfgContainer [2024-11-13 14:50:00,028 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 14:50:00,029 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 14:50:00,029 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 14:50:00,029 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 14:50:00,030 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:49:47" (3/4) ... [2024-11-13 14:50:00,033 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 14:50:00,034 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 14:50:00,035 INFO L158 Benchmark]: Toolchain (without parser) took 14104.92ms. Allocated memory was 117.4MB in the beginning and 276.8MB in the end (delta: 159.4MB). Free memory was 92.2MB in the beginning and 156.2MB in the end (delta: -64.0MB). Peak memory consumption was 97.0MB. Max. memory is 16.1GB. [2024-11-13 14:50:00,035 INFO L158 Benchmark]: CDTParser took 2.10ms. Allocated memory is still 83.9MB. Free memory is still 40.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:50:00,035 INFO L158 Benchmark]: CACSL2BoogieTranslator took 394.76ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 77.3MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 14:50:00,036 INFO L158 Benchmark]: Boogie Procedure Inliner took 104.73ms. Allocated memory is still 117.4MB. Free memory was 77.3MB in the beginning and 73.8MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:50:00,036 INFO L158 Benchmark]: Boogie Preprocessor took 128.38ms. Allocated memory is still 117.4MB. Free memory was 73.8MB in the beginning and 68.9MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:50:00,037 INFO L158 Benchmark]: RCFGBuilder took 1066.64ms. Allocated memory is still 117.4MB. Free memory was 68.9MB in the beginning and 87.9MB in the end (delta: -19.0MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. [2024-11-13 14:50:00,037 INFO L158 Benchmark]: TraceAbstraction took 12397.93ms. Allocated memory was 117.4MB in the beginning and 276.8MB in the end (delta: 159.4MB). Free memory was 87.9MB in the beginning and 158.8MB in the end (delta: -70.8MB). Peak memory consumption was 82.2MB. Max. memory is 16.1GB. [2024-11-13 14:50:00,037 INFO L158 Benchmark]: Witness Printer took 4.77ms. Allocated memory is still 276.8MB. Free memory was 158.8MB in the beginning and 156.2MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:50:00,039 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.10ms. Allocated memory is still 83.9MB. Free memory is still 40.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 394.76ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 77.3MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 104.73ms. Allocated memory is still 117.4MB. Free memory was 77.3MB in the beginning and 73.8MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 128.38ms. Allocated memory is still 117.4MB. Free memory was 73.8MB in the beginning and 68.9MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1066.64ms. Allocated memory is still 117.4MB. Free memory was 68.9MB in the beginning and 87.9MB in the end (delta: -19.0MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. * TraceAbstraction took 12397.93ms. Allocated memory was 117.4MB in the beginning and 276.8MB in the end (delta: 159.4MB). Free memory was 87.9MB in the beginning and 158.8MB in the end (delta: -70.8MB). Peak memory consumption was 82.2MB. Max. memory is 16.1GB. * Witness Printer took 4.77ms. Allocated memory is still 276.8MB. Free memory was 158.8MB in the beginning and 156.2MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. 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 shiftRight at line 67, overapproximation of shiftRight at line 67, overapproximation of someBinaryArithmeticDOUBLEoperation at line 62, overapproximation of someBinaryDOUBLEComparisonOperation at line 87, overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 91, overapproximation of someBinaryDOUBLEComparisonOperation at line 85, overapproximation of someBinaryDOUBLEComparisonOperation at line 87, overapproximation of someBinaryDOUBLEComparisonOperation at line 85, overapproximation of someBinaryDOUBLEComparisonOperation at line 104, overapproximation of someBinaryDOUBLEComparisonOperation at line 91. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L25-L27] double double_Array_0[5] = { 1.8, 63.5, 0.25, 256.75, 16.5 }; [L25-L27] double double_Array_0[5] = { 1.8, 63.5, 0.25, 256.75, 16.5 }; [L25-L27] double double_Array_0[5] = { 1.8, 63.5, 0.25, 256.75, 16.5 }; [L25-L27] double double_Array_0[5] = { 1.8, 63.5, 0.25, 256.75, 16.5 }; [L25-L27] double double_Array_0[5] = { 1.8, 63.5, 0.25, 256.75, 16.5 }; [L25-L27] double double_Array_0[5] = { 1.8, 63.5, 0.25, 256.75, 16.5 }; [L28-L30] float float_Array_0[1] = { 4.6 }; [L28-L30] float float_Array_0[1] = { 4.6 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { -5 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { -5 }; [L34-L36] unsigned char unsigned_char_Array_0[3] = { 2, 128, 100 }; [L34-L36] unsigned char unsigned_char_Array_0[3] = { 2, 128, 100 }; [L34-L36] unsigned char unsigned_char_Array_0[3] = { 2, 128, 100 }; [L34-L36] unsigned char unsigned_char_Array_0[3] = { 2, 128, 100 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[1] = { 500 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[1] = { 500 }; [L40-L42] unsigned short int unsigned_short_int_Array_0[1] = { 10 }; [L40-L42] unsigned short int unsigned_short_int_Array_0[1] = { 10 }; [L43] signed long int last_1_signed_long_int_Array_0_0_ = -5; [L44] unsigned char last_1_unsigned_char_Array_0_0_ = 2; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=0, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L108] isInitial = 1 [L109] FCALL initially() [L110] COND TRUE 1 [L111] CALL updateLastVariables() [L100] EXPR signed_long_int_Array_0[0] [L100] last_1_signed_long_int_Array_0_0_ = signed_long_int_Array_0[0] [L101] EXPR unsigned_char_Array_0[0] [L101] last_1_unsigned_char_Array_0_0_ = unsigned_char_Array_0[0] [L111] RET updateLastVariables() [L112] CALL updateVariables() [L78] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L79] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L79] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L79] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L80] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L80] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L80] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L81] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L82] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L82] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L82] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L83] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L83] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L83] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L84] double_Array_0[0] = __VERIFIER_nondet_double() [L85] EXPR double_Array_0[0] [L85] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L85] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F [L85] EXPR double_Array_0[0] [L85] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L85] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 2305843.009213691390e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L85] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 2305843.009213691390e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L85] CALL assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 2305843.009213691390e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L85] RET assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 2305843.009213691390e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L86] double_Array_0[1] = __VERIFIER_nondet_double() [L87] EXPR double_Array_0[1] [L87] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L87] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F [L87] EXPR double_Array_0[1] [L87] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L87] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 2305843.009213691390e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L87] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 2305843.009213691390e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L87] CALL assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 2305843.009213691390e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L87] RET assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 2305843.009213691390e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L88] double_Array_0[2] = __VERIFIER_nondet_double() [L89] EXPR double_Array_0[2] [L89] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L89] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F [L89] EXPR double_Array_0[2] [L89] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L89] EXPR (double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L89] EXPR (double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L89] CALL assume_abort_if_not((double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L89] RET assume_abort_if_not((double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L90] double_Array_0[4] = __VERIFIER_nondet_double() [L91] EXPR double_Array_0[4] [L91] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L91] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F [L91] EXPR double_Array_0[4] [L91] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L91] EXPR (double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L91] EXPR (double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L91] CALL assume_abort_if_not((double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L91] RET assume_abort_if_not((double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L92] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L93] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L93] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L93] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L94] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L94] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L94] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L95] unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L96] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L96] CALL assume_abort_if_not(unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L96] RET assume_abort_if_not(unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] CALL assume_abort_if_not(unsigned_char_Array_0[2] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] RET assume_abort_if_not(unsigned_char_Array_0[2] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L112] RET updateVariables() [L113] CALL step() [L48] unsigned char stepLocal_1 = last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_; [L49] signed long int stepLocal_0 = last_1_unsigned_char_Array_0_0_; [L50] BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L50] COND TRUE BOOL_unsigned_char_Array_0[1] [L51] stepLocal_1 && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, stepLocal_0=2, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L51] stepLocal_1 && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L51] COND FALSE !(stepLocal_1 && BOOL_unsigned_char_Array_0[0]) [L61] BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L61] COND TRUE BOOL_unsigned_char_Array_0[1] [L62] EXPR double_Array_0[1] [L62] EXPR double_Array_0[0] [L62] EXPR double_Array_0[2] [L62] EXPR double_Array_0[4] [L62] double_Array_0[3] = (((double_Array_0[1] + double_Array_0[0]) + double_Array_0[2]) - double_Array_0[4]) [L64] EXPR double_Array_0[1] [L64] float_Array_0[0] = double_Array_0[1] [L65] EXPR unsigned_char_Array_0[1] [L65] unsigned_long_int_Array_0[0] = unsigned_char_Array_0[1] [L66] EXPR unsigned_char_Array_0[2] [L66] unsigned_char_Array_0[0] = unsigned_char_Array_0[2] [L67] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L67] EXPR -4 >> unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, stepLocal_0=2, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L67] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L67] EXPR (((-4 >> unsigned_short_int_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((-4 >> unsigned_short_int_Array_0[0])) : (unsigned_short_int_Array_0[0]) [L67] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L67] EXPR -4 >> unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, stepLocal_0=2, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L67] EXPR (((-4 >> unsigned_short_int_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((-4 >> unsigned_short_int_Array_0[0])) : (unsigned_short_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, stepLocal_0=2, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L67] signed long int stepLocal_3 = ((((-4 >> unsigned_short_int_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((-4 >> unsigned_short_int_Array_0[0])) : (unsigned_short_int_Array_0[0])); [L68] EXPR unsigned_short_int_Array_0[0] [L68] signed long int stepLocal_2 = unsigned_short_int_Array_0[0] / -8; [L69] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L69] COND FALSE !((~ unsigned_char_Array_0[0]) <= stepLocal_3) [L74] EXPR unsigned_char_Array_0[0] [L74] EXPR unsigned_char_Array_0[1] [L74] signed_long_int_Array_0[0] = (unsigned_char_Array_0[0] - unsigned_char_Array_0[1]) [L113] RET step() [L114] CALL, EXPR property() [L104] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L104] EXPR BOOL_unsigned_char_Array_0[1] ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[0]) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) 5)) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_unsigned_char_Array_0_0_)) [L104] EXPR (last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L104] EXPR (last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L104] EXPR ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[0]) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) 5)) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1 [L104] EXPR ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[0]) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) 5)) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L104] EXPR BOOL_unsigned_char_Array_0[1] ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[0]) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) 5)) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_unsigned_char_Array_0_0_)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L104] EXPR (BOOL_unsigned_char_Array_0[1] ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[0]) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) 5)) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_unsigned_char_Array_0_0_))) && (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[3] == ((double) (((double_Array_0[1] + double_Array_0[0]) + double_Array_0[2]) - double_Array_0[4]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L104] EXPR (BOOL_unsigned_char_Array_0[1] ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[0]) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) 5)) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_unsigned_char_Array_0_0_))) && (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[3] == ((double) (((double_Array_0[1] + double_Array_0[0]) + double_Array_0[2]) - double_Array_0[4]))) : 1) [L104] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L104] EXPR BOOL_unsigned_char_Array_0[1] ? (double_Array_0[3] == ((double) (((double_Array_0[1] + double_Array_0[0]) + double_Array_0[2]) - double_Array_0[4]))) : 1 [L104] EXPR double_Array_0[3] [L104] EXPR double_Array_0[1] [L104] EXPR double_Array_0[0] [L104] EXPR double_Array_0[2] [L104] EXPR double_Array_0[4] [L104] EXPR BOOL_unsigned_char_Array_0[1] ? (double_Array_0[3] == ((double) (((double_Array_0[1] + double_Array_0[0]) + double_Array_0[2]) - double_Array_0[4]))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L104] EXPR (BOOL_unsigned_char_Array_0[1] ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[0]) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) 5)) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_unsigned_char_Array_0_0_))) && (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[3] == ((double) (((double_Array_0[1] + double_Array_0[0]) + double_Array_0[2]) - double_Array_0[4]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L104] EXPR ((BOOL_unsigned_char_Array_0[1] ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[0]) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) 5)) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_unsigned_char_Array_0_0_))) && (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[3] == ((double) (((double_Array_0[1] + double_Array_0[0]) + double_Array_0[2]) - double_Array_0[4]))) : 1)) && (((~ unsigned_char_Array_0[0]) <= (((((-4 >> unsigned_short_int_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((-4 >> unsigned_short_int_Array_0[0])) : (unsigned_short_int_Array_0[0])))) ? (((unsigned_char_Array_0[1] - 64) < (unsigned_short_int_Array_0[0] / -8)) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L104] EXPR ((BOOL_unsigned_char_Array_0[1] ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[0]) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) 5)) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_unsigned_char_Array_0_0_))) && (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[3] == ((double) (((double_Array_0[1] + double_Array_0[0]) + double_Array_0[2]) - double_Array_0[4]))) : 1)) && (((~ unsigned_char_Array_0[0]) <= (((((-4 >> unsigned_short_int_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((-4 >> unsigned_short_int_Array_0[0])) : (unsigned_short_int_Array_0[0])))) ? (((unsigned_char_Array_0[1] - 64) < (unsigned_short_int_Array_0[0] / -8)) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L104] EXPR (((BOOL_unsigned_char_Array_0[1] ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[0]) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) 5)) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_unsigned_char_Array_0_0_))) && (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[3] == ((double) (((double_Array_0[1] + double_Array_0[0]) + double_Array_0[2]) - double_Array_0[4]))) : 1)) && (((~ unsigned_char_Array_0[0]) <= (((((-4 >> unsigned_short_int_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((-4 >> unsigned_short_int_Array_0[0])) : (unsigned_short_int_Array_0[0])))) ? (((unsigned_char_Array_0[1] - 64) < (unsigned_short_int_Array_0[0] / -8)) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[1]))))) && (float_Array_0[0] == ((float) double_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L104] EXPR (((BOOL_unsigned_char_Array_0[1] ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[0]) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) 5)) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_unsigned_char_Array_0_0_))) && (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[3] == ((double) (((double_Array_0[1] + double_Array_0[0]) + double_Array_0[2]) - double_Array_0[4]))) : 1)) && (((~ unsigned_char_Array_0[0]) <= (((((-4 >> unsigned_short_int_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((-4 >> unsigned_short_int_Array_0[0])) : (unsigned_short_int_Array_0[0])))) ? (((unsigned_char_Array_0[1] - 64) < (unsigned_short_int_Array_0[0] / -8)) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[1]))))) && (float_Array_0[0] == ((float) double_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L104] EXPR ((((BOOL_unsigned_char_Array_0[1] ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[0]) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) 5)) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_unsigned_char_Array_0_0_))) && (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[3] == ((double) (((double_Array_0[1] + double_Array_0[0]) + double_Array_0[2]) - double_Array_0[4]))) : 1)) && (((~ unsigned_char_Array_0[0]) <= (((((-4 >> unsigned_short_int_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((-4 >> unsigned_short_int_Array_0[0])) : (unsigned_short_int_Array_0[0])))) ? (((unsigned_char_Array_0[1] - 64) < (unsigned_short_int_Array_0[0] / -8)) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[1]))))) && (float_Array_0[0] == ((float) double_Array_0[1]))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L104] EXPR ((((BOOL_unsigned_char_Array_0[1] ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[0]) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) 5)) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_unsigned_char_Array_0_0_))) && (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[3] == ((double) (((double_Array_0[1] + double_Array_0[0]) + double_Array_0[2]) - double_Array_0[4]))) : 1)) && (((~ unsigned_char_Array_0[0]) <= (((((-4 >> unsigned_short_int_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((-4 >> unsigned_short_int_Array_0[0])) : (unsigned_short_int_Array_0[0])))) ? (((unsigned_char_Array_0[1] - 64) < (unsigned_short_int_Array_0[0] / -8)) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[1]))))) && (float_Array_0[0] == ((float) double_Array_0[1]))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L104] EXPR (((((BOOL_unsigned_char_Array_0[1] ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[0]) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) 5)) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_unsigned_char_Array_0_0_))) && (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[3] == ((double) (((double_Array_0[1] + double_Array_0[0]) + double_Array_0[2]) - double_Array_0[4]))) : 1)) && (((~ unsigned_char_Array_0[0]) <= (((((-4 >> unsigned_short_int_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((-4 >> unsigned_short_int_Array_0[0])) : (unsigned_short_int_Array_0[0])))) ? (((unsigned_char_Array_0[1] - 64) < (unsigned_short_int_Array_0[0] / -8)) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[1]))))) && (float_Array_0[0] == ((float) double_Array_0[1]))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) && (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[2])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L104] EXPR (((((BOOL_unsigned_char_Array_0[1] ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[0]) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) 5)) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_unsigned_char_Array_0_0_))) && (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[3] == ((double) (((double_Array_0[1] + double_Array_0[0]) + double_Array_0[2]) - double_Array_0[4]))) : 1)) && (((~ unsigned_char_Array_0[0]) <= (((((-4 >> unsigned_short_int_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((-4 >> unsigned_short_int_Array_0[0])) : (unsigned_short_int_Array_0[0])))) ? (((unsigned_char_Array_0[1] - 64) < (unsigned_short_int_Array_0[0] / -8)) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[1]))))) && (float_Array_0[0] == ((float) double_Array_0[1]))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) && (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[2])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L104-L105] return (((((BOOL_unsigned_char_Array_0[1] ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[0]) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) 5)) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_unsigned_char_Array_0_0_))) && (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[3] == ((double) (((double_Array_0[1] + double_Array_0[0]) + double_Array_0[2]) - double_Array_0[4]))) : 1)) && (((~ unsigned_char_Array_0[0]) <= (((((-4 >> unsigned_short_int_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((-4 >> unsigned_short_int_Array_0[0])) : (unsigned_short_int_Array_0[0])))) ? (((unsigned_char_Array_0[1] - 64) < (unsigned_short_int_Array_0[0] / -8)) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[1]))))) && (float_Array_0[0] == ((float) double_Array_0[1]))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) && (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[2])) ; [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 111 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.2s, OverallIterations: 18, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1420 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1417 mSDsluCounter, 9978 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7218 mSDsCounter, 145 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 982 IncrementalHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 145 mSolverCounterUnsat, 2760 mSDtfsCounter, 982 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 529 GetRequests, 462 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=423occurred in iteration=10, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 17 MinimizatonAttempts, 549 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 2154 NumberOfCodeBlocks, 2154 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 2011 ConstructedInterpolants, 0 QuantifiedInterpolants, 5403 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 4488/4488 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 14:50:00,078 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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_c6e2c11b-f63f-4659-8641-cf61cc80b990/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-55.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 85aa73e9da404b3237f6b534f76a96725f8c968f66c8526708e2a81ace8745de --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:50:03,144 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:50:03,299 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 14:50:03,313 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:50:03,314 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:50:03,355 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:50:03,356 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:50:03,356 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:50:03,357 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:50:03,357 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:50:03,357 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:50:03,357 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:50:03,358 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:50:03,358 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:50:03,358 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:50:03,359 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:50:03,359 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:50:03,359 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:50:03,359 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:50:03,359 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:50:03,359 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:50:03,359 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:50:03,360 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:50:03,360 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 14:50:03,360 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 14:50:03,360 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:50:03,360 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 14:50:03,360 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:50:03,361 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:50:03,361 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:50:03,361 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:50:03,361 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:50:03,361 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:50:03,362 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:50:03,362 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:50:03,362 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:50:03,362 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:50:03,362 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:50:03,362 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 14:50:03,363 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 14:50:03,363 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:50:03,363 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:50:03,363 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:50:03,363 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:50:03,363 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_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 -> 85aa73e9da404b3237f6b534f76a96725f8c968f66c8526708e2a81ace8745de [2024-11-13 14:50:03,713 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:50:03,728 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:50:03,731 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:50:03,736 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:50:03,736 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:50:03,738 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-55.i Unable to find full path for "g++" [2024-11-13 14:50:05,812 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:50:06,076 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:50:06,077 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-55.i [2024-11-13 14:50:06,091 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/bin/uautomizer-verify-qhAvR1uOyd/data/cbb59f5c8/b19a71ee36a74260adff4188afd12a26/FLAG42bf6ef21 [2024-11-13 14:50:06,121 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/bin/uautomizer-verify-qhAvR1uOyd/data/cbb59f5c8/b19a71ee36a74260adff4188afd12a26 [2024-11-13 14:50:06,124 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:50:06,126 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:50:06,129 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:50:06,129 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:50:06,138 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:50:06,139 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:50:06" (1/1) ... [2024-11-13 14:50:06,140 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5de2832a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:50:06, skipping insertion in model container [2024-11-13 14:50:06,140 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:50:06" (1/1) ... [2024-11-13 14:50:06,168 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:50:06,359 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_c6e2c11b-f63f-4659-8641-cf61cc80b990/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-55.i[916,929] [2024-11-13 14:50:06,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:50:06,491 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:50:06,508 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_c6e2c11b-f63f-4659-8641-cf61cc80b990/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-55.i[916,929] [2024-11-13 14:50:06,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:50:06,612 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:50:06,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:50:06 WrapperNode [2024-11-13 14:50:06,613 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:50:06,614 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:50:06,615 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:50:06,615 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:50:06,623 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:50:06" (1/1) ... [2024-11-13 14:50:06,650 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:50:06" (1/1) ... [2024-11-13 14:50:06,714 INFO L138 Inliner]: procedures = 39, calls = 138, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 426 [2024-11-13 14:50:06,718 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:50:06,719 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:50:06,719 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:50:06,719 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:50:06,734 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:50:06" (1/1) ... [2024-11-13 14:50:06,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:50:06" (1/1) ... [2024-11-13 14:50:06,743 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:50:06" (1/1) ... [2024-11-13 14:50:06,796 INFO L175 MemorySlicer]: Split 108 memory accesses to 8 slices as follows [2, 14, 37, 3, 6, 24, 3, 19]. 34 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 2, 5, 1, 1, 3, 1, 1]. The 17 writes are split as follows [0, 2, 5, 1, 2, 3, 1, 3]. [2024-11-13 14:50:06,797 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:50:06" (1/1) ... [2024-11-13 14:50:06,797 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:50:06" (1/1) ... [2024-11-13 14:50:06,831 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:50:06" (1/1) ... [2024-11-13 14:50:06,837 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:50:06" (1/1) ... [2024-11-13 14:50:06,842 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:50:06" (1/1) ... [2024-11-13 14:50:06,849 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:50:06" (1/1) ... [2024-11-13 14:50:06,862 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:50:06,866 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:50:06,866 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:50:06,866 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:50:06,867 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:50:06" (1/1) ... [2024-11-13 14:50:06,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:50:06,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:50:06,915 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:50:06,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:50:06,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:50:06,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-13 14:50:06,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-13 14:50:06,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-13 14:50:06,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-13 14:50:06,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-13 14:50:06,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-13 14:50:06,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-11-13 14:50:06,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2024-11-13 14:50:06,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-13 14:50:06,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-13 14:50:06,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-13 14:50:06,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-13 14:50:06,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-13 14:50:06,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-13 14:50:06,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-11-13 14:50:06,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2024-11-13 14:50:06,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-13 14:50:06,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-13 14:50:06,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-13 14:50:06,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-13 14:50:06,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-13 14:50:06,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-13 14:50:06,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-13 14:50:06,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-13 14:50:06,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-13 14:50:06,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-13 14:50:06,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-13 14:50:06,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-13 14:50:06,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-13 14:50:06,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-13 14:50:06,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-13 14:50:06,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-11-13 14:50:06,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 14:50:06,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-13 14:50:06,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-13 14:50:06,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-13 14:50:06,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-13 14:50:06,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-13 14:50:06,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-13 14:50:06,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-13 14:50:06,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-13 14:50:06,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-13 14:50:06,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-13 14:50:06,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-13 14:50:06,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-13 14:50:06,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-13 14:50:06,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-13 14:50:06,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-11-13 14:50:06,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-13 14:50:06,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-13 14:50:06,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-13 14:50:06,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-13 14:50:06,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-13 14:50:06,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-13 14:50:06,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-11-13 14:50:06,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-11-13 14:50:06,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-13 14:50:06,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-13 14:50:06,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-13 14:50:06,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-13 14:50:06,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-13 14:50:06,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-13 14:50:06,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-11-13 14:50:06,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2024-11-13 14:50:06,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-13 14:50:06,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-13 14:50:06,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-13 14:50:06,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-13 14:50:06,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-13 14:50:06,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-13 14:50:06,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-13 14:50:06,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-11-13 14:50:06,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-13 14:50:06,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-13 14:50:06,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-13 14:50:06,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-13 14:50:06,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-13 14:50:06,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-13 14:50:06,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-11-13 14:50:06,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-11-13 14:50:06,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-13 14:50:06,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-13 14:50:06,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-13 14:50:06,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-13 14:50:06,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-13 14:50:06,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-13 14:50:06,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-11-13 14:50:06,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-11-13 14:50:06,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-13 14:50:06,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-13 14:50:06,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-13 14:50:06,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-13 14:50:06,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-13 14:50:06,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-13 14:50:06,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-11-13 14:50:06,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-11-13 14:50:06,970 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 14:50:06,970 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 14:50:06,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:50:06,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:50:06,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-13 14:50:06,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-13 14:50:06,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-13 14:50:06,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-13 14:50:06,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-13 14:50:06,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-13 14:50:06,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-13 14:50:06,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-13 14:50:06,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-13 14:50:06,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-13 14:50:06,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-13 14:50:06,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-13 14:50:06,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-13 14:50:06,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-13 14:50:06,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-11-13 14:50:06,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-11-13 14:50:06,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-13 14:50:06,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-13 14:50:06,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-13 14:50:06,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-13 14:50:06,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-13 14:50:06,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-13 14:50:06,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-13 14:50:06,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-11-13 14:50:07,285 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:50:07,287 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:50:10,483 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2024-11-13 14:50:10,483 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:50:10,501 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:50:10,501 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 14:50:10,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:50:10 BoogieIcfgContainer [2024-11-13 14:50:10,502 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:50:10,505 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:50:10,505 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:50:10,511 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:50:10,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:50:06" (1/3) ... [2024-11-13 14:50:10,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d9ca69a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:50:10, skipping insertion in model container [2024-11-13 14:50:10,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:50:06" (2/3) ... [2024-11-13 14:50:10,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d9ca69a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:50:10, skipping insertion in model container [2024-11-13 14:50:10,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:50:10" (3/3) ... [2024-11-13 14:50:10,515 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-55.i [2024-11-13 14:50:10,531 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:50:10,532 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-55.i that has 2 procedures, 99 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 14:50:10,592 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:50:10,604 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;@76f89668, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:50:10,605 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:50:10,609 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 85 states have internal predecessors, (122), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 14:50:10,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 14:50:10,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:50:10,627 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:50:10,627 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:50:10,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:50:10,636 INFO L85 PathProgramCache]: Analyzing trace with hash -403208498, now seen corresponding path program 1 times [2024-11-13 14:50:10,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:50:10,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [750060527] [2024-11-13 14:50:10,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:50:10,660 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 14:50:10,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:50:10,663 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:50:10,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:50:11,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:11,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 14:50:11,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:50:11,644 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-11-13 14:50:11,644 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:50:11,645 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:50:11,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [750060527] [2024-11-13 14:50:11,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [750060527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:50:11,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:50:11,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:50:11,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689866510] [2024-11-13 14:50:11,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:50:11,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 14:50:11,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:50:11,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 14:50:11,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:50:11,681 INFO L87 Difference]: Start difference. First operand has 99 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 85 states have internal predecessors, (122), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 14:50:11,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:50:11,730 INFO L93 Difference]: Finished difference Result 191 states and 298 transitions. [2024-11-13 14:50:11,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 14:50:11,733 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 113 [2024-11-13 14:50:11,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:50:11,739 INFO L225 Difference]: With dead ends: 191 [2024-11-13 14:50:11,740 INFO L226 Difference]: Without dead ends: 95 [2024-11-13 14:50:11,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 112 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 14:50:11,747 INFO L432 NwaCegarLoop]: 137 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, 137 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 14:50:11,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:50:11,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-13 14:50:11,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-13 14:50:11,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 81 states have (on average 1.3950617283950617) internal successors, (113), 81 states have internal predecessors, (113), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 14:50:11,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2024-11-13 14:50:11,808 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 113 [2024-11-13 14:50:11,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:50:11,809 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2024-11-13 14:50:11,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 14:50:11,810 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2024-11-13 14:50:11,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 14:50:11,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:50:11,813 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:50:11,830 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:50:12,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:50:12,016 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:50:12,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:50:12,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1708959294, now seen corresponding path program 1 times [2024-11-13 14:50:12,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:50:12,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [772426416] [2024-11-13 14:50:12,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:50:12,018 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 14:50:12,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:50:12,020 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:50:12,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:50:12,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:12,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 14:50:12,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:50:13,687 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 113 proven. 24 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-11-13 14:50:13,688 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:50:14,036 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:50:14,038 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:50:14,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [772426416] [2024-11-13 14:50:14,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [772426416] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 14:50:14,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:50:14,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2024-11-13 14:50:14,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649631494] [2024-11-13 14:50:14,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:50:14,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:50:14,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:50:14,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:50:14,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-13 14:50:14,045 INFO L87 Difference]: Start difference. First operand 95 states and 137 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:50:16,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:50:16,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:50:16,982 INFO L93 Difference]: Finished difference Result 234 states and 334 transitions. [2024-11-13 14:50:16,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:50:16,987 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2024-11-13 14:50:16,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:50:16,989 INFO L225 Difference]: With dead ends: 234 [2024-11-13 14:50:16,989 INFO L226 Difference]: Without dead ends: 142 [2024-11-13 14:50:16,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-13 14:50:16,993 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 62 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-13 14:50:16,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 496 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-13 14:50:16,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-13 14:50:17,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 139. [2024-11-13 14:50:17,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 122 states have (on average 1.3852459016393444) internal successors, (169), 123 states have internal predecessors, (169), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-13 14:50:17,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 197 transitions. [2024-11-13 14:50:17,021 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 197 transitions. Word has length 113 [2024-11-13 14:50:17,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:50:17,021 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 197 transitions. [2024-11-13 14:50:17,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:50:17,022 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 197 transitions. [2024-11-13 14:50:17,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 14:50:17,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:50:17,024 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:50:17,040 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:50:17,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:50:17,225 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:50:17,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:50:17,226 INFO L85 PathProgramCache]: Analyzing trace with hash 2131661120, now seen corresponding path program 1 times [2024-11-13 14:50:17,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:50:17,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1891888222] [2024-11-13 14:50:17,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:50:17,227 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 14:50:17,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:50:17,229 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:50:17,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:50:17,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:17,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 14:50:17,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:50:17,816 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 14:50:18,399 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 14:50:18,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 36 [2024-11-13 14:50:18,727 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:50:18,727 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:50:18,727 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:50:18,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1891888222] [2024-11-13 14:50:18,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1891888222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:50:18,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:50:18,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:50:18,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286656585] [2024-11-13 14:50:18,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:50:18,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:50:18,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:50:18,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:50:18,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:50:18,730 INFO L87 Difference]: Start difference. First operand 139 states and 197 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:50:20,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:50:20,347 INFO L93 Difference]: Finished difference Result 450 states and 639 transitions. [2024-11-13 14:50:20,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 14:50:20,348 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2024-11-13 14:50:20,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:50:20,353 INFO L225 Difference]: With dead ends: 450 [2024-11-13 14:50:20,353 INFO L226 Difference]: Without dead ends: 314 [2024-11-13 14:50:20,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-13 14:50:20,355 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 207 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-13 14:50:20,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 761 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-13 14:50:20,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-11-13 14:50:20,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 220. [2024-11-13 14:50:20,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 189 states have (on average 1.3703703703703705) internal successors, (259), 190 states have internal predecessors, (259), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-13 14:50:20,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 311 transitions. [2024-11-13 14:50:20,386 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 311 transitions. Word has length 113 [2024-11-13 14:50:20,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:50:20,387 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 311 transitions. [2024-11-13 14:50:20,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:50:20,387 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 311 transitions. [2024-11-13 14:50:20,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 14:50:20,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:50:20,389 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:50:20,400 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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)] Ended with exit code 0 [2024-11-13 14:50:20,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:50:20,590 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:50:20,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:50:20,591 INFO L85 PathProgramCache]: Analyzing trace with hash 572707832, now seen corresponding path program 1 times [2024-11-13 14:50:20,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:50:20,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [621594790] [2024-11-13 14:50:20,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:50:20,593 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 14:50:20,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:50:20,596 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:50:20,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:50:21,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:21,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 14:50:21,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:50:21,985 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:50:21,985 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:50:21,986 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:50:21,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [621594790] [2024-11-13 14:50:21,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [621594790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:50:21,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:50:21,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:50:21,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799968189] [2024-11-13 14:50:21,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:50:21,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:50:21,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:50:21,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:50:21,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:50:21,988 INFO L87 Difference]: Start difference. First operand 220 states and 311 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:50:22,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:50:22,531 INFO L93 Difference]: Finished difference Result 557 states and 791 transitions. [2024-11-13 14:50:22,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 14:50:22,533 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-13 14:50:22,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:50:22,539 INFO L225 Difference]: With dead ends: 557 [2024-11-13 14:50:22,540 INFO L226 Difference]: Without dead ends: 408 [2024-11-13 14:50:22,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-13 14:50:22,542 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 210 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 14:50:22,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 743 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 14:50:22,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-11-13 14:50:22,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 354. [2024-11-13 14:50:22,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 307 states have (on average 1.3648208469055374) internal successors, (419), 309 states have internal predecessors, (419), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-13 14:50:22,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 499 transitions. [2024-11-13 14:50:22,646 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 499 transitions. Word has length 115 [2024-11-13 14:50:22,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:50:22,647 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 499 transitions. [2024-11-13 14:50:22,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:50:22,647 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 499 transitions. [2024-11-13 14:50:22,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 14:50:22,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:50:22,655 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:50:22,674 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:50:22,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:50:22,856 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:50:22,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:50:22,857 INFO L85 PathProgramCache]: Analyzing trace with hash 438694326, now seen corresponding path program 1 times [2024-11-13 14:50:22,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:50:22,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1535534103] [2024-11-13 14:50:22,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:50:22,858 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 14:50:22,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:50:22,859 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:50:22,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:50:23,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:23,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 14:50:23,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:50:24,447 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 15 [2024-11-13 14:50:24,539 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 113 proven. 24 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-11-13 14:50:24,539 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:50:25,011 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:50:25,011 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:50:25,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1535534103] [2024-11-13 14:50:25,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1535534103] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 14:50:25,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:50:25,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-11-13 14:50:25,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389307088] [2024-11-13 14:50:25,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:50:25,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:50:25,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:50:25,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:50:25,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-13 14:50:25,014 INFO L87 Difference]: Start difference. First operand 354 states and 499 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:50:25,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:50:25,329 INFO L93 Difference]: Finished difference Result 646 states and 906 transitions. [2024-11-13 14:50:25,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:50:25,330 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-13 14:50:25,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:50:25,333 INFO L225 Difference]: With dead ends: 646 [2024-11-13 14:50:25,335 INFO L226 Difference]: Without dead ends: 366 [2024-11-13 14:50:25,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-13 14:50:25,337 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 58 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:50:25,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 603 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:50:25,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-11-13 14:50:25,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 289. [2024-11-13 14:50:25,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 246 states have (on average 1.3414634146341464) internal successors, (330), 246 states have internal predecessors, (330), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-13 14:50:25,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 402 transitions. [2024-11-13 14:50:25,370 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 402 transitions. Word has length 115 [2024-11-13 14:50:25,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:50:25,371 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 402 transitions. [2024-11-13 14:50:25,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:50:25,371 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 402 transitions. [2024-11-13 14:50:25,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 14:50:25,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:50:25,374 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:50:25,389 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:50:25,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:50:25,575 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:50:25,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:50:25,576 INFO L85 PathProgramCache]: Analyzing trace with hash -278863077, now seen corresponding path program 1 times [2024-11-13 14:50:25,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:50:25,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1149126196] [2024-11-13 14:50:25,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:50:25,576 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 14:50:25,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:50:25,579 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:50:25,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:50:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:26,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 14:50:26,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:50:27,059 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 113 proven. 24 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-11-13 14:50:27,059 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:50:27,402 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:50:27,402 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:50:27,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1149126196] [2024-11-13 14:50:27,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1149126196] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 14:50:27,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:50:27,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2024-11-13 14:50:27,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290933757] [2024-11-13 14:50:27,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:50:27,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:50:27,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:50:27,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:50:27,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-13 14:50:27,404 INFO L87 Difference]: Start difference. First operand 289 states and 402 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:50:29,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:50:29,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:50:29,898 INFO L93 Difference]: Finished difference Result 581 states and 806 transitions. [2024-11-13 14:50:29,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:50:29,899 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-13 14:50:29,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:50:29,904 INFO L225 Difference]: With dead ends: 581 [2024-11-13 14:50:29,904 INFO L226 Difference]: Without dead ends: 366 [2024-11-13 14:50:29,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-13 14:50:29,905 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 52 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-13 14:50:29,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 493 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-13 14:50:29,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-11-13 14:50:29,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 308. [2024-11-13 14:50:29,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 265 states have (on average 1.350943396226415) internal successors, (358), 265 states have internal predecessors, (358), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-13 14:50:29,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 430 transitions. [2024-11-13 14:50:29,953 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 430 transitions. Word has length 115 [2024-11-13 14:50:29,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:50:29,954 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 430 transitions. [2024-11-13 14:50:29,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:50:29,954 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 430 transitions. [2024-11-13 14:50:29,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 14:50:29,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:50:29,956 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:50:29,973 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:50:30,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:50:30,157 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:50:30,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:50:30,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1289980327, now seen corresponding path program 1 times [2024-11-13 14:50:30,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:50:30,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [708806566] [2024-11-13 14:50:30,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:50:30,159 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 14:50:30,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:50:30,160 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:50:30,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:50:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:30,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 14:50:30,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:50:30,665 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:50:30,666 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:50:30,666 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:50:30,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [708806566] [2024-11-13 14:50:30,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [708806566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:50:30,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:50:30,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:50:30,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253692315] [2024-11-13 14:50:30,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:50:30,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:50:30,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:50:30,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:50:30,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:50:30,668 INFO L87 Difference]: Start difference. First operand 308 states and 430 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:50:33,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:50:33,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:50:33,322 INFO L93 Difference]: Finished difference Result 548 states and 767 transitions. [2024-11-13 14:50:33,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:50:33,323 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-13 14:50:33,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:50:33,326 INFO L225 Difference]: With dead ends: 548 [2024-11-13 14:50:33,327 INFO L226 Difference]: Without dead ends: 314 [2024-11-13 14:50:33,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 111 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 14:50:33,329 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-13 14:50:33,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 519 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-13 14:50:33,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-11-13 14:50:33,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2024-11-13 14:50:33,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 271 states have (on average 1.3431734317343174) internal successors, (364), 271 states have internal predecessors, (364), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-13 14:50:33,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 436 transitions. [2024-11-13 14:50:33,365 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 436 transitions. Word has length 115 [2024-11-13 14:50:33,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:50:33,366 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 436 transitions. [2024-11-13 14:50:33,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:50:33,366 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 436 transitions. [2024-11-13 14:50:33,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 14:50:33,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:50:33,369 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:50:33,378 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:50:33,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:50:33,569 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:50:33,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:50:33,570 INFO L85 PathProgramCache]: Analyzing trace with hash 825954582, now seen corresponding path program 1 times [2024-11-13 14:50:33,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:50:33,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1173974309] [2024-11-13 14:50:33,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:50:33,571 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 14:50:33,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:50:33,572 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:50:33,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:50:33,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:33,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 14:50:33,992 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:50:34,694 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 113 proven. 24 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-11-13 14:50:34,694 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:50:34,961 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:50:34,961 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:50:34,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1173974309] [2024-11-13 14:50:34,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1173974309] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 14:50:34,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:50:34,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2024-11-13 14:50:34,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476659563] [2024-11-13 14:50:34,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:50:34,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:50:34,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:50:34,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:50:34,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-13 14:50:34,963 INFO L87 Difference]: Start difference. First operand 314 states and 436 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:50:35,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:50:35,231 INFO L93 Difference]: Finished difference Result 603 states and 828 transitions. [2024-11-13 14:50:35,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:50:35,232 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2024-11-13 14:50:35,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:50:35,236 INFO L225 Difference]: With dead ends: 603 [2024-11-13 14:50:35,236 INFO L226 Difference]: Without dead ends: 363 [2024-11-13 14:50:35,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-13 14:50:35,238 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 46 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:50:35,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 527 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:50:35,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-11-13 14:50:35,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 299. [2024-11-13 14:50:35,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 256 states have (on average 1.31640625) internal successors, (337), 256 states have internal predecessors, (337), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-13 14:50:35,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 409 transitions. [2024-11-13 14:50:35,272 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 409 transitions. Word has length 116 [2024-11-13 14:50:35,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:50:35,273 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 409 transitions. [2024-11-13 14:50:35,273 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:50:35,273 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 409 transitions. [2024-11-13 14:50:35,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-13 14:50:35,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:50:35,275 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:50:35,283 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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)] Ended with exit code 0 [2024-11-13 14:50:35,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:50:35,476 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:50:35,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:50:35,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1453151456, now seen corresponding path program 1 times [2024-11-13 14:50:35,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:50:35,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [237510090] [2024-11-13 14:50:35,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:50:35,477 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 14:50:35,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:50:35,478 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:50:35,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:50:36,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:36,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 14:50:36,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:50:36,798 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:50:36,798 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:50:36,798 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:50:36,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [237510090] [2024-11-13 14:50:36,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [237510090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:50:36,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:50:36,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:50:36,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660251901] [2024-11-13 14:50:36,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:50:36,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:50:36,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:50:36,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:50:36,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:50:36,800 INFO L87 Difference]: Start difference. First operand 299 states and 409 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:50:37,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:50:37,184 INFO L93 Difference]: Finished difference Result 557 states and 761 transitions. [2024-11-13 14:50:37,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:50:37,185 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-11-13 14:50:37,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:50:37,187 INFO L225 Difference]: With dead ends: 557 [2024-11-13 14:50:37,187 INFO L226 Difference]: Without dead ends: 332 [2024-11-13 14:50:37,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:50:37,189 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 163 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:50:37,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 569 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:50:37,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-11-13 14:50:37,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 296. [2024-11-13 14:50:37,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 253 states have (on average 1.3043478260869565) internal successors, (330), 253 states have internal predecessors, (330), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-13 14:50:37,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 402 transitions. [2024-11-13 14:50:37,216 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 402 transitions. Word has length 118 [2024-11-13 14:50:37,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:50:37,216 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 402 transitions. [2024-11-13 14:50:37,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:50:37,217 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 402 transitions. [2024-11-13 14:50:37,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-13 14:50:37,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:50:37,219 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:50:37,235 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:50:37,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:50:37,419 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:50:37,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:50:37,420 INFO L85 PathProgramCache]: Analyzing trace with hash -135196446, now seen corresponding path program 1 times [2024-11-13 14:50:37,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:50:37,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2021440296] [2024-11-13 14:50:37,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:50:37,421 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 14:50:37,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:50:37,425 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:50:37,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:50:38,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:38,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 14:50:38,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:50:38,122 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:50:38,122 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:50:38,122 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:50:38,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2021440296] [2024-11-13 14:50:38,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2021440296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:50:38,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:50:38,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:50:38,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350312236] [2024-11-13 14:50:38,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:50:38,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:50:38,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:50:38,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:50:38,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:50:38,124 INFO L87 Difference]: Start difference. First operand 296 states and 402 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:50:38,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:50:38,248 INFO L93 Difference]: Finished difference Result 521 states and 709 transitions. [2024-11-13 14:50:38,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:50:38,249 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-11-13 14:50:38,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:50:38,251 INFO L225 Difference]: With dead ends: 521 [2024-11-13 14:50:38,251 INFO L226 Difference]: Without dead ends: 299 [2024-11-13 14:50:38,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 114 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 14:50:38,254 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 526 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.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:50:38,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 526 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:50:38,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-13 14:50:38,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2024-11-13 14:50:38,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 256 states have (on average 1.296875) internal successors, (332), 256 states have internal predecessors, (332), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-13 14:50:38,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 404 transitions. [2024-11-13 14:50:38,284 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 404 transitions. Word has length 118 [2024-11-13 14:50:38,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:50:38,284 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 404 transitions. [2024-11-13 14:50:38,285 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:50:38,285 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 404 transitions. [2024-11-13 14:50:38,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-13 14:50:38,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:50:38,286 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:50:38,304 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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)] Ended with exit code 0 [2024-11-13 14:50:38,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:50:38,487 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:50:38,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:50:38,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1777722172, now seen corresponding path program 1 times [2024-11-13 14:50:38,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:50:38,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [6625939] [2024-11-13 14:50:38,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:50:38,488 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 14:50:38,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:50:38,490 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:50:38,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:50:38,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:38,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 14:50:38,951 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:50:39,207 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:50:39,208 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 155 treesize of output 65 [2024-11-13 14:50:39,263 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-13 14:50:39,263 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:50:39,263 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:50:39,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [6625939] [2024-11-13 14:50:39,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [6625939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:50:39,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:50:39,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:50:39,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626628964] [2024-11-13 14:50:39,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:50:39,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:50:39,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:50:39,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:50:39,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:50:39,265 INFO L87 Difference]: Start difference. First operand 299 states and 404 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 14:50:43,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:50:46,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:50:46,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:50:46,818 INFO L93 Difference]: Finished difference Result 579 states and 783 transitions. [2024-11-13 14:50:46,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:50:46,827 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2024-11-13 14:50:46,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:50:46,830 INFO L225 Difference]: With dead ends: 579 [2024-11-13 14:50:46,831 INFO L226 Difference]: Without dead ends: 302 [2024-11-13 14:50:46,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:50:46,833 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 116 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2024-11-13 14:50:46,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 424 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2024-11-13 14:50:46,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-13 14:50:46,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 299. [2024-11-13 14:50:46,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 256 states have (on average 1.28515625) internal successors, (329), 256 states have internal predecessors, (329), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-13 14:50:46,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 401 transitions. [2024-11-13 14:50:46,875 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 401 transitions. Word has length 118 [2024-11-13 14:50:46,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:50:46,875 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 401 transitions. [2024-11-13 14:50:46,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 14:50:46,876 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 401 transitions. [2024-11-13 14:50:46,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-13 14:50:46,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:50:46,878 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:50:46,889 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:50:47,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:50:47,079 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:50:47,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:50:47,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1305626718, now seen corresponding path program 1 times [2024-11-13 14:50:47,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:50:47,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [584750460] [2024-11-13 14:50:47,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:50:47,080 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 14:50:47,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:50:47,084 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:50:47,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:50:47,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:47,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 14:50:47,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:50:48,001 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:50:48,002 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 173 treesize of output 65 [2024-11-13 14:50:48,075 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-13 14:50:48,076 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:50:48,076 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:50:48,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [584750460] [2024-11-13 14:50:48,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [584750460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:50:48,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:50:48,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:50:48,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663778635] [2024-11-13 14:50:48,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:50:48,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:50:48,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:50:48,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:50:48,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:50:48,078 INFO L87 Difference]: Start difference. First operand 299 states and 401 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 14:50:51,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:50:55,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:50:55,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:50:55,455 INFO L93 Difference]: Finished difference Result 572 states and 767 transitions. [2024-11-13 14:50:55,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:50:55,462 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 120 [2024-11-13 14:50:55,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:50:55,464 INFO L225 Difference]: With dead ends: 572 [2024-11-13 14:50:55,464 INFO L226 Difference]: Without dead ends: 302 [2024-11-13 14:50:55,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:50:55,466 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 108 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:50:55,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 420 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2024-11-13 14:50:55,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-13 14:50:55,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 299. [2024-11-13 14:50:55,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 256 states have (on average 1.2734375) internal successors, (326), 256 states have internal predecessors, (326), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-13 14:50:55,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 398 transitions. [2024-11-13 14:50:55,489 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 398 transitions. Word has length 120 [2024-11-13 14:50:55,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:50:55,490 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 398 transitions. [2024-11-13 14:50:55,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 14:50:55,490 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 398 transitions. [2024-11-13 14:50:55,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-13 14:50:55,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:50:55,492 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:50:55,502 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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)] Ended with exit code 0 [2024-11-13 14:50:55,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:50:55,692 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:50:55,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:50:55,693 INFO L85 PathProgramCache]: Analyzing trace with hash 99151356, now seen corresponding path program 1 times [2024-11-13 14:50:55,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:50:55,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1224402571] [2024-11-13 14:50:55,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:50:55,694 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 14:50:55,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:50:55,696 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:50:55,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:50:56,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:56,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 14:50:56,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:50:56,572 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:50:56,572 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 173 treesize of output 65 [2024-11-13 14:50:56,649 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-13 14:50:56,650 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:50:56,650 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:50:56,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1224402571] [2024-11-13 14:50:56,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1224402571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:50:56,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:50:56,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:50:56,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631594633] [2024-11-13 14:50:56,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:50:56,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:50:56,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:50:56,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:50:56,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:50:56,652 INFO L87 Difference]: Start difference. First operand 299 states and 398 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 14:50:58,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:51:00,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:51:01,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:51:01,087 INFO L93 Difference]: Finished difference Result 565 states and 751 transitions. [2024-11-13 14:51:01,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:51:01,095 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2024-11-13 14:51:01,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:51:01,097 INFO L225 Difference]: With dead ends: 565 [2024-11-13 14:51:01,098 INFO L226 Difference]: Without dead ends: 302 [2024-11-13 14:51:01,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:51:01,099 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 99 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:51:01,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 416 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-13 14:51:01,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-13 14:51:01,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 299. [2024-11-13 14:51:01,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 256 states have (on average 1.26171875) internal successors, (323), 256 states have internal predecessors, (323), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-13 14:51:01,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 395 transitions. [2024-11-13 14:51:01,134 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 395 transitions. Word has length 122 [2024-11-13 14:51:01,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:51:01,135 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 395 transitions. [2024-11-13 14:51:01,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 14:51:01,135 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 395 transitions. [2024-11-13 14:51:01,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-13 14:51:01,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:51:01,137 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:51:01,148 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:51:01,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:51:01,337 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:51:01,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:51:01,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1666038882, now seen corresponding path program 1 times [2024-11-13 14:51:01,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:51:01,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2122890599] [2024-11-13 14:51:01,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:51:01,338 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 14:51:01,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:51:01,340 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:51:01,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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)] Waiting until timeout for monitored process [2024-11-13 14:51:01,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:01,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 14:51:01,992 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:51:02,388 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:51:02,389 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 173 treesize of output 65 [2024-11-13 14:51:02,449 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-13 14:51:02,449 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:51:02,449 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:51:02,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2122890599] [2024-11-13 14:51:02,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2122890599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:51:02,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:51:02,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:51:02,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126643361] [2024-11-13 14:51:02,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:51:02,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:51:02,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:51:02,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:51:02,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:51:02,452 INFO L87 Difference]: Start difference. First operand 299 states and 395 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 14:51:05,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:51:07,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:51:08,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:51:08,286 INFO L93 Difference]: Finished difference Result 558 states and 735 transitions. [2024-11-13 14:51:08,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:51:08,291 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 124 [2024-11-13 14:51:08,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:51:08,293 INFO L225 Difference]: With dead ends: 558 [2024-11-13 14:51:08,293 INFO L226 Difference]: Without dead ends: 302 [2024-11-13 14:51:08,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:51:08,294 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 89 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-11-13 14:51:08,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 409 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2024-11-13 14:51:08,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-13 14:51:08,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 299. [2024-11-13 14:51:08,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 256 states have (on average 1.25) internal successors, (320), 256 states have internal predecessors, (320), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-13 14:51:08,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 392 transitions. [2024-11-13 14:51:08,324 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 392 transitions. Word has length 124 [2024-11-13 14:51:08,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:51:08,325 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 392 transitions. [2024-11-13 14:51:08,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 14:51:08,325 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 392 transitions. [2024-11-13 14:51:08,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-13 14:51:08,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:51:08,326 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:51:08,340 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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)] Ended with exit code 0 [2024-11-13 14:51:08,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:51:08,527 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:51:08,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:51:08,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1366292034, now seen corresponding path program 1 times [2024-11-13 14:51:08,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:51:08,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1448078465] [2024-11-13 14:51:08,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:51:08,528 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 14:51:08,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:51:08,530 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:51:08,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:51:08,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:08,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 14:51:08,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:51:09,100 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-11-13 14:51:09,100 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:51:09,101 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:51:09,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1448078465] [2024-11-13 14:51:09,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1448078465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:51:09,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:51:09,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:51:09,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361209693] [2024-11-13 14:51:09,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:51:09,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:51:09,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:51:09,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:51:09,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:51:09,103 INFO L87 Difference]: Start difference. First operand 299 states and 392 transitions. Second operand has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-13 14:51:09,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:51:09,431 INFO L93 Difference]: Finished difference Result 572 states and 746 transitions. [2024-11-13 14:51:09,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:51:09,432 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 126 [2024-11-13 14:51:09,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:51:09,434 INFO L225 Difference]: With dead ends: 572 [2024-11-13 14:51:09,435 INFO L226 Difference]: Without dead ends: 311 [2024-11-13 14:51:09,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:51:09,436 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 1 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:51:09,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 554 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:51:09,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-13 14:51:09,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 299. [2024-11-13 14:51:09,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 256 states have (on average 1.23828125) internal successors, (317), 256 states have internal predecessors, (317), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-13 14:51:09,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 389 transitions. [2024-11-13 14:51:09,475 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 389 transitions. Word has length 126 [2024-11-13 14:51:09,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:51:09,476 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 389 transitions. [2024-11-13 14:51:09,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-13 14:51:09,476 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 389 transitions. [2024-11-13 14:51:09,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-13 14:51:09,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:51:09,478 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:51:09,488 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:51:09,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:51:09,679 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:51:09,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:51:09,679 INFO L85 PathProgramCache]: Analyzing trace with hash 967100604, now seen corresponding path program 1 times [2024-11-13 14:51:09,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:51:09,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [573402905] [2024-11-13 14:51:09,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:51:09,680 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 14:51:09,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:51:09,682 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:51:09,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:51:10,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:10,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 14:51:10,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:51:10,274 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 14:51:10,750 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 14:51:10,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 23 treesize of output 15 [2024-11-13 14:51:10,874 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:51:10,874 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:51:10,875 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:51:10,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [573402905] [2024-11-13 14:51:10,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [573402905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:51:10,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:51:10,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:51:10,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873655766] [2024-11-13 14:51:10,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:51:10,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:51:10,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:51:10,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:51:10,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:51:10,876 INFO L87 Difference]: Start difference. First operand 299 states and 389 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:51:12,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:51:12,149 INFO L93 Difference]: Finished difference Result 736 states and 957 transitions. [2024-11-13 14:51:12,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 14:51:12,150 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 126 [2024-11-13 14:51:12,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:51:12,167 INFO L225 Difference]: With dead ends: 736 [2024-11-13 14:51:12,167 INFO L226 Difference]: Without dead ends: 613 [2024-11-13 14:51:12,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-13 14:51:12,168 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 305 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:51:12,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 938 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-13 14:51:12,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-11-13 14:51:12,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 499. [2024-11-13 14:51:12,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 428 states have (on average 1.2383177570093458) internal successors, (530), 428 states have internal predecessors, (530), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-13 14:51:12,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 650 transitions. [2024-11-13 14:51:12,207 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 650 transitions. Word has length 126 [2024-11-13 14:51:12,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:51:12,208 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 650 transitions. [2024-11-13 14:51:12,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:51:12,208 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 650 transitions. [2024-11-13 14:51:12,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-13 14:51:12,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:51:12,209 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:51:12,221 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:51:12,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:51:12,410 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:51:12,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:51:12,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1002868657, now seen corresponding path program 1 times [2024-11-13 14:51:12,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:51:12,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2057601476] [2024-11-13 14:51:12,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:51:12,411 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 14:51:12,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:51:12,413 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:51:12,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:51:12,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:12,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-13 14:51:12,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:51:13,007 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 14:51:13,579 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 14:51:13,691 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 14:51:13,722 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:51:13,722 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:51:13,722 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:51:13,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2057601476] [2024-11-13 14:51:13,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2057601476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:51:13,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:51:13,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:51:13,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097459163] [2024-11-13 14:51:13,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:51:13,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:51:13,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:51:13,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:51:13,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:51:13,725 INFO L87 Difference]: Start difference. First operand 499 states and 650 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:51:14,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:51:14,801 INFO L93 Difference]: Finished difference Result 1036 states and 1348 transitions. [2024-11-13 14:51:14,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 14:51:14,802 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 127 [2024-11-13 14:51:14,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:51:14,804 INFO L225 Difference]: With dead ends: 1036 [2024-11-13 14:51:14,804 INFO L226 Difference]: Without dead ends: 613 [2024-11-13 14:51:14,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-13 14:51:14,805 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 264 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-13 14:51:14,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 969 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-13 14:51:14,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-11-13 14:51:14,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 499. [2024-11-13 14:51:14,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 428 states have (on average 1.233644859813084) internal successors, (528), 428 states have internal predecessors, (528), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-13 14:51:14,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 648 transitions. [2024-11-13 14:51:14,846 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 648 transitions. Word has length 127 [2024-11-13 14:51:14,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:51:14,847 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 648 transitions. [2024-11-13 14:51:14,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:51:14,847 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 648 transitions. [2024-11-13 14:51:14,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 14:51:14,848 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:51:14,849 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:51:14,862 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:51:15,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:51:15,050 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:51:15,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:51:15,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1496156093, now seen corresponding path program 1 times [2024-11-13 14:51:15,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:51:15,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [786565676] [2024-11-13 14:51:15,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:51:15,051 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 14:51:15,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:51:15,054 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:51:15,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:51:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:15,959 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 14:51:15,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:51:16,004 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:51:16,004 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:51:16,004 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:51:16,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [786565676] [2024-11-13 14:51:16,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [786565676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:51:16,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:51:16,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:51:16,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504616944] [2024-11-13 14:51:16,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:51:16,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:51:16,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:51:16,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:51:16,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:51:16,006 INFO L87 Difference]: Start difference. First operand 499 states and 648 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:51:16,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:51:16,224 INFO L93 Difference]: Finished difference Result 934 states and 1217 transitions. [2024-11-13 14:51:16,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:51:16,225 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), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 128 [2024-11-13 14:51:16,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:51:16,228 INFO L225 Difference]: With dead ends: 934 [2024-11-13 14:51:16,228 INFO L226 Difference]: Without dead ends: 511 [2024-11-13 14:51:16,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 125 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 14:51:16,230 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:51:16,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 376 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:51:16,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2024-11-13 14:51:16,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 507. [2024-11-13 14:51:16,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 436 states have (on average 1.2293577981651376) internal successors, (536), 436 states have internal predecessors, (536), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-13 14:51:16,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 656 transitions. [2024-11-13 14:51:16,272 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 656 transitions. Word has length 128 [2024-11-13 14:51:16,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:51:16,273 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 656 transitions. [2024-11-13 14:51:16,273 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), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:51:16,273 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 656 transitions. [2024-11-13 14:51:16,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 14:51:16,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:51:16,275 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:51:16,297 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:51:16,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:51:16,475 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:51:16,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:51:16,476 INFO L85 PathProgramCache]: Analyzing trace with hash -2118752833, now seen corresponding path program 1 times [2024-11-13 14:51:16,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:51:16,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2049191174] [2024-11-13 14:51:16,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:51:16,477 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 14:51:16,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:51:16,479 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:51:16,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:51:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:17,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 14:51:17,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:51:17,414 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:51:17,414 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:51:17,414 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:51:17,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2049191174] [2024-11-13 14:51:17,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2049191174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:51:17,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:51:17,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:51:17,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910832068] [2024-11-13 14:51:17,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:51:17,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:51:17,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:51:17,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:51:17,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:51:17,417 INFO L87 Difference]: Start difference. First operand 507 states and 656 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:51:17,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:51:17,618 INFO L93 Difference]: Finished difference Result 950 states and 1233 transitions. [2024-11-13 14:51:17,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:51:17,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 128 [2024-11-13 14:51:17,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:51:17,622 INFO L225 Difference]: With dead ends: 950 [2024-11-13 14:51:17,622 INFO L226 Difference]: Without dead ends: 519 [2024-11-13 14:51:17,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 124 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 14:51:17,624 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 1 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:51:17,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 493 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:51:17,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2024-11-13 14:51:17,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 515. [2024-11-13 14:51:17,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 444 states have (on average 1.2252252252252251) internal successors, (544), 444 states have internal predecessors, (544), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-13 14:51:17,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 664 transitions. [2024-11-13 14:51:17,661 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 664 transitions. Word has length 128 [2024-11-13 14:51:17,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:51:17,662 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 664 transitions. [2024-11-13 14:51:17,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:51:17,662 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 664 transitions. [2024-11-13 14:51:17,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 14:51:17,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:51:17,664 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:51:17,688 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:51:17,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:51:17,865 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:51:17,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:51:17,865 INFO L85 PathProgramCache]: Analyzing trace with hash -343745471, now seen corresponding path program 1 times [2024-11-13 14:51:17,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:51:17,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [413116350] [2024-11-13 14:51:17,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:51:17,866 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 14:51:17,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:51:17,867 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:51:17,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:51:18,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:18,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 14:51:18,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:51:18,829 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:51:18,829 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:51:18,829 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:51:18,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [413116350] [2024-11-13 14:51:18,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [413116350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:51:18,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:51:18,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:51:18,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506635291] [2024-11-13 14:51:18,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:51:18,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:51:18,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:51:18,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:51:18,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:51:18,831 INFO L87 Difference]: Start difference. First operand 515 states and 664 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:51:19,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:51:19,194 INFO L93 Difference]: Finished difference Result 966 states and 1249 transitions. [2024-11-13 14:51:19,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:51:19,195 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 128 [2024-11-13 14:51:19,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:51:19,198 INFO L225 Difference]: With dead ends: 966 [2024-11-13 14:51:19,198 INFO L226 Difference]: Without dead ends: 527 [2024-11-13 14:51:19,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:51:19,201 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 1 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:51:19,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 610 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:51:19,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2024-11-13 14:51:19,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 523. [2024-11-13 14:51:19,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 452 states have (on average 1.2212389380530972) internal successors, (552), 452 states have internal predecessors, (552), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-13 14:51:19,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 672 transitions. [2024-11-13 14:51:19,247 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 672 transitions. Word has length 128 [2024-11-13 14:51:19,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:51:19,247 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 672 transitions. [2024-11-13 14:51:19,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:51:19,248 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 672 transitions. [2024-11-13 14:51:19,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-13 14:51:19,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:51:19,249 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:51:19,270 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:51:19,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:51:19,452 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:51:19,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:51:19,453 INFO L85 PathProgramCache]: Analyzing trace with hash -341898429, now seen corresponding path program 1 times [2024-11-13 14:51:19,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:51:19,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1229063306] [2024-11-13 14:51:19,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:51:19,454 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 14:51:19,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:51:19,456 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:51:19,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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)] Waiting until timeout for monitored process [2024-11-13 14:51:20,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:20,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 14:51:20,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:51:21,086 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 14:51:21,130 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:51:21,130 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:51:21,130 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:51:21,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1229063306] [2024-11-13 14:51:21,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1229063306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:51:21,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:51:21,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:51:21,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902280072] [2024-11-13 14:51:21,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:51:21,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:51:21,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:51:21,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:51:21,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:51:21,132 INFO L87 Difference]: Start difference. First operand 523 states and 672 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:51:21,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:51:21,817 INFO L93 Difference]: Finished difference Result 861 states and 1112 transitions. [2024-11-13 14:51:21,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:51:21,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 128 [2024-11-13 14:51:21,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:51:21,822 INFO L225 Difference]: With dead ends: 861 [2024-11-13 14:51:21,823 INFO L226 Difference]: Without dead ends: 736 [2024-11-13 14:51:21,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:51:21,824 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 56 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 14:51:21,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 533 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 14:51:21,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2024-11-13 14:51:21,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 733. [2024-11-13 14:51:21,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 634 states have (on average 1.22397476340694) internal successors, (776), 634 states have internal predecessors, (776), 84 states have call successors, (84), 14 states have call predecessors, (84), 14 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-13 14:51:21,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 944 transitions. [2024-11-13 14:51:21,876 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 944 transitions. Word has length 128 [2024-11-13 14:51:21,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:51:21,877 INFO L471 AbstractCegarLoop]: Abstraction has 733 states and 944 transitions. [2024-11-13 14:51:21,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:51:21,877 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 944 transitions. [2024-11-13 14:51:21,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-13 14:51:21,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:51:21,878 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:51:21,895 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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)] Ended with exit code 0 [2024-11-13 14:51:22,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:51:22,079 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:51:22,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:51:22,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1508493540, now seen corresponding path program 1 times [2024-11-13 14:51:22,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:51:22,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1557853625] [2024-11-13 14:51:22,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:51:22,080 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 14:51:22,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:51:22,082 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:51:22,085 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:51:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:25,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-13 14:51:25,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:51:25,963 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 8 treesize of output 1 [2024-11-13 14:51:26,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-13 14:51:26,519 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:51:26,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 33 [2024-11-13 14:51:26,647 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 14:51:26,723 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:51:26,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 15 [2024-11-13 14:51:26,809 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 123 proven. 9 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2024-11-13 14:51:26,809 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:51:27,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14:51:27,618 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-13 14:51:27,618 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:51:27,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1557853625] [2024-11-13 14:51:27,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1557853625] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:51:27,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:51:27,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2024-11-13 14:51:27,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507516445] [2024-11-13 14:51:27,619 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:51:27,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-13 14:51:27,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:51:27,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 14:51:27,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-11-13 14:51:27,620 INFO L87 Difference]: Start difference. First operand 733 states and 944 transitions. Second operand has 16 states, 14 states have (on average 9.428571428571429) internal successors, (132), 16 states have internal predecessors, (132), 6 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2024-11-13 14:51:32,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:51:32,328 INFO L93 Difference]: Finished difference Result 1080 states and 1375 transitions. [2024-11-13 14:51:32,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-13 14:51:32,329 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 9.428571428571429) internal successors, (132), 16 states have internal predecessors, (132), 6 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) Word has length 129 [2024-11-13 14:51:32,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:51:32,333 INFO L225 Difference]: With dead ends: 1080 [2024-11-13 14:51:32,334 INFO L226 Difference]: Without dead ends: 730 [2024-11-13 14:51:32,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=179, Invalid=523, Unknown=0, NotChecked=0, Total=702 [2024-11-13 14:51:32,338 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 446 mSDsluCounter, 1231 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 1382 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-13 14:51:32,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 1382 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-13 14:51:32,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2024-11-13 14:51:32,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 705. [2024-11-13 14:51:32,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 610 states have (on average 1.2114754098360656) internal successors, (739), 612 states have internal predecessors, (739), 76 states have call successors, (76), 18 states have call predecessors, (76), 18 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2024-11-13 14:51:32,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 891 transitions. [2024-11-13 14:51:32,398 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 891 transitions. Word has length 129 [2024-11-13 14:51:32,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:51:32,399 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 891 transitions. [2024-11-13 14:51:32,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 9.428571428571429) internal successors, (132), 16 states have internal predecessors, (132), 6 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2024-11-13 14:51:32,399 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 891 transitions. [2024-11-13 14:51:32,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-13 14:51:32,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:51:32,400 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:51:32,424 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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)] Forceful destruction successful, exit code 0 [2024-11-13 14:51:32,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:51:32,601 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:51:32,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:51:32,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1727348258, now seen corresponding path program 1 times [2024-11-13 14:51:32,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:51:32,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [808328895] [2024-11-13 14:51:32,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:51:32,602 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 14:51:32,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:51:32,605 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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 14:51:32,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2c11b-f63f-4659-8641-cf61cc80b990/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